Advanced Computer Networks C13

Slides:



Advertisements
Similar presentations
Local Area Networks1 LANs Studying Local Area Networks Via Media Access Control (MAC) SubLayer.
Advertisements

Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.
EECC694 - Shaaban #1 lec #5 Spring Data Link In Broadcast Networks: The Media Access Sublayer Broadcast networks with multi-access (or random.
Multiple access What if multiple machines are sharing the same link?
Communication Networks Lecture 5 NETW 501-L5: NETW 501-L5: Medium Access Control Dr.-Ing. Khaled Shawky Hassan Room: C3-222, ext: 1204,
LANs Local Area Networks via the Media Access Control (MAC) Sub Layer LANs Local Area Networks via the Media Access Control (MAC) Sub Layer Advanced Advanced.
1 ELEN602 Lecture 10 Review of last lecture –M/G/1 and M/D/1 Results Multi-access Networks Medium Access Control –ALOHA –Slotted ALOHA.
1 Pertemuan 13 Teknik Akses Jaringan - Random Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
MAC Protocols Media Access Control (who gets the use the channel) zContention-based yALOHA and Slotted ALOHA. yCSMA. yCSMA/CD. TDM and FDM are inefficient.
CS 5253 Workshop 1 MAC Protocol and Traffic Model.
5: DataLink Layer5-1 Data Link Layer r What is Data Link Layer? r Multiple access protocols r Ethernet.
1 Link Layer Message M A B Problem: Given a message M at a node A consisting of several packets, how do you send the packets to a “neighbor” node B –Neighbor:
DataLink Layer session 1 TELE3118: Network Technologies Week 2: Data Link Layer Framing, Error Control, Multiple Access Some slides have been taken.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 16 Introduction to Computer Networks.
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao
Studying Local Area Networks Via Media Access Control (MAC) SubLayer
5: DataLink Layer5-1 Link Layer – Error Detection/Correction and MAC.
5: DataLink Layer5-1 Chapter 5 Link Layer and LANs Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross.
16 – CSMA/CD - ARP Network Layer4-1. 5: DataLink Layer5-2 CSMA (Carrier Sense Multiple Access) CSMA: listen before transmit: If channel sensed idle: transmit.
Networks: Local Area Networks1 LANs Studying Local Area Networks Via Media Access Control (MAC) SubLayer.
Computer Networks: Local Area Networks 1 LANs Studying Local Area Networks via the Media Access Control (MAC) SubLayer.
Medium Access Control Sublayer
Lecture 16 Random Access protocols r A node transmits at random at full channel data rate R. r If two or more nodes “collide”, they retransmit at random.
Shashank Srivastava Motilal Nehru National Institute Of Technology, Allahabad Medium Access Control.
1 ECE453 – Introduction to Computer Networks Lecture 7 – Multiple Access Control (I)
5: DataLink Layer5-1 Chapter 5 Link Layer and LANs Part 3: MAC Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley.
McGraw-Hill © The McGraw-Hill Companies, Inc., 2004 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.
4-1 Last time □ Link layer overview ♦ Services ♦ Adapters □ Error detection and correction ♦ Parity check ♦ Internet checksum ♦ CRC □ PPP ♦ Byte stuffing.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking LANs 2: MAC protocols.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Link Layer multiple.
Network Layer4-1 Lower limit on the number of check bits r We want to design a code m with m message bits and r check bits Allowing all single errors to.
Medium Access Control NWEN302 Computer Network Design.
Layer 2 Technologies At layer 2 we create and transmit frames over communications channels Format of frames and layer 2 transmission protocols are dependent.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.
4: DataLink Layer1 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single wire, e.g. PPP, SLIP) r broadcast (shared wire.
Medium Access Control Sub Layer
Network Layer4-1 Link Layer: Introduction Some terminology: r hosts and routers are nodes (bridges and switches too) r communication channels that connect.
Chapter 6 Multiple Radio Access
5: DataLink Layer5-1 The Data Link Layer Chapter 5 Kurose and Ross Today 5.1 and 5.3.
Multiple Access Links and Protocols
CS3502: Data and Computer Networks Local Area Networks - 1 introduction and early broadcast protocols.
5: DataLink Layer 5a-1 Multiple Access protocol. 5: DataLink Layer 5a-2 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single.
Data Link Layer. Useful References r Wireless Communications and Networks by William Stallings r Computer Networks (third edition) by Andrew Tanenbaum.
LANs Local Area Networks via the Media Access Control (MAC) Sub Layer LANs Local Area Networks via the Media Access Control (MAC) Sub Layer Advanced Computer.
Ch 12. Multiple Access. Multiple Access for Shared Link Dedicated link – Point-to-point connection is sufficient Shared link – Link is not dedicated –
CS3502: Data and Computer Networks Local Area Networks - 1 introduction and early broadcast protocols.
EE 122: Lecture 6 Ion Stoica September 13, 2001 (* this talk is based in part on the on-line slides of J. Kurose & K. Rose)
Transport Layer 3-1 Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012  CPSC.
5: DataLink Layer5-1 Link Layer r 5.1 Introduction and services r 5.2 Error detection and correction r 5.3Multiple access protocols r 5.4 Link-layer Addressing.
Chapter 4 The Medum Access Sublayer. MA Sublayer Additional Reference –Local and Metropolitan Area Networks, William Stallings, Prentice Hall, 2000, 6th.
THE MEDIUM ACCESS CONTROL SUBLAYER 4.1 THE CHANNEL ALLOCATION PROBLEM 4.2 MULTIPLE ACCESS PROTOCOLS.
5: DataLink Layer5-1 Slotted ALOHA Assumptions r all frames same size r time is divided into equal size slots, time to transmit 1 frame r nodes start to.
COMPUTER NETWORKS Data-link Layer (The Medium Access Control Sublayer) MAC Sublayer.
Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A note on the use of these.
Chapter 5 Link Layer and LANs
Module 3 Medium Access Control.
Computer Communication Networks
Channel Allocation (MAC)
Services of DLL Framing Link access Reliable delivery
Multiple access.
THE IEEE MAC SUB-LAYER – chapter 14
Overview Jaringan Komputer (3)
Channel Allocation Problem/Multiple Access Protocols Group 3
Link Layer and LANs Not everyone is meant to make a difference. But for me, the choice to lead an ordinary life is no longer an option 5: DataLink Layer.
Link Layer 5.1 Introduction and services
Link Layer: Multiple Access
Dr. John P. Abraham Professor UTPA
Multiple Access Control (MAC) Protocols
Presentation transcript:

Advanced Computer Networks C13 LANs Local Area Networks focused on the Media Access Control (MAC) Sub Layer Advanced Computer Networks C13

Advanced Computer Networks LANs LANs Outline Channel Allocation Problem Relative Propagation Time LAN Utilization Upper Bound Multiple Access Protocols TDMA, FDMA Aloha, Slotted Aloha CSMA (non-persistent, 1-persistent, p-persistent), CSMA/CD Performance Results Advanced Computer Networks LANs

Advanced Computer Networks LANs Local Area Networks Aloha Slotted Aloha CSMA non-persistent 1-persistent p-persistent CSMA/CD Ethernet Token Ring Advanced Computer Networks LANs

Data Link Sub Layers IEEE 802 OSI Network Layer Network Layer 802.2 Logical Link Control LLC Data Link Layer 802.11 Wireless LAN 802.3 CSMA-CD 802.5 Token Ring Other LANs MAC Physical Layer Physical Layer Various Physical Layers Leon-Garcia & Widjaja: Communication Networks IEEE 802 OSI Advanced Computer Networks LANs

Media Access Control (MAC) Can divide networks into two categories: Point-to-Point Using broadcast channels* *deal here with broadcast channels and their protocols MAC sub-layer is important in LANs, MANs and wireless networks (both WiFi and cellular)!! Advanced Computer Networks LANs

Channel Access Abstraction 3 2 4 1 Shared Multiple Access Medium n 5  Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

Static Channel Allocation Problem The history of broadcast networks includes satellite and packet radio networks. Let us view a satellite as a repeater amplifying and rebroadcasting everything that comes in. To generalize this problem, consider networks where every frame sent is automatically received by every site (node). Advanced Computer Networks LANs

Satellite Channel = fin = fout Advanced Computer Networks LANs Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

Static Channel Allocation Problem We model this situation as n independent users (one per node), each wanting to communicate with another user and they have no other form of communication. The Channel Allocation Problem To manage a single broadcast channel which must be shared efficiently and fairly among n uncoordinated users. Advanced Computer Networks LANs

Specific LAN Topologies Ring networks Multitapped Bus Networks Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

Possible Model Assumptions 0. Listen property :: (applies to satellites) The sender is able to listen to sent frame one round-trip after sending it.  no need for explicit ACKs. 1. The model consists of n independent stations. 2. A single channel is available for communications. Advanced Computer Networks LANs

Possible Model Assumptions 3. Collision Assumption :: If two frames are transmitted simultaneously, they overlap in time and the resulting signal is garbled. This event is a collision. 4a. Continuous Time Assumption :: frame transmissions can begin at any time instant. 4b. Slotted Time Assumption :: time is divided into discrete intervals (slots). Frame transmissions always begin at the start of a time slot. Advanced Computer Networks LANs

Possible Model Assumptions 5a. Carrier Sense Assumption (CS) :: Stations can tell if the channel is busy (in use) before trying to use it. If the channel is busy, no station will attempt to use the channel until it is idle. 5b. No Carrier Sense Assumption :: Stations are unable to sense channel before attempting to send a frame. They just go ahead and transmit a frame. Advanced Computer Networks LANs

a :: Relative Propagation Time   length of the data path (in bits) a = -------------------------------------------------- length of a standard frame (in bits) -OR- propagation time ( in seconds) a = ------------------------------------------------ transmission time (in seconds) bandwidth-delay product* a = ----------------------------------------- [ LG&W def p.346] average frame size  * bandwidth-delay product :: the product of the capacity (bit rate) and the delay. Advanced Computer Networks LANs

Effect of a on Utilization DCC 8th Ed. Stallings Advanced Computer Networks LANs

Relative Propagation Time R = capacity (data rate) d = maximum distance of communications path v = propagation velocity (Assume v = 2/3 speed of light 2 x 108 meters/second) L = frame length d / v Rd a = ------- = ------ L/R vL Advanced Computer Networks LANs

Upper Bound on Utilization for Shared Media LAN Assume a perfect, efficient access that allows one transmission at a time where there are no collisions, no retransmissions, no delays between transmissions and no bits wasted on overhead. {These are best-case assumptions!!} Tput L Util = ------- = ---------------------------------- Capacity propagation time + transmission time ------------------------------ R Advanced Computer Networks LANs

Best Case LAN Utilization ------------------ d L L 1 max. Util = ---- + ---- = --------------- = ------------ v R Rd a + 1   --------------- ---- + L R v   1 max. Util = --------- 1 + a Advanced Computer Networks LANs

Worst Case Collision Scenario Distance d meters A transmits at t = 0 A B B transmits before t = tprop and detects collision shortly thereafter A B A detects collision at t = 2 tprop A B tprop = d /  seconds Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

LAN Design Performance Issues For broadcast LANs what factors under the designer’s control affect LAN performance? Capacity {function of media} Propagation delay {function of media, distance} Bits /frame (frame size) MAC protocol Offered load {depends on retransmission scheme} Number of stations Bit error rate {function of media} Advanced Computer Networks LANs

Typical Frame Delay versus Throughput Performance E[T]/E[X] M/M/1 queueing result Transfer Delay 1 r rmax 1 Offered Load Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

Delay-Throughput Performance Dependence on a E[T]/E[X] a > a a a Transfer Delay 1 r rmax rmax 1 Offered Load Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

Multiple Access Protocols Advanced Computer Networks LANs

Multiple Access Links and Protocols Two types of “links”: point-to-point PPP for dial-up access point-to-point link between Ethernet switch and host broadcast (shared wire or medium) old-fashioned Ethernet upstream HFC 802.11 wireless LAN K & R humans at a cocktail party (shared air, acoustical) shared wire (e.g., cabled Ethernet) shared RF (e.g., 802.11 WiFi) shared RF (satellite) Advanced Computer Networks LANs

Multiple Access Protocols single shared broadcast channel two or more simultaneous transmissions by nodes  interference, namely a collision if any node receives two or more signals at the same time. Multiple Access Protocol (MA) distributed algorithm that determines how nodes share channel, i.e., determine when a node can transmit. communication about channel sharing must use channel itself! Assumes no out-of-band channel for coordination. Advanced Computer Networks LANs

MAC Protocols Taxonomy Three broad classes: Channel Partitioning divide channel into smaller “pieces” (time slots, frequency, code). allocate piece to node for exclusive use. Random Access channel not divided, allow collisions. “recover” from collisions. “Taking Turns” nodes take turns, but nodes with more to send can take longer turns. K & R Advanced Computer Networks LANs

Channel Partitioning MAC Protocols: TDMA TDMA: Time Division Multiple Access access to channel in "rounds“. each station gets fixed length slot (length = pkt transmission time) in each round. unused slots go idle. example: 6-station LAN, 1,3,4 have pkt, slots 2,5,6 wasted (idle). 6-slot frame 1 3 4 1 3 4 K & R Advanced Computer Networks LANs

Channel Partitioning MAC Protocols: FDMA FDMA: Frequency Division Multiple Access channel spectrum divided into frequency bands. each station assigned fixed frequency band. unused transmission time in frequency bands go idle. example: 6-station LAN, 1,3,4 have pkt, frequency bands 2,5,6 idle. time frequency bands FDM cable K & R Advanced Computer Networks LANs

Random Access Protocols When node has packet to send transmit at full channel data rate R. no a priori coordination among nodes. two or more transmitting nodes ➜ “collision”, random access MAC protocol specifies: how to detect collisions? how to recover from collisions (e.g., via delayed retransmissions)? Examples of random access MAC protocols: ALOHA slotted ALOHA CSMA, CSMA/CD, CSMA/CA K & R Advanced Computer Networks LANs

Historic LAN Performance Notation I :: input load - the total (normalized) rate of data generated by all n stations. G :: offered load - the total (normalized) data rate presented to the network including retransmissions. S :: LAN throughput - the total (normalized) data rate transferred between stations. D :: average frame delay - the time from when a frame is ready for transmission until completion of a successful transmission. Advanced Computer Networks LANs

Normalizing Throughput (S) [assuming one packet = one frame] S is normalized using packets/packet time where packet time :: the time to transmit a standard fixed-length packet. i.e., packet length packet time = ----------------- bit rate NOTE: Since the channel capacity is one packet /packet time, S* can be viewed as throughput as a fraction of capacity. *Represented in LG&W by in later graphs. r Advanced Computer Networks LANs

Historic LAN Performance Notation Advanced Computer Networks LANs retransmissions 1 2 I G S X X X 3 D n Advanced Computer Networks LANs

ALOHA Abramson solved the channel allocation problem for ground radio at University of Hawaii in 1970’s. Aloha Transmission Strategy Stations transmit whenever they have data to send. Collisions will occur and colliding frames are destroyed. Aloha Retransmission Strategy Station waits a random amount of time before sending again. Advanced Computer Networks LANs

ALOHA Figure 4-2. Vulnerable period for the shaded frame. Tanenbaum Advanced Computer Networks LANs

ALOHA Retransmissions First transmission Retransmission t t0-X t0 t0+X t0+X+2tprop t0+X+2tprop Vulnerable period Time-out Backoff Period B Retransmission if necessary random backoff period B Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

Advanced Computer Networks LANs ALOHA Vulnerable period :: t0 – X to t0 + X two frame transmission times Assume: Poisson Arrivals with average number of arrivals of 2G arrivals/ 2 X S = G e-2 (1+a) G Advanced Computer Networks LANs

Slotted ALOHA (Roberts 1972) uses discrete time intervals as slots (i.e., slot = one packet transmission time) and synchronize the send time (e.g., use “pip” from a satellite). Slotted Aloha Strategy Station transmits ONLY at the beginning of a time slot. Collisions will occur and colliding frames are destroyed. Slotted Aloha Retransmission Strategy Station waits a random amount of time before sending again. Advanced Computer Networks LANs

Slotted ALOHA t (k+1)X kX t0 +X+2tprop t0 +X+2tprop+B Time-out Backoff Period B Vulnerable period Retransmission if necessary random backoff period B slots Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

Advanced Computer Networks LANs Slotted ALOHA Vulnerable period :: t0 – X to t0 one frame transmission time Assume: Poisson Arrivals with average number of arrivals of G arrivals/ X P0 = P[k=0, t=1] = e –G S = G P0 S = G e –G and an adjustment for a yields: S = G e- (1+a) G Advanced Computer Networks LANs

ALOHA and Slotted AlOHA Throughput versus Load 0.368 Ge-G Slotted Aloha S 0.184 Aloha Ge-2G G Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

Carrier Sense with Multiple Access (CSMA) Advanced Computer Networks LANs

1-persistent CSMA Transmission Strategy ‘the greedy algorithm’ Sense the channel. IF the channel is idle, THEN transmit. IF the channel is busy, THEN continue to listen until channel is idle and transmit immediately. Advanced Computer Networks LANs

nonpersistent CSMA Transmission Strategy ‘’the less-greedy algorithm’ Sense the channel. IF the channel is idle, THEN transmit. IF the channel is busy, THEN wait a random amount of time and repeat the algorithm. Advanced Computer Networks LANs

p - persistent CSMA Transmission Strategy ’a slotted approximation’ Sense the channel. IF the channel is idle, THEN with probability p transmit and with probability (1-p) delay one time slot and repeat the algorithm. 3. IF the channel is busy, THEN delay one time slot and repeat the algorithm.   Advanced Computer Networks LANs

P – Persistent CSMA details the time slot is usually set to the maximum propagation delay. as p decreases, stations wait longer to transmit but the number of collisions decreases. Consideration for the choice of p (n x p) must be < 1 for stability, where n is maximum number of stations, i.e., p < 1/n Advanced Computer Networks LANs

Advanced Computer Networks LANs CSMA Collisions In all three strategies, a collision is possible. CSMA determines collisions by the lack of an ACK which results in a TIMEOUT. {This is extremely expensive with respect to performance!!} If a collision occurs, THEN wait a random amount of time and retransmit.   Advanced Computer Networks LANs

CSMA Persistence Summary Advanced Computer Networks LANs

Advanced Computer Networks LANs CSMA Collisions spatial layout of nodes Collisions can still occur: propagation delay means two nodes may not hear each other’s transmission. Collision: entire packet transmission time wasted. Note: The role of distance & propagation delay in determining collision probability K & R Advanced Computer Networks LANs

Persistent and Non-persistent CSMA Figure 4-4. Comparison of the channel utilization versus load for various random access protocols. Tanenbaum Advanced Computer Networks LANs

Throughput versus Load with varying a 0.53 S 0.45 1-Persistent CSMA a = 0.01 0.16 a = 0.1 a = 1 G Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

Throughput versus Load with varying a 0.81 a = 0.01 0.51 Non-Persistent CSMA 0.14 a = 0.1 G a = 1 Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

CSMA/CD (Collision Detection) collisions detected within short time. colliding transmissions aborted, reducing channel wastage. Collision Detection: easy in wired LANs: measure signal strengths, compare transmitted, received signals difficult in wireless LANs: received signal strength overwhelmed by local transmission strength. Advanced Computer Networks LANs

CSMA/Collision Detection K & R Advanced Computer Networks LANs

CSMA/CD CSMA with Collision Detection If a collision is detected during transmission, then immediately cease transmitting the frame. The first station to detect a collision sends a jam signal to all stations to indicate that there has been a collision. After receiving a jam signal, a station that was attempting to transmit waits a random amount of time before attempting to retransmit. The maximum time needed to detect a collision is 2 x propagation delay. Advanced Computer Networks LANs

Advanced Computer Networks LANs CSMA vs CSMA/CD CSMA is essentially a historic technology until we include Wireless LANs. If propagation time is short compared to transmission time, station can be listening before sending with CSMA. Collision detection (CD) is accomplished by detecting voltage levels outside acceptable range. Thus attenuation limits distance without a repeater. If the collision time is short compared to packet time (i.e., small a), performance will increase due to CD. Advanced Computer Networks LANs

Advanced Computer Networks LANs CSMA/CD frame contention Probability of 1 successful transmission: Pmax Psuccess is maximized at p =1/n : n Tanenbaum Advanced Computer Networks LANs

Maximum Achievable Throughputs CSMA/CD 1-P CSMA Non-P CSMA max Slotted Aloha Aloha a Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

Frame Delay with varying a Leon-Garcia & Widjaja: Communication Networks Advanced Computer Networks LANs

“Taking Turns” MAC protocols Channel Partitioning MAC protocols: share channel efficiently and fairly at high load. inefficient at low load: delay in channel access, 1/N bandwidth allocated even if only 1 active node! Random Access MAC protocols: efficient at low load: single node can fully utilize channel. high load: collision overhead “Taking Turns” protocols: look for best of both worlds! K & R Advanced Computer Networks LANs

“Taking Turns” MAC protocols Polling: master node “invites” slave nodes to transmit in turn typically used with “dumb” slave devices concerns: polling overhead latency single point of failure (master) data poll master data slaves K & R Advanced Computer Networks LANs

“Taking Turns” MAC protocols Token passing: control token passed from one node to next sequentially. token message concerns: token overhead latency single point of failure (token) T (nothing to send) T data K & R Advanced Computer Networks LANs

Advanced Computer Networks LANs LANS Summary Channel Allocation Problem Relative Propagation Time LAN Utilization Upper Bound Multiple Access Protocols TDMA, FDMA Aloha, Slotted Aloha CSMA (non-persistent, 1-persistent, p-persistent), CSMA/CD Token Passing Performance Results Advanced Computer Networks LANs