Chapter 2 More on Wireless Ethernet, Token Ring, FDDI

Professor Rick Han University of Colorado at Boulder rhan@cs.colorado.edu

Announcements
Previous lecture now online Homework #1 is on the Web site, due Feb. 5 Programming assignment #1 is now available on Web site, due Feb. 19 (3 weeks) Next, Chapter 2, more on Wireless Ethernet, Token Ring, FDDI

Prof. Rick Han, University of Colorado at Boulder

Recap of Previous Lecture

Multiple Access Protocols
Designed for shared-media links Channel reservation protocols: TDMA, FDMA, CDMA Random access protocols: CSMA/CD (Ethernet), CSMA/CA (802.11 wireless Ethernet) ALOHA, slotted ALOHA packet collisions CSMA listen before you talk CSMA/CD listen while you talk CSMA/CA see next slide
Prof. Rick Han, University of Colorado at Boulder

Random Access Protocols

 Uses CSMA/CA = CSMA + Collision Avoidance

802.11 MAC Layer

802.11s CSMA/CA is called the Distributed Coordination Function (DCF)

Useful to send non-delay-sensitive data such as Web, ftp, email <- asynchronous traffic 802.11bs MAC is ~70% efficient slotted ALOHA ~37% Ethernets efficiency: ~ 1/(1+5Tprop/Ttrans),
~ 70% for common values of prop. delay and max pkt size, ->100% for small prop. delays & small pkts
Prof. Rick Han, University of Colorado at Boulder

Collision Avoidance equated with exponential backoff Hidden terminal RTS/CTS is required feature but may be disabled

802.11 MAC Layer (2)

Contention in CSMA causes delay Point Coordination Function (PCF) Mode gives delay-sensitive traffic priority over asynchronous traffic

Useful for interactive audio/video Define a superframe. Delay-sensitive traffic gets access to first part of superframe via shorter random wait times. Inside the first part of superframe, a central PCF master polls each user with delay-sensitive data In second part of superframe, asynchronous data is carried Built on top of DCF
Prof. Rick Han, University of Colorado at Boulder

 What does 802.11 use for its physical layer?

Original 802.11 Standard 802.11b 802.11a

Physical Layers of 802.11 Variants

2.4 GHz Freq. Hop 1,2 Mbps

2.4 GHz Dir. Seq. 1,2 Mbps

Infrared 1,2 Mbps

2.4 GHz 5 GHz Dir. Seq. OFDM 5.5,11 Mbps 6-54 Mbps

Also, 802.11g at 2.4 GHz, OFDM or PBCC, up to 54 Mbps. 802.11a @ 5 GHz ok in U.S., but conflicts abroad
Prof. Rick Han, University of Colorado at Boulder

802.11b: Direct Sequence Spread Spectrum

Multiply data bit stream d(t) by a faster chipping sequence c(t) : BPSK example +1/-1

1 0 0
+1
Data d(t) -1

1 0
time

+1 Chipping time Sequence c(t) -1 Chipping sequence c(t) also called Pseudo-Noise (PN) spreading sequence depending on usage
Prof. Rick Han, University of Colorado at Boulder

110011101001110010

Direct Sequence Sender

1 0 0 1 1 0
+1 Data d(t) -1 +1 Chipping Sequence c(t) -1 +1 d(t)*c(t) -1
Prof. Rick Han, University of Colorado at Boulder

time

110011101001110010
time

time

Direct Sequence Receiver

Receive d(t)*c(t)

+1 time
-1 +1 -1

110011101001110010
time

Receiver also has c(t)

1 0 0 1 1 0
d(t)*c(t)*c(t) = Data d(t), since c(t)*c(t) = 1! -1 +1 time
Prof. Rick Han, University of Colorado at Boulder

Direct Sequence Spreads the Spectrum

Benefit of modulating data d(t) by chipping sequence: spreading the spectrum to improve immunity to noise and fading Spectrum of data d(t) frequency Spectrum of chipping sequence c(t) frequency

Spectrum of d(t)*c(t) frequency

Prof. Rick Han, University of Colorado at Boulder

CDMA Employs Direct Sequence

Each c(t) can be looked upon as a code that only the sender and receiver pair both know
Assign code c1(t) between a base station and user 1, c2(t) between base station and user 2, Base station sends d1(t)*c1(t) + d2(t)*c2(t)

Ideally, choose c1(t) to be orthogonal to c2(t), i.e. c1(t)*c2(t) =0 (reality: only ~orthogonal)

CDMA: multiple data streams simultaneously access the same medium using ~orthogonal DSSS codes
Prof. Rick Han, University of Colorado at Boulder

At receiver 1, received signal is multiplied by c1(t): c1(t)*[d1(t)*c1(t) + d2(t)*c2(t)] = d1(t)!

CDMA Employs Direct Sequence (2)

Original 802.11 at 1 Mbps

802.11b is more sophisticated:

used 11 chips/bit (Barker sequence), and BPSK (+1/1 signalling) for 11 Mcps, or 11 MHz
8 chips per symbol, and 8 bits/symbol, chipping rate is 11 MHz = 1.375 Msps = 11 Mbps Each channel occupies 22 Mhz. Within each channel, uses Direct Sequence CDMA

2.4 GHz ISM band has 14 channels (11 in U.S.)

Prof. Rick Han, University of Colorado at Boulder

802.11 Specifics (2)

2.4 GHz ISM band has 14 channels (11 in U.S.)
Interference from adjacent Access Points (AP) or base stations: Only 3 channels (1,6,11) are nonoverlapping reuse frequencies in beehive pattern to avoid degraded throughput Interference from Bluetooth, microwaves, garage door openers unlicensed spectrum!
Prof. Rick Han, University of Colorado at Boulder

802.11a: OFDM
OFDM = Orthogonal Frequency Division Multiplexing
Special case of Multi-Carrier Modulation (MCM), or Discrete Multi-Tone (DMT)

Divide data bit stream d(t) over different frequencies. For example: Delivers better performance than DSSS, especially indoors

Transmit(t) = d1(t)*cos(2p3000t) + d2(t)*cos (2p6000t) 48 subcarriers in 802.11a over a 20 MHz channel

High spectral efficiency, resistance to multipath, Various flavors of DSL also employ this technique
Prof. Rick Han, University of Colorado at Boulder

Token Ring
Not very popular, even being phased out at IBM primarily of historical interest
Why did Ethernet win? Cheaper and good enough

Conceptual Topology of Token Ring:

Token Ring Ethernet

Prof. Rick Han, University of Colorado at Boulder

Token Ring (2)

Links are unidirectional Each node has a downstream neighbor and an upstream neighbor Topology resembles N point-to-point links forming a ring rather than continuous wire loop

A token is a special flag that circulates around the ring

Prof. Rick Han, University of Colorado at Boulder

but access to ring is shared via tokens

Token Ring

010010 Token

Token Ring (3)

Each node receives token, then transmits it to its downstream neighbor

Round-robin ensures fairness, as every node eventually can transmit when it receives token Suppose token was passed from source to destination rather than around the ring as in Token Ring Token 010010 some hosts could Ring be passed over Token indefinitely unfair!
Prof. Rick Han, University of Colorado at Boulder

Token Ring (4)

When a node has a frame to send, it takes token, and transmits frame downstream
Each node receives a frame and forwards it downstream Destination host saves copy of frame, but keeps forwarding frame. Inefficient Forwarding stops when frame reaches original source
Prof. Rick Han, University of Colorado at Boulder

1110011010 Data Frame Token Ring 010010 Token

Token Ring Example

(3) (2)

1110011010 Data Frame

(4) Destination

1110011010 Data Frame Token Ring

Source (1) 010010 1110011010

1110011010 Data Frame 1110011010

Data Frame (5)

Token 1110011010
Data Frame (6)
Prof. Rick Han, University of Colorado at Boulder

Data Frame
(7) Stop Data Frame

 A given node can fail at any time:

Without the token With the token

Token Rings Robustness To Failure

If a node fails without the token:

An electromechnical relay closes at failing node, keeping the ring intact Data frame continues to be forwarded as before
Prof. Rick Han, University of Colorado at Boulder

1110011010 Data Frame Token Ring 010010 Token

 In Token Ring, when frame reaches a destination node, it is marked as read

Token Rings Robustness To Failure (2)

When marked-as-read frame reaches sender, it acts as ACK to sender Destination 1110011010 Data Frame Token Ring 010010 Token

If a destination node fails without the token:

Sender receives unmarked frame, and can retransmit it later

Prof. Rick Han, University of Colorado at Boulder

 If a node fails with the token, then the ring must somehow introduce a new token

Token Rings Robustness To Failure (3)

If designated monitor fails

After a timeout, in which no token is detected, a designated monitor introduces a new token

Its periodic keepalive not detected Token A node sends claim Ring token around ring If claim token returns to sender, then sender becomes Prof. Rick Han, University of designated monitor
Colorado at Boulder

010010 Token

Token Ring : Other Points

Token Holding Time (THT) by default is 20 ms Token Ring data rates are 4 and 16 Mbps If a token is held until data frame returns, then called delay-release
Inefficient, original version of 802.5 Solution: release token as soon as send has transmitted data frame More efficient, called early release, now supported in later version of 802.5

Token Rotation Time <= (# Nodes)*THT + Ring Latency

Prof. Rick Han, University of Colorado at Boulder

FDDI
Fiber Distributed Data Interface
Dual ring topology originally using optical fibers instead of copper wire 100 Mbps

Second ring helps with robustness/ fault recovery Some nodes may be part of only one ring: single attachment station (SAS)
Prof. Rick Han, University of Colorado at Boulder

FDDI

FDDI (2)
Recall the inefficiency of Token Ring: frames are forwarded even after theyve reached destination
Solution: in FDDI, destination node removes frame Destination from ring 1110011010 Data Frame

FDDI

Prof. Rick Han, University of Colorado at Boulder