Medium Access Control.

Slides:



Advertisements
Similar presentations
The Medium Access Control 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.
12.1 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Ethernet. Review Media Access Control – Broadcast media shared by all stations – MAC is used to determine who gets the right to send Developed protocol.
12.1 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 17 Introduction to Computer Networks.
The Data Link Layer Read Chapters 3 and 4. CSC 3352 Computer Communications Chapter 3&42 Where in the OSI Reference Model ? Session Transport Network.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
CSC 450/550 Part 3: The Medium Access Control Sublayer.
The Medium Access Control Sublayer Chapter 4. Ethernet Cabling The most common kinds of Ethernet cabling.
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
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 18 Introduction to Computer Networks.
16 February 2003 TU/e Computer Science, System Architecture and Networking 1 Communication media Thanks to A. Tanenbaum.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Medium Access Control Sublayer Chapter.
1 Chapter 5 The Medium Access Sublayer. 2 Chapter 5 The Medium Access Layer 5.1 The Channel Allocation problem - Static and dynamic channel allocation.
Medium Access Control Sublayer
Infrastructure de Communications – CR 4107Chapter 41 The Medium Access Control Sublayer Chapter 4.
1 ECE453 – Introduction to Computer Networks Lecture 7 – Multiple Access Control (I)
Computer Networks 1 (Mạng Máy Tính 1)
Multiple Access Protocols Chapter 6 of Hiroshi Harada Book
Ethernet. Ethernet Goals Simplicity Low Cost Compatibility Address flexibility Fairness –All nodes have equal access to the network High speed Stability.
A.S.Tanenbaum, Computer networks, ch4 MAC 1 The Medium Access Control Sublayer Medium Access Control: a means of controlling access to the medium to promote.
Medium Access Control. Channel Allocation Static channel allocation in LANs and MANs FDMA, TDMA, CDMA Dynamic channel allocation in LANs and MANs MAC.
: Data Communication and Computer Networks
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.
Computer Networks NYUS FCSIT Spring 2008 Igor TRAJKOVSKI, Ph.D. Associate Professor
CSMA with Collision Detection CSMA/CD can be in one of three states: contention, transmission, or idle.
The Medium Access Control Sublayer Chapter 4. The Channel Allocation Problem Static Channel Allocation in LANs and MANs Dynamic Channel Allocation in.
CSC4220/6220 Computer Networks
The Medium Access Control Sublayer طبقة ولوج الوسط الجزئية Chapter 4.
The Medium Access Control Sublayer Chapter 4 10/1/2015www.noteshit.com1.
CHAPTER 4: THE MEDIUM ACCESS SUBLAYER 4.1: The Channel Allocation Problem 4.2: Multiple Access Protocols.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
Medium Access Control NWEN302 Computer Network Design.
LAN technologies and network topology LANs and shared media Locality of reference Star, bus and ring topologies Medium access control protocols.
The Medium Access Control Sublayer Chapter 4. The Channel Allocation Problem Static Channel Allocation Dynamic Channel Allocation  Delay for the divided.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Medium Access Control Sublayer Chapter.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.
The Medium Access Control Sublayer Chapter 4. The Channel Allocation Problem Static Channel Allocation in LANs and MANs Dynamic Channel Allocation in.
The Medium Access Control Sublayer Chapter 4. The Channel Allocation Problem Static Channel Allocation in LANs and MANs Dynamic Channel Allocation in.
CEN 4500 Data Communications Instructor: S. Masoud Sadjadi sadjadi At cs Dot fiu Dot edu Chapter 4: The Medium.
10/11/2007 EETS The Medium Access Control Sublayer Chapter 4.
جلسه یازدهم شبکه های کامپیوتری به نــــــــــــام خدا.
17 - Winter 2005 ECE ECE 766 Computer Interfacing and Protocols 1 Local Area Networks Need for high performance communications for physically close devices.
C H 4 T HE M EDIUM A CCESS C ONTROL S UBLAYER 1 Medium Access Control: a means of controlling access to the medium to promote orderly and efficient use.
Medium Access Control Sub Layer
7-1 Introduction to Queueing Theory l Components of a queueing system n probability density function (pdf) of interarrival times n pdf of service times.
Data Communications, Kwangwoon University12-1 Chapter 12. Multiple Access 1.Random Access 2.Controlled Access 3.Channelization.
1 Kyung Hee University Chapter 12 Multiple Access.
Chapter 6 Multiple Radio Access
C H 4 T HE M EDIUM A CCESS C ONTROL S UBLAYER 1 Medium Access Control: a means of controlling access to the medium to promote orderly and efficient use.
The Medium Access Control Sublayer Chapter 4 12/13/2015www.ishuchita.com1.
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.
Ch 12. Multiple Access. Multiple Access for Shared Link Dedicated link – Point-to-point connection is sufficient Shared link – Link is not dedicated –
LECTURE9 NET301 11/5/2015Lect 9 NET DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies.
The Medium Access Control Sublayer Chapter 4. The Channel Allocation Problem Static Channel Allocation in LANs and MANs Dynamic Channel Allocation in.
1 Ethernet History –developed by Xerox PARC in mid-1970s –roots in Aloha packet-radio network –standardized by Xerox, DEC, and Intel in 1978 –similar to.
The Medium Access Control Sublayer
The Medium Access Control (MAC) Sublayer. The Channel Allocation Problem Static Channel Allocation in LANs and MANs Dynamic Channel Allocation in LANs.
THE MEDIUM ACCESS CONTROL SUBLAYER 4.1 THE CHANNEL ALLOCATION PROBLEM 4.2 MULTIPLE ACCESS PROTOCOLS.
UNIT 3 MULTIPLE ACCESS Adapted from lecture slides by Behrouz A. Forouzan © The McGraw-Hill Companies, Inc. All rights reserved.
The Data Link Layer Chapter
Chapter 12 Multiple Access.
The Medium Access Control Sublayer
The Medium Access Control Sublayer
The Medium Access Control (MAC) Sublayer
Computer Interfacing and Protocols
Chapter 6 Multiple Radio Access.
Presentation transcript:

