Chapter 6
The Link Layer
and LANs
Link Layer and LANs 6-1
Chapter 6: Link layer and LANs
our goals:
§ understand principles behind some link
layer services:
• sharing a broadcast channel: multiple access
• link layer addressing
§ instantiation, implementation of various
link layer technologies
Link Layer and LANs 6-2
Link layer, LANs: outline
6.1 introduction, services 6.5 link virtualization:
MPLS
6.2 error detection,
correction
6.6 data center
networking
6.3 multiple access
protocols
6.7 a day in the life of a
web request
6.4 LANs
• addressing, ARP
• Ethernet
• switches
• VLANS
Link Layer and LANs 6-3
Link layer: introduction
terminology:
§ hosts and routers: nodes
§ communication channels that
connect adjacent nodes
along communication path:
links
• wired links
• wireless links
• LANs
§ layer-2 packet: frame,
encapsulates datagram
data-link layer has responsibility of
transferring datagram from one node
to physically adjacent node over a link
Link Layer and LANs 6-4
Link layer: introduction
§ datagram transferred by
different link protocols over
different links:
• e.g., Ethernet on first link,
frame relay on
intermediate links, 802.11
on last link
§ each link protocol provides
different services
• e.g., may or may not
provide rdt over link
Link Layer and LANs 6-5
Link layer: context
§ datagram transferred by
different link protocols over
different links:
• e.g., Ethernet on first link,
frame relay on
intermediate links, 802.11
on last link
§ each link protocol provides
different services
• e.g., may or may not
provide rdt over link
transportation analogy:
§ trip from Dartmouth to Lyon
• limo: Dartmouth to Logan
• plane: Logan to Paris
• train: Paris to Lyon
§ tourist = datagram
§ transport segment =
communication link
§ transportation mode = link
layer protocol
§ travel agent = routing
algorithm
Link Layer and LANs 6-6
Framing and Access
§ Encapsulate datagram into frame, adding
header, trailer
§ Channel access if shared medium
§ “MAC” addresses used in frame headers
to identify source, destination
Different from IP address!
Link Layer and LANs 6-7
LAN addresses (more)
§ MAC address allocation administered by IEEE
§ manufacturer buys portion of MAC address space
(to assure uniqueness)
§ MAC flat address ➜ portability
• can move LAN card from one LAN to another
§ IP hierarchical address not portable
• address depends on IP subnet to which node is
attached
§ analogy:
• MAC address: like Social Security Number
• IP address: like postal address
Link Layer and LANs 6-8
Where is the link layer implemented?
§ in each and every host
§ link layer implemented in
“adaptor” (aka network
interface card NIC) or on a
chip
• Ethernet card, 802.11
card; Ethernet chipset
• implements link, physical
layer
§ attaches into host’s system
buses
§ combination of hardware,
software, firmware
application
transport
network
link
cpu
memory
controller
link
physical
host
bus
(e.g., PCI)
physical
transmission
network adapter
card
Link Layer and LANs 6-9
Adaptors communicating
datagram
datagram
controller
controller
sending host
receiving host
datagram
frame
§ receiving side
§ sending side:
• looks for errors, rdt,
• encapsulates datagram in
flow control, etc.
frame
• extracts datagram, passes
• adds error checking bits,
to upper layer at
rdt, flow control, etc.
receiving side
Link Layer and LANs 6-10
Link layer, LANs: outline
6.1 introduction, services 6.5 link virtualization:
MPLS
6.2 error detection,
correction
6.6 data center
networking
6.3 multiple access
protocols
6.7 a day in the life of a
web request
6.4 LANs
• addressing, ARP
• Ethernet
• switches
• VLANS
Link Layer and LANs 6-11
MAC addresses and ARP
§ 32-bit IP address:
• network-layer address for interface
• used for layer 3 (network layer) forwarding
§ MAC (or LAN or physical or Ethernet)
address:
• function: used ‘locally” to get frame from one
interface to another physically-connected
interface (same network, in IP-addressing
sense)
• 48 bit MAC address (for most LANs)
burned in NIC ROM, also sometimes
software settable
• e.g.: 1A-2F-BB-76-09-AD
hexadecimal (base 16) notation
(each “numeral” represents 4 bits)
Link Layer and LANs 6-12
LAN addresses and ARP
each adapter on LAN has unique LAN address
1A-2F-BB-76-09-AD
LAN
(wired or
wireless)
71-65-F7-2B-08-53
adapter
58-23-D7-FA-20-B0
0C-C4-11-6F-E3-98
Link Layer and LANs 6-13
ARP: address resolution protocol
Question: how to determine
interface’s MAC address,
knowing its IP address?
137.196.7.78
1A-2F-BB-76-09-AD
137.196.7.23
137.196.7.14
LAN
71-65-F7-2B-08-53
58-23-D7-FA-20-B0
0C-C4-11-6F-E3-98
ARP table: each IP node (host,
router) on LAN has table
• IP/MAC address
mappings for some LAN
nodes:
< IP address; MAC address; TTL>
• TTL (Time To Live):
time after which address
mapping will be
forgotten (typically 20
min)
137.196.7.88
Link Layer and LANs 6-14
ARP protocol: same LAN
§ A wants to send datagram
to B
• B’s MAC address not in
A’s ARP table.
§ A broadcasts ARP query
packet, containing B's IP
address
• destination MAC address =
FF-FF-FF-FF-FF-FF
• all nodes on LAN receive
ARP query
§ B receives ARP packet,
replies to A with its (B's)
MAC address
§ A caches (saves) IP-toMAC address pair in its
ARP table until information
becomes old (times out)
• soft state: information that
times out (goes away)
unless refreshed
§ ARP is “plug-and-play”:
• nodes create their ARP
tables without intervention
from net administrator
• frame sent to A’s MAC
address (unicast)
Link Layer and LANs 6-15
A Complete Routing Example
Network Layer
4-16
How to Check if Dest. on Same Network?
§ Network Mask where every bit in the network
prefix is set to “1”
§ Examples: a network that includes an IP
IP Address
128.116.12.32/24
128.116.12.32/16
128.116.12.32/8
128.116.12.32/27
128.116.12.32/30
128.116.12.32/20
128.116.12.32/18
Network Mask
255.255.255.0
255.255.0.0
255.0.0.0
255.255.255.224
255.255.255.252
255.255.240.0
255.255.192.0
How to Check if Dest. on Same Network?
§ Network Mask where every bit in the network
prefix is set to “1”
§ Examples: a network that includes an IP
IP Address
128.116.12.32/24
128.116.12.32/16
128.116.12.32/8
128.116.12.32/27
128.116.12.32/30
128.116.12.32/20
128.116.12.32/18
Network Mask
255.255.255.0
255.255.0.0
255.0.0.0
255.255.255.224
255.255.255.252
255.255.240.0
255.255.192.0
Routing Example:
§ What happens when WK 1 (192.168.1.1) wants
to send a packet to WK 2 (192.168.1.2)?
• Convert the IPs to binary
• Apply the subnet mask
• AND the results
• Compare prefixes
Hosts are on the same subnet
§ WK 1 (192.168.1.1) will attempt to send packet to WK2
(192.168.1.2) directly (without going through GW)?
§ Assume WK1 knows the MAC address of WK2
• else:
• WK1 broadcasts an ARP packet on the local subnet:
– MAC address is FF-FF-FF-FF-FF-FF
– IP address is 192.168.1.2
• If one of the hosts determines that its IP address matches
that in the ARP packet, in this case WK2, it will respond to WK1
including its MAC address
WK1 creates a pkt with the following header
§ What happens when WK1 (192.168.1.1) wants to
send a packet to WK3 (192.168.2.1)?
• Convert the IPs to binary
• Apply the subnet mask
• AND the results
• Compare prefixes
Hosts are on different subnets
§ WK1 (192.168.1.1) can’t send packet to WK3
(192.168.2.1) directly
§ It does so through Router
§ Assume WK1 knows the MAC address of Router
• Else:
…….
WK1 creates a pkt with the following header
§ Router receives the packet:
• Notices that the destination IP address is not of its own and
belongs to another network
• Uses its local forwarding table to determine where to send the
packet to (e.g. connected to one of its interfaces )
• Removes its MAC address from the packet and replace it with
WK3's once it obtains it via the ARP protocol
Router creates a pkt with the following header
Addressing: routing to another LAN
walkthrough: send datagram from A to B via R
§ focus on addressing – at IP (datagram) and MAC layer (frame)
§ assume A knows B’s IP address
§ assume A knows IP address of first hop router, R (how?)
§ assume A knows R’s MAC address (how?)
A
R
111.111.111.111
74-29-9C-E8-FF-55
B
222.222.222.222
49-BD-D2-C7-56-2A
222.222.222.220
1A-23-F9-CD-06-9B
111.111.111.112
CC-49-DE-D0-AB-7D
111.111.111.110
E6-E9-00-17-BB-4B
222.222.222.221
88-B2-2F-54-1A-0F
Link Layer and LANs 6-25
Addressing: routing to another LAN
§ A creates IP datagram with IP source A, destination B
§ A creates link-layer frame with R's MAC address as destination address,
frame contains A-to-B IP datagram
MAC src: 74-29-9C-E8-FF-55
MAC dest: E6-E9-00-17-BB-4B
IP src: 111.111.111.111
IP dest: 222.222.222.222
IP
Eth
Phy
A
R
111.111.111.111
74-29-9C-E8-FF-55
B
222.222.222.222
49-BD-D2-C7-56-2A
222.222.222.220
1A-23-F9-CD-06-9B
111.111.111.112
CC-49-DE-D0-AB-7D
111.111.111.110
E6-E9-00-17-BB-4B
222.222.222.221
88-B2-2F-54-1A-0F
Link Layer and LANs 6-26
Addressing: routing to another LAN
§ frame sent from A to R
§ frame received at R, datagram removed, passed up to IP
MAC src: 74-29-9C-E8-FF-55
MAC dest: E6-E9-00-17-BB-4B
IP src: 111.111.111.111
IP dest: 222.222.222.222
IP src: 111.111.111.111
IP dest: 222.222.222.222
IP
Eth
Phy
A
IP
Eth
Phy
R
111.111.111.111
74-29-9C-E8-FF-55
B
222.222.222.222
49-BD-D2-C7-56-2A
222.222.222.220
1A-23-F9-CD-06-9B
111.111.111.112
CC-49-DE-D0-AB-7D
111.111.111.110
E6-E9-00-17-BB-4B
222.222.222.221
88-B2-2F-54-1A-0F
Link Layer and LANs 6-27
Addressing: routing to another LAN
§ R forwards datagram with IP source A, destination B
§ R creates link-layer frame with B's MAC address as destination address,
frame contains A-to-B IP datagram
MAC src: 1A-23-F9-CD-06-9B
MAC dest: 49-BD-D2-C7-56-2A
IP src: 111.111.111.111
IP dest: 222.222.222.222
IP
Eth
Phy
A
R
111.111.111.111
74-29-9C-E8-FF-55
IP
Eth
Phy
B
222.222.222.222
49-BD-D2-C7-56-2A
222.222.222.220
1A-23-F9-CD-06-9B
111.111.111.112
CC-49-DE-D0-AB-7D
111.111.111.110
E6-E9-00-17-BB-4B
222.222.222.221
88-B2-2F-54-1A-0F
Link Layer and LANs 6-28
Addressing: routing to another LAN
§ R forwards datagram with IP source A, destination B
§ R creates link-layer frame with B's MAC address as destination address,
frame contains A-to-B IP datagram
MAC src: 1A-23-F9-CD-06-9B
MAC dest: 49-BD-D2-C7-56-2A
IP src: 111.111.111.111
IP dest: 222.222.222.222
IP
Eth
Phy
A
R
111.111.111.111
74-29-9C-E8-FF-55
IP
Eth
Phy
B
222.222.222.222
49-BD-D2-C7-56-2A
222.222.222.220
1A-23-F9-CD-06-9B
111.111.111.112
CC-49-DE-D0-AB-7D
111.111.111.110
E6-E9-00-17-BB-4B
222.222.222.221
88-B2-2F-54-1A-0F
Link Layer and LANs 6-29
Addressing: routing to another LAN
§ R forwards datagram with IP source A, destination B
§ R creates link-layer frame with B's MAC address as dest, frame contains
A-to-B IP datagram
MAC src: 1A-23-F9-CD-06-9B
MAC dest: 49-BD-D2-C7-56-2A
IP src: 111.111.111.111
IP dest: 222.222.222.222
IP
Eth
Phy
A
R
111.111.111.111
74-29-9C-E8-FF-55
B
222.222.222.222
49-BD-D2-C7-56-2A
222.222.222.220
1A-23-F9-CD-06-9B
111.111.111.112
CC-49-DE-D0-AB-7D
111.111.111.110
E6-E9-00-17-BB-4B
* Check out the online interactive exercises for more
examples: http://gaia.cs.umass.edu/kurose_ross/interactive/
222.222.222.221
88-B2-2F-54-1A-0F
Link Layer and LANs 6-30
Link layer, LANs: outline
6.1 introduction, services 6.5 link virtualization:
MPLS
6.2 error detection,
correction
6.6 data center
networking
6.3 multiple access
protocols
6.7 a day in the life of a
web request
6.4 LANs
• addressing, ARP
• Ethernet
• switches
• VLANS
Link Layer and LANs 6-31
Multiple access links, protocols
two types of “links”:
§ point-to-point
• PPP for dial-up access
• point-to-point link between Ethernet switch, host
§ broadcast (shared wire or medium)
• old-fashioned Ethernet
• upstream Hybrid fiber-coaxial (HFC)
• 802.11 wireless LAN
shared wire (e.g.,
cabled Ethernet)
shared RF
(e.g., 802.11 WiFi)
shared RF
(satellite)
humans at a
cocktail party
(shared air, acoustical)
Link Layer and LANs 6-32
Multiple access protocols
§ single shared broadcast channel
§ two or more simultaneous transmissions by node
causes interference
• collision if node receives two or more signals at
the same time
multiple access protocol:
§ distributed algorithm that determines how nodes
share channel, i.e., determine when node can transmit
§ communication about channel sharing must use
channel itself!
• no out-of-band channel for coordination
Link Layer and LANs 6-33
An ideal multiple access protocol
given: broadcast channel of rate R bps
Desirable characteristics:
1. when one node wants to transmit, it can send at
rate R.
2. when M nodes want to transmit, each can send at
average rate R/M
3. fully decentralized:
• no special node to coordinate transmissions
• no synchronization of clocks, slots
4. simple
Link Layer and LANs 6-34
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
Link Layer and LANs 6-35
Channel partitioning MAC protocols: TDMA
TDMA: time division multiple access
§ access to channel in "rounds"
§ each station gets fixed length slot (length = packet
transmission time) in each round
§ unused slots go idle
§ example: 6-station LAN, 1,3,4 have packets to
send, slots 2,5,6 idle
6-slot
frame
6-slot
frame
1
3
4
1
3
4
Link Layer and LANs 6-36
Channel partitioning MAC protocols: FDMA
FDMA: frequency division multiple access
FDM cable
frequency bands
§ 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 packet to send, frequency
bands 2,5,6 idle
1
time
2
3
4
5
6
Link Layer and LANs 6-37
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:
• slotted ALOHA
• ALOHA
• CSMA, CSMA/CD, CSMA/CA
Link Layer and LANs 6-38
Slotted ALOHA
assumptions:
operation:
§ all frames same size
§ when node obtains fresh
frame, transmits in next slot
§ time divided into equal size
slots (time to transmit 1
• if no collision: node can send
frame)
new frame in next slot
§ nodes start to transmit
only slot beginning
• if collision: node retransmits
§ nodes are synchronized
frame in each subsequent
§ if 2 or more nodes transmit
slot with prob. p until
in slot, all nodes detect
success
collision
Link Layer and LANs 6-39
Slotted ALOHA
node 1
1
1
node 2
2
2
node 3
3
C
1
1
2
3
E
C
S
E
C
3
E
S
S
Pros:
Cons:
§ If single active node, it can
continuously transmit at
full rate of channel
§ highly decentralized: only
slots in nodes need to be
in sync
§ simple
§ collisions, wasting slots
§ idle slots
§ nodes may be able to
detect collision in less
than time to transmit
packet (why wait?)
§ clock synchronization
Link Layer and LANs 6-40
Slotted ALOHA: efficiency
efficiency: long-run
fraction of successful slots
(many nodes, all with many
frames to send)
§ suppose: N nodes with
many frames to send, each
transmits in slot with
probability p
§ prob that given node has
success in a slot = p(1p)N-1
§ prob that any node has a
success = Np(1-p)N-1
§ max efficiency: find p* that
maximizes
Np(1-p)N-1
§ for many nodes, take limit of
Np*(1-p*)N-1 as N goes to
infinity, gives:
max efficiency = 1/e = .37
at best: channel
used for useful
transmissions 37%
of time!
!
Link Layer and LANs 6-41
Pure (unslotted) ALOHA
§ unslotted Aloha: simpler, no synchronization
§ when frame first arrives
• transmit immediately
§ collision probability increases:
• frame sent at t0 collides with other frames sent
in [t0-1,t0+1]
Link Layer and LANs 6-42
Pure ALOHA efficiency
P(success by given node) = P(node transmits) .
P(no other node transmits in [t0-1,t0] .
P(no other node transmits in [t0-1,t0]
= p . (1-p)N-1 . (1-p)N-1
= p . (1-p)2(N-1)
… choosing optimum p and then letting n
= 1/(2e) = .18
even worse than slotted Aloha!
Link Layer and LANs 6-43
“Humans Sharing a Channel” Protocol
§ “Give everyone a chance to speak.”
§ “Don’t speak until you are spoken to.”
§ “Don’t monopolize the conversation.”
§ “Raise your hand if you have a question.”
§ “Don’t interrupt when someone is speaking.”
§ “Don’t fall asleep when someone is talking.”
Link Layer and LANs 6-44
CSMA (carrier sense multiple access)
CSMA: listen before transmit:
if channel sensed idle: transmit entire frame
§ if channel sensed busy, defer
transmission
human analogy: don’t interrupt others!
Link Layer and LANs 6-45
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
• distance &
propagation delay
play role in in
determining collision
probability
Link Layer and LANs 6-46
CSMA/CD (collision detection)
CSMA/CD: carrier sensing, deferral as in CSMA
• 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
human analogy: the polite conversationalist
Link Layer and LANs 6-47
CSMA/CD (collision detection)
spatial layout of nodes
Link Layer and LANs 6-48
Ethernet CSMA/CD algorithm
1. NIC receives datagram
from network layer,
creates frame
2. If NIC senses channel
idle, starts frame
transmission. If NIC
senses channel busy,
waits until channel idle,
then transmits.
3. If NIC transmits entire
frame without detecting
another transmission,
NIC is done with frame !
4. If NIC detects another
transmission while
transmitting, aborts and
sends jam signal
5. After aborting, NIC
enters binary
(exponential) backoff:
• after mth collision, NIC
chooses K at random
from {0,1,2, …, 2m-1}.
NIC waits K·512 bit
times, returns to Step 2
• longer backoff interval
with more collisions
Link Layer and LANs 6-49
CSMA/CD efficiency
§ tprop = max prop delay between 2 nodes in LAN
§ ttrans = time to transmit max-size frame
)**+,+)$,- =
"
" + !! &"'& (!!"#$%
§ efficiency goes to 1
• as tprop goes to 0 (colliding nodes will abort immediately
without wasting the channel)
• as ttrans goes to infinity (when a frame grabs the channel,
it will hold on to the channel for a very long time)
§ better performance than ALOHA: and simple, cheap,
decentralized!
Link Layer and LANs 6-50
“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!
Link Layer and LANs 6-51
“Taking turns” MAC protocols
polling:
§ Centralized Controller
node “invites” other
nodes to transmit in
turn
§ typically used with
“dumb” devices
§ concerns:
• polling overhead
• latency
• single point of
failure (boss)
data
data
poll
Centralized
Controller
Client
Devices
Link Layer and LANs 6-52
“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
Link Layer and LANs 6-53
Summary of MAC protocols
§ channel partitioning, by time, frequency or code
• Time Division, Frequency Division
§ random access (dynamic),
• ALOHA, S-ALOHA, CSMA, CSMA/CD
• carrier sensing: easy in some technologies (wire), hard
in others (wireless)
• CSMA/CD used in Ethernet
• CSMA/CA used in 802.11
§ taking turns
• polling from central site, token passing
• Bluetooth, FDDI, token ring
Link Layer and LANs 6-54
Link layer, LANs: outline
6.1 introduction, services 6.5 link virtualization:
MPLS
6.2 error detection,
correction
6.6 data center
networking
6.3 multiple access
protocols
6.7 a day in the life of a
web request
6.4 LANs
• addressing, ARP
• Ethernet
• switches
• VLANS
Link Layer and LANs 6-55
Ethernet
“dominant” wired LAN technology:
§ single chip, multiple speeds (e.g., Broadcom BCM5761)
§ first widely used LAN technology
§ simple, cheap
§ kept up with speed race: 10 Mbps – 10 Gbps
Metcalfe’s Ethernet sketch
Link Layer and LANs 6-56
Ethernet: physical topology (Bus)
§ Popular through mid 90s
§ All nodes in same collision domain (can collide with
each other)
bus: coaxial cable
Link Layer and LANs 6-57
Ethernet: physical topology (Star)
Data Link Layer
5-58
Ethernet: physical topology (Star)
Data Link Layer
5-59
Ethernet: physical topology (Star)
Data Link Layer
5-60
Ethernet: physical topology (Star)
Data Link Layer
5-61
Ethernet: physical topology (Star)
Data Link Layer
5-62
Ethernet: physical topology (Star)
Data Link Layer
5-63
Ethernet: physical topology (Star)
Data Link Layer
5-64
Ethernet: physical topology (Star)
Data Link Layer
5-65
Ethernet: physical topology (Star)
§ Prevails today
§ Active switch in center
§ Each “spoke” runs a (separate) Ethernet protocol
(nodes do not collide with each other)
switch
star
Link Layer and LANs 6-66
Ethernet frame structure
§ sending adapter encapsulates IP datagram
(or other network layer protocol packet)
in Ethernet frametype
dest.
source
preamble address address
data
(payload)
CRC
preamble:
§ 7 bytes with pattern 10101010 followed by
one byte with pattern 10101011
§ used to synchronize receiver, sender clock
rates
Link Layer and LANs 6-67
Ethernet frame structure (more)
§ addresses: 6 byte source, destination MAC addresses
• if adapter receives frame with matching destination
address, or with broadcast address (e.g. ARP packet), it
passes data in frame to network layer protocol
• otherwise, adapter discards frame
§ type: indicates higher layer protocol (mostly IP but
others possible, e.g., Novell IPX, AppleTalk)
§ CRC: cyclic redundancy check at receiver
• error detected: frame is dropped
type
dest.
source
preamble address address
data
(payload)
CRC
Link Layer and LANs 6-68
Ethernet: unreliable, connectionless
§ connectionless: no handshaking between sending and
receiving NICs
§ unreliable: receiving NIC doesn't send acks or nacks
to sending NIC
• data in dropped frames recovered only if initial
sender uses higher layer rdt (e.g., TCP), otherwise
dropped data lost
§ Ethernet’s MAC protocol: unslotted CSMA/CD with
binary backoff
Link Layer and LANs 6-69
802.3 Ethernet standards: link & physical layers
§ many different Ethernet standards
• common MAC protocol and frame format
• different speeds: 2 Mbps, 10 Mbps, 100 Mbps, 1Gbps,
10 Gbps, 40 Gbps
• different physical layer media: fiber, cable
application
transport
network
link
physical
MAC protocol
and frame format
100BASE-TX
100BASE-T2
100BASE-FX
100BASE-T4
100BASE-SX
100BASE-BX
copper (twister
pair) physical layer
fiber physical layer
Link Layer and LANs 6-70
IEEE 802.11 Wireless LAN
802.11a
802.11b
§ 5-6 GHz range
§ 2.4-5 GHz unlicensed spectrum
§ up to 54 Mbps
§ up to 11 Mbps
§ direct sequence spread spectrum 802.11g
§ 2.4-5 GHz range
(DSSS) in physical layer
§ up to 54 Mbps
• all hosts use same chipping
802.11n: multiple antennae
code
§ 2.4-5 GHz range
§ up to 200 Mbps
§ all use CSMA/CA for multiple access
§ all have base-station and ad-hoc network versions
Wireless and Mobile Networks 7-71
Wireless network characteristics
Multiple wireless senders and receivers create additional
problems (beyond multiple access):
B
A
C
C
A
B
Hidden terminal problem
§ B, A hear each other
§ B, C hear each other
§ A, C can not hear each other
means A, C unaware of their
interference at B
C’s signal
strength
A’s signal
strength
space
Signal attenuation:
§ B, A hear each other
§ B, C hear each other
§ A, C can not hear each other
interfering at B
Wireless and Mobile Networks 7-72
IEEE 802.11: multiple access
§ avoid collisions: 2+ nodes transmitting at same time
§ 802.11: CSMA - sense before transmitting
• don’t collide with ongoing transmission by other node
§ 802.11: no collision detection!
• difficult to receive (sense collisions) when transmitting due to weak
received signals (fading)
• can’t sense all collisions in any case: hidden terminal, fading
• goal: avoid collisions: CSMA/C(ollision)A(voidance)
C
A
B
A
B
C
C’s signal
strength
A’s signal
strength
space
Wireless and Mobile Networks 7-73
IEEE 802.11 MAC Protocol: CSMA/CA
802.11 sender
1 if sense channel idle for Distributed Inter-
sender
frame Space (DIFS) then transmit entire
frame (no CD)
2 if sense channel busy then
DIFS
start random backoff time
timer counts down while channel idle
transmit when timer expires
if no ACK, increase random backoff interval,
repeat 2
802.11 receiver
- if frame received OK
receiver
data
SIFS
ACK
return ACK after (SIFS) Short Inter-frame
Spacing (ACK needed due to hidden terminal
problem)
Wireless and Mobile Networks 7-74
Avoiding collisions (optional)
idea: allow sender to “reserve” channel rather than
random access of data frames: avoid collisions of long
data frames
§ sender first transmits small request-to-send (RTS)
packets to BS using CSMA
• RTSs may still collide with each other (but they’re short)
§ BS broadcasts clear-to-send CTS in response to RTS
§ CTS heard by all nodes
• sender transmits data frame
• other stations defer transmissions
avoid data frame collisions completely
using small reservation packets!
Wireless and Mobile Networks 7-75
Collision Avoidance: RTS-CTS exchange (optional)
A
B
AP
RTS(B)
RTS(A)
reservation collision
RTS(A)
CTS(A)
CTS(A)
DATA (A)
defer
time
ACK(A)
ACK(A)
Wireless and Mobile Networks 7-76