Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components

Similar documents
Switch Construction CS

Switching Hardware. Spring 2018 CS 438 Staff, University of Illinois 1

Media Access Protocols. Spring 2018 CS 438 Staff, University of Illinois 1

Introduction to Wireless & Mobile Systems. Chapter 6. Multiple Radio Access Cengage Learning Engineering. All Rights Reserved.

Message Integrity and Hash Functions. TELE3119: Week4

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1

Lecture 10 Collision resolution. Collision resolution

Introduction to Network Technologies & Layered Architecture BUPT/QMUL

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns

Multiprocessors. HPC Prof. Robert van Engelen

Traditional queuing behaviour in routers. Scheduling and queue management. Questions. Scheduling mechanisms. Scheduling [1] Scheduling [2]

n Based on unrealistic growth forecast n Overcapacity: Fiber 5x100 in three years n Wireless: Expensive spectrum licenses n Fibers

Course Information. Details. Topics. Network Examples. Overview. Walrand Lecture 1. EECS 228a. EECS 228a Lecture 1 Overview: Networks

Copyright 2010, Elsevier Inc. All rights Reserved

1. SWITCHING FUNDAMENTALS

The Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

Lecture 28: Data Link Layer

Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.

History Based Probabilistic Backoff Algorithm

Python Programming: An Introduction to Computer Science

Quality of Service. Spring 2018 CS 438 Staff - University of Illinois 1

Communication methods. Communication methods. Communication methods. Dimensions to consider. Waveform

Security of Bluetooth: An overview of Bluetooth Security

Lower Bounds for Sorting

CS 111: Program Design I Lecture 19: Networks, the Web, and getting text from the Web in Python

Communication methods. Communication methods. Communication methods. Dimensions to consider. Waveform

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Overview Queueing Disciplines TCP Congestion Control Congestion Avoidance Mechanisms Quality of Service

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5

prerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits:

CS 111: Program Design I Lecture 21: Network Analysis. Robert H. Sloan & Richard Warner University of Illinois at Chicago April 10, 2018

WYSE Academic Challenge Sectional Computer Science 2005 SOLUTION SET

CS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1

Overview. Some Definitions. Some definitions. High Performance Computing Programming Paradigms and Scalability Part 2: High-Performance Networks

1&1 Next Level Hosting

THE WAY OF CALCULATING THE TRAFFIC AND SIGNALING NETWORK DIMENSION OF COMMON CHANNEL SIGNALING NO.7 (CCS7)

Master Informatics Eng. 2017/18. A.J.Proença. Memory Hierarchy. (most slides are borrowed) AJProença, Advanced Architectures, MiEI, UMinho, 2017/18 1

CMSC Computer Architecture Lecture 5: Pipelining. Prof. Yanjing Li University of Chicago

Randomized and Quantum Protocols in Distributed Computation

Using VTR Emulation on Avid Systems

The Magma Database file formats

On Nonblocking Folded-Clos Networks in Computer Communication Environments

Examples and Applications of Binary Search

Abstract. Chapter 4 Computation. Overview 8/13/18. Bjarne Stroustrup Note:

IS-IS in Detail. ISP Workshops

Outline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions

A network throughput comparison of optical metro ring architectures

Partition in mobile adhoc network with mobility-a new approach for effective use of fast IP address autoconfiguration

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Traffic Models and QoS

EECS 122, Lecture 24 Introduction to the Telephone Network. Kevin Fall Jean Walrand

Introduction to OSPF. ISP Training Workshops

A New per-class Flow Fixed Proportional Differentiated Service for Multi-service Wireless LAN*

One advantage that SONAR has over any other music-sequencing product I ve worked

The CCITT Communication Protocol for Videophone Teleconferencing Equipment

Random Graphs and Complex Networks T

CMSC Computer Architecture Lecture 11: More Caches. Prof. Yanjing Li University of Chicago

APPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview

Design of efficient, virtual non-blocking optical switches

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

Politecnico di Milano Advanced Network Technologies Laboratory. Internet of Things. Projects

Elementary Educational Computer

Workflow model GM AR. Gumpy. Dynagump. At a very high level, this is what gump does. We ll be looking at each of the items described here seperately.

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Operating System Concepts. Operating System Concepts

Implementing Consistency -- Paxos. Some slides from Michael Freedman

Bluetooth Basics. Bluetooth Overview

Markov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size

SERIAL COMMUNICATION INTERFACE FOR ESA ESTRO

Ones Assignment Method for Solving Traveling Salesman Problem

CS 111: Program Design I Lecture 18: Web and getting text from it

Admission control issues in sensor clusters

1 Graph Sparsfication

MOTIF XF Extension Owner s Manual

Lecture 3. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram

Performance Analysis of Multiclass FIFO: Motivation, Difficulty and a Network Calculus Approach

Pattern Recognition Systems Lab 1 Least Mean Squares

Chapter 4 The Datapath

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 3 Classification of FFT Processor Algorithms

Chapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

BST Sequence of Operations

BGP Attributes and Path Selection. ISP Training Workshops

Prevention of Black Hole Attack in Mobile Ad-hoc Networks using MN-ID Broadcasting

Table 2 GSM, UMTS and LTE Coverage Levels

How do we evaluate algorithms?

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

Improving Template Based Spike Detection

The Simeck Family of Lightweight Block Ciphers

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

The isoperimetric problem on the hypercube