Medium Access Control

Channel Allocation Static channel allocation in LANs and MANs FDMA, TDMA, CDMA Dynamic channel allocation in LANs and MANs MAC protocols: with collisions, polling, token

Static Channel Allocation Delay for one fast channel: Delay for multiple FDM slower channels:

Poisson Process Probability of k arrivals in time t: Probability that packet duration exceeds t: Note that λ is the average packet arrival rate, and 1/μ is the average packet duration.

M/M/1 Queue Queue equations, pj(t) is the probability that the number of packets at time t in a queue is j The solution of the previous recursion for stationary probabilities to which pj(t) converge

Delay Little’s formula for average delay E[D] E[Q] is the average number of packets in a queue Delay is:

Static Channel Allocation Delay for one fast channel: where C is the channel bit-rate and E[L] is the average packet length. Delay for multiple FDM N times slower channels:

Multiple Access Protocols ALOHA Carrier Sense Multiple Access (CSMA) protocols CSMA/CD CSMA/CA Collision-Free protocols Reservation based Token based

Vulnerable period for the shaded frame. Pure ALOHA Vulnerable period for the shaded frame.

ALOHA Throughput Throughput is S=GPs, where Ps is the probability of successful transmission. The k frames per f frame slots is Ps=e-fG For pure ALOHA f=2, for slotted ALOHA f=1, so:

Throughput versus offered traffic for ALOHA systems. Pure and Slotted ALOHA Throughput versus offered traffic for ALOHA systems.

Carrier Sense Multiple Access 1-Persistant CSMA Nonpersistant CSMA P-Persistant CSMA

CSMA with Collision Detection CSMA/CD can be in one of three states: contention, transmission, or idle.

Wireless LAN: CSMA-CA The MACA protocol. (a) A sending an RTS to B. (b) B responding with a CTS to A.

DOCSIS (Data Over Cable Service Interface Specification)

Collision-Free Protocols:Reservations The basic bit-map protocol.

Collision-Free Protocols: Bidding The binary countdown protocol. A dash indicates silence.

Collision Free Protocols: Fiber Distributed Data Interface (FDDI) Station transmits only when it has a token Timers count the time while the token is away Two timers determine how much data a station may transmit, so that the token delay is limited

Ethernet Ethernet, IEEE 802.3 10Base (10Mbps) Fast Ethernet (100Mbps) Gigabit Ethernet

Ethernet MAC Sublayer Protocol Frame formats. (a) DIX Ethernet, (b) IEEE 802.3. Preamble-synchronization, Type-upper layer protocol, Pad-to make the minimum packet size 64B

CSMA with Collision Detection CSMA/CD can be in one of three states: contention, transmission, or idle.

Back-Off Mechanism After a collision, user accesses medium with probability 1/W where W is the window size. With each collision W doubles.

Ethernet Performance

Throughput of CSMA/CD (Ethernet) Assume that requests form a Poisson process with rate g, T is time slot duration, and Tp is a packet duration. The throughput equals S=Tp/(Tp+I), where I is the average time between packet transmissions. The probability of a packet transmission is equal to the probability that there is only one request in some previous time slot which is Ps=gTe-gT. The average time between transmissions is

Throughput of CSMA/CD The throughput is It tends to 0 when g increases . Protocol is unstable like ALOHA. g S l 1 2

Throughput of CSMA/CD The throughput is If p is the packet generation probability and k is the number of active users Ps=kp(1-p)k-1 The maximum throughput is achieved for p=1/k and it is tends to e when k tends to infinity

Efficiency of Ethernet at 10 Mbps with 512-bit slot times. Ethernet Performance Efficiency of Ethernet at 10 Mbps with 512-bit slot times.

The most common kinds of Ethernet cabling. 10Mbps Ethernet Cabling The most common kinds of Ethernet cabling.

10Mbps Ethernet Cabling Three kinds of Ethernet cabling. (a) 10Base5, (b) 10Base2, (c) 10Base-T.

Cable topologies. (a) Linear, (b) Spine, (c) Tree, (d) Segmented. Ethernet Cabling Cable topologies. (a) Linear, (b) Spine, (c) Tree, (d) Segmented.

10Mb Ethernet Coding (a) Binary encoding, (b) Manchester encoding, (c) Differential Manchester encoding.

10 Mb Ethernet Collision Detection 10Base5 cabling, Kadambi, Crayford and Kalkunte, Gigabit Ethernet, Prentice Hall, 1998

10 Mb Ethernet Collision Detection 10Base2 and 10BaseT cabling, Kadambi, Crayford and Kalkunte, Gigabit Ethernet, Prentice Hall, 1998

The original fast Ethernet cabling.

Fast Ethernet Auto negotiation enables communication with 10Mb Ethernet Manchester code → 4B/5B code Full duplex mode is optional with using PAUSE command

A simple example of switched Ethernet.

Gigabit Ethernet (a) A two-station Ethernet. (b) A multistation Ethernet.

Gigabit Ethernet cabling.

Gigabit Ethernet Prioritization of fiber over copper 4B/5B coding → 8B/10B coding Full duplex mode is preferred with PAUSE message Carrier extension, and frame bursting introduced in half-duplex mode

IEEE 802.2: Logical Link Control (a) Position of LLC. (b) Protocol formats.

A Sample HFC System HOME Secondary Hub RF Spectrum on coax: Downstream: 500 MHz shared by ~50,000 (broadcast) 200 MHz by 1200 (narrowcast) Upstream: ~37 MHz shared by 300 HOME o o o o o o o o lup lb ln (4ln/fiber) Secondary Hub Fiber Node o o o o o o o o o o RF Spectrum on coax: return Capacity of the coax is “wasted.” No architecture really looks exactly like this, but it is a well-defined starting point. I could have used Lightwire as my starting point (in fact I originally did use Lightwire as my starting point) but systems like this are currently more common. ********OLD NOTES FROM HFC BASICS SLIDE*************** 1. Drop is a coax bus, therefore all downstream traffic is broadcast, and terminal equipment in home selects the desired content. 2. Because it is coax, RF transmission is used. 3. Coax has a limited bandwidth, but is capable of maintaining a high SNR. 4. Fiber has virtually unlimited bandwidth, but it is difficult to maintain a high SNR (high SNR requires high power, which runs into non-linearities) This point is best illustrated by the fact that over longer distances the fiber carrying the analog AM-VSB signals doesn’t carry any other wavelengths. 5. The RF demarcation between analog broadcast signals and narrowcast signals is flexible. The traditional method to increase capacity is to reduce the node size (analogous to cell size). Upstream frequently split into 4 parts. RF band is 5-42 MHz, this band can carry multiple RF channels. Channel width downstream 6MHz, channel spacing upstream is 2MHz. 5-15 MHz is plagued with ingress noise. All frequencies suffer from the funnel effect. Bandwidth is shared. Coax drop downstream has 5Gbps capacity. Services can be segregated by RF frequency. For data the standard is DOCSIS (Data Over Cable Service Interface Specification). Up to 10 Mbps transmission per RF channel is provided in the standard, but a peak rate of ~3 Mbps is more realistic. A cable modem or set top box resides in the home, a CMTS, which coordinates traffic, resides in the headend. 80 broadcast channels 30 QAM channels (~150 video channels) narrowcast broadcast 5-42 MHz 550 MHz 750 MHz Sheryl Woodward, AT&T Labs-Research

Justification for Using Shared Medium Equivalent circuit rate (ECR) on a cable with many users is the rate of a dedicated link that would provide the same e.g. average delay (similar results is obtained for 90th percentile page delay). By Shankar, Jiang and Mishra: where tON is the transmission tim, and tOFF is the think time, r is the channel rate, tON/(tON+tOFF)<<1, on periods have an exponential distribution.

Justification for Using Shared Medium Let’s calculate how many users can be allocated one DOCSIS channel of 32Mbps to get the same experience as DSL user with dedicated rate of 2Mbps. According to traffic statistics page size is 68KB on average, and tOFF is 14.5s on average, which is much more than 32/2=16 users. Price: high user speed.

DOCSIS MAC Protocol Traffic that is transmitted downstream to the users is controlled by CMTS (cable modem termination system) in headend. It polices and shapes the traffic, and perform algorithms such are WFQ and RED. Users requests are resolved at headend, and they are informed about the resolution through the downstream channel. If there is a collision of requests, users repeat their requests according to exponential back-off mechanism, otherwise they send data in specified time slot(s).

QoS in DOCSIS Service QoS parameters Access Mode Applications UGS Unsolicited grant size, interval, jitter Isonchronous Videoconferencing, VoD, VoIP UGS-AD Unsolicited grant size, interval, jitter;polling interval, jitter Isonchronous, periodic request polling VoIP with silence supression rtPS Polling interval, jitter Periodic request polling, piggybacking reservation VoIP

QoS in DOCSIS Service QoS parameters Access Mode Applications nrtPS Polling interval, min reserved rate, max sustained rate, priority Periodic request polling, piggybacking reservation, immediate access Demanding FTP BE min reserved rate, max sustained rate, priority Normal, piggybacking reservation, immediate access Telnet, FTP, WWW CIR Unspecified

Performance for BE service in DOCSIS Assume that requests form a Poisson process with rate g, T is time slot duration, and Tp is a packet duration. The throughput equals S=Tp/(Tp+I), where I is the average time between packet transmissions. The probability of a packet transmission is equal to the probability that there is only one request in some previous time slot which is gTe-gT. The average time between transmissions is

Performance for BE service in DOCSIS The throughput is It tends to 0 when g increases . Protocol is unstable like ALOHA. g S l 1 2

Wireless LANs Distributed coordination function (DCF) Point coordination function (PCF)

Part of the 802.11 protocol stack.

The 802.11 MAC Sublayer Protocol (a) The hidden station problem. (b) The exposed station problem.

Wireless LAN: CSMA-CA The MACA protocol. (a) A sending an RTS to B. (b) B responding with a CTS to A.

The 802.11 MAC Sublayer Protocol The use of virtual channel sensing using CSMA/CA.

The 802.11 MAC Sublayer Protocol A fragment burst.

The 802.11 MAC Sublayer Protocol Interframe spacing in 802.11.

The 802.11 Frame Structure The 802.11 data frame. Address 3 and 4-for source and dest base stations, Seq-fragment sequence number, Type-data or control, Subtype-RTS or CTS, MF-more fragments, More-more frames, W-WEP, O-frame sequence maintained

802.11 Services Association Disassociation Reassociation Distribution Authentication Integration Privacy