Medium Access Control (MAC) Sub-layer - PowerPoint PPT Presentation

About This Presentation
Title:

Medium Access Control (MAC) Sub-layer

Description:

Frames flow in one direction: upstream to downstream ... MACAW (Medium Access Control Avoidance) Sender transmits RequestToSend (RTS) frame ... – PowerPoint PPT presentation

Number of Views:299
Avg rating:3.0/5.0
Slides: 17
Provided by: klp15
Learn more at: http://www.cs.uky.edu
Category:
Tags: mac | access | control | layer | macaw | medium | sub

less

Transcript and Presenter's Notes

Title: Medium Access Control (MAC) Sub-layer


1
Medium Access Control (MAC) Sub-layer
  • Outline
  • Bus (Ethernet, IEEE 802.3)
  • Token ring (IEEE 802.5, FDDI)
  • Wireless (IEEE 802.11)

2
Token Ring Overview
  • Examples
  • 16Mbps IEEE 802.5 (based on earlier IBM ring)
  • 100Mbps Fiber Distributed Data Interface (FDDI)

Shared Media Access control All nodes see
all frames
3
Token Ring (cont)
  • Idea
  • Frames flow in one direction upstream to
    downstream
  • special bit pattern (token) rotates around ring
  • must capture token before transmitting
  • release token after done transmitting
  • immediate release
  • delayed release
  • remove your frame when it comes back around
  • Other nodes simply forward the frame
  • Destination node makes a copy and forward the
    frame
  • stations get round-robin service

4
Token Ring (cont)
  • Frame Format
  • Reliability
  • A bit (initial 0, set to 1 by receiver)
  • C bit (initial 0, set to 1 by receiver if
    successfully copied)

5
Timed Token Algorithm
  • Token Holding Time (THT)
  • upper limit on how long a station can hold the
    token
  • The impact of THT on performance (10 ms in 802.5)
  • Token Rotation Time (TRT)
  • how long it takes the token to traverse the ring.
  • TRT lt ActiveNodes x THT RingLatency
  • Target Token Rotation Time (TTRT) in FDDI
  • agreed-upon upper bound on TRT

6
Algorithm (cont)
  • Each node measures TRT between successive tokens
  • if measured-TRT gt TTRT token is late so dont
    send
  • if measured-TRT lt TTRT token is early so OK to
    send
  • Two classes of traffic
  • synchronous can always send
  • asynchronous can send only if token is early
  • Worst case 2xTTRT between seeing token

7
Token Maintenance
  • Lost Token
  • no token when initializing ring
  • bit error corrupts token pattern
  • node holding token crashes
  • Generating a Token (and agreeing on TTRT)
  • execute when join ring or suspect a failure
  • send a claim frame that includes the nodes TTRT
    bid
  • when receive claim frame, update the bid and
    forward
  • if your claim frame makes it all the way around
    the ring
  • your bid was the lowest
  • everyone knows TTRT
  • you insert new token

8
Maintenance (cont)
  • Monitoring for a Valid Token
  • should periodically see valid transmission (frame
    or token)
  • maximum gap ring latency max frame lt 2.5ms
  • set timer at 2.5ms and send claim frame if it
    fires
  • Monitoring orphaned frames
  • monitor bit is set to 0 initially
  • set to 1when the monitor sees it
  • discard frames with monitor bit 1

9
FDDI (Fiber Distributed Data Interface)
  • Physical Properties
  • Fiber
  • Dual ring in opposite directions
    (fault-tolerance)
  • Target Token Rotation Time (TTRT)
  • Synchronous and asynchronous traffic

10
Wireless LANs
  • IEEE 802.11
  • Bandwidth 1 or 2 Mbps
  • Physical Media
  • spread spectrum radio (2.4GHz)
  • diffused infrared (10m)
  • The sender and receiver do not have to be aimed
    at each other and do not need a clear line of
    sight

11
Spread Spectrum
  • Idea
  • spread signal over wider frequency band than
    required
  • originally deigned to thwart jamming
  • Frequency Hopping
  • transmit over random sequence of frequencies
  • sender and receiver share
  • pseudorandom number generator
  • seed
  • 802.11 uses 79 x 1MHz-wide frequency bands

12
Spread Spectrum (cont)
  • Direct Sequence
  • for each bit, send XOR of that bit and n random
    bits
  • random sequence known to both sender and receiver
  • called n-bit chipping code
  • 802.11 defines an 11-bit chipping code

13
Collisions Avoidance
  • Similar to Ethernet (not quite)
  • Problem hidden and exposed nodes

A and C both send to B
A to B, D to C ?
B sends to A, Can C Send to D ?
14
MACAW (Medium Access Control Avoidance)
  • Sender transmits RequestToSend (RTS) frame
  • Receiver replies with ClearToSend (CTS) frame
  • Neighbors
  • see CTS keep quiet
  • see RTS but not CTS ok to transmit
  • Receiver sends ACK when has frame
  • neighbors silent until see ACK
  • Collisions
  • no collisions detection
  • known when dont receive CTS
  • exponential backoff

15
Supporting Mobility
  • Case 1 ad hoc networking
  • Case 2 access points (AP)
  • connected by wire
  • each mobile node associates with an AP

16
Mobility (cont)
  • Scanning (selecting an AP)
  • node sends Probe frame
  • all APs w/in reach reply with ProbeResponse
    frame
  • node selects one AP sends it AssociationRequest
    frame
  • AP replies with AssociationResponse frame
  • new AP informs old AP via tethered network
  • When
  • active when join or move
  • passive AP periodically sends Beacon frame
Write a Comment
User Comments (0)
About PowerShow.com