SATELLITE-ATM NETWORKING AND CALL PERFORMANCE EVALUATION FOR MULTIMEDIA BROADBAND SERVICES

The Value of Peering

SCAN INSPECT TRACK SOLVE

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions

Transcription:

Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1

Project #4 otes IPv6Iit, IPv6socket, routig IPv6Iit, IPv6socket, routig Recv thread, Forwards packets IPv6Iit, IPv6socket, routig 2

Trasmissio: Satellites Differet Orbits Possible orbit affects may commuicatio properties Geosychroous always over the same spot o the earth 36,000 Km orbit is required oly 180 slots possible uses oe uplik ad oe dow lik frequecy large roud-trip latecies LEO (Low Earth Orbit) each satellite keeps movig ito ad out of rage solutio: use a large umber of satellites sort of like cells, but the cells are the oes movig lower roud-trip latecy 3

Sedig More Tha oe Sigal At Oce Called multiplexig origial goal of Bell was to MUX multiple telegraph sigals Time Divisio Multiplexig everyoe gets whole badwidth but oly whe its their tur 193 Bit frame (125 msec) Chael 1 Chael 2 Chael 3 Chael 4 Chael 24 1 0 Bit 1 is a framig code 7 Data bits per chael per sample Bit 8 is for sigalig figure copyright, 1996, Adrew S. Taebaum 4

Frequecy Divisio Multiplexig Frequecy Divisio everyoe gets to talk at oce but oly i their ow frequecy Chael 1 1 Atteuatio factor Chael 2 1 Chael 3 1 Chael 2 Chael 1 Chael 3 60 64 Frequecy (khz) (c) 68 72 300 3100 Frequecy (Hz) (a) 60 64 68 72 Frequecy (khz) (b) figure copyright, 1996, Adrew S. Taebaum 5

ATM Switchig Requiremets be able to switch 360,000 cells/sec per iput lik switch cells with as low a discard rate as possible ever reorder the cells o a virtual circuit Issues multiple cells destied for the same output at oce eed to buffer oe of them must esure fairess is maitaied head-of-lie blockig possible that a blocked output is holdig up cells that could be delivered 6

Switchig Fabric (space divisio) Cross bars are great, but require O( 2 ) wires Ca use a collectio of smaller cross bar switches pealty: a request to coect may block Crossbars k k k k Iputs = 16, = 4, k = 2 = 16, = 4, k = 3 k Crossbars Crossbars k k k k outputs Crossbars k k k k Iputs k Crossbars Crossbar s k k k k outputs (a) From: Computer etworks, 3 rd Ed. by Adrew S. Taebaum, (c)1996 Pretice Hall. (b) 7

Batcher-baya Switchig Baya ca do a good or poor job of switchig due to collisios if the iputs are sorted, we get performace Batcher sorts traffic base o full address of destiatio compares two collidig packets ad uses fial destiatio to select output port requires O(log 2 ) odes (2x2 switchig elemets) Title: (Adobe Illustrator (R) Versio 5.0 Level 2 Emulatio) Creator: Adobe Illustrator(TM) 5.0 CreatioDate: (04/10/93) () From: Computer etworks, 3 rd Ed. by Adrew S. Taebaum, (c)1996 Pretice Hall. 8

Medium Access Layer Broadcast etworks share a commo resource for commuicatio bus, wire, air, etc. eed to coordiatio access to this resource Limits of Static Chael Allocatio suitable for costat rate traffic of similar speeds however, bursty traffic results i poor chael utilizatio cosider oe queue vs. separate queues for each perso queues with bursty arrival have mea delay times 1 queue Dyamic Allocatio oly use chael whe have somethig to sed eed to cotrol access to the chael 9

Shared Chael Model Statio model idepedet statios each wats to sed λ frames per secod a statio may ot sed aother frame util the first is set Sigle Chael Assumptio all statios commuicate over a sigle shared chael Collisios: two statios attempt to sed at oce Time either trasmissio succeeds cotiuous time: frame trasmissios ca start aytime discrete time: clock esures all seds iitiate at the start of a slot Carrier Sese statios ca tell if chael is i use before sedig statios must wait to kow if chael was i use 10

Aloha Statios groud based radio statios o islads Pure Aloha If sed data at will, collisios will happe o collisio, wait a radom amout of time & try agai use stadard, fixed size packets what is chael efficiecy (assumig Poisso distributio)? S ew frames per frame time assume G total frames tryig to be set per frame time P 0 = probability of exactly oe seder sedig S = G P 0 probability of k frames geerated durig a frame time Pr[k] = G k e -G / k! P o = e -G e -G = e -2G, so S= Ge -2G 11

Performace of Aloha Collides with the start of the shaded frame t Collides with the ed of the shaded frame to to+ t to+ 2t to+ 3t Time Vulerable From: Computer etworks, 3 rd Ed. by Adrew S. Taebaum, (c)1996 Pretice Hall. S (throughput per frame time) 0.40 0.30 Slotted ALOHA: S = Ge -DG 0.20 0.10 Pure ALOHA: S = Ge -D2G 0 0.5 1.0 1.5 2.0 3.0 G (attempts per packet time) From: Computer etworks, 3 rd Ed. by Adrew S. Taebaum, (c)1996 Pretice Hall. 12

Aloha (cot.) Slotted Aloha Use a cetral clock Each statio oly seds at the start of frame Reduces collisio widow by 1/2 S = G e -G 13