1/29/2008

From Signals to Packets

Analog Signal
Lecture 6
Datalink – Framing, Switching “Digital” Signal

Peter Steenkiste
Bit Stream 0 0 1 0 1 1 1 0 0 0 1
Departments of Computer Science and
Electrical and Computer Engineering 0100010101011100101010101011101110000001111010101110101010101101011010111001
Packets
Carnegie Mellon University Header/Body Header/Body Header/Body

15-441 Networking, Spring 2008 Packet

Transmission Sender Receiver
http://www.cs.cmu.edu/~dga/15-441/S08
1 2

Datalink Functions Datalink Lectures

z Framing: encapsulating a network layer z Framing and error coding.

datagram into a bit stream. z Datalink architectures.
» Add header, mark and detect frame boundaries, …
z Switch-based networks.
z Media access: controlling which frame should » Packet forwarding
be sent over the link next. » Flow and error control
» Easy for point-to-point links; half versus full duplex
» Harder for multi-access links: who gets to send? z Taking turn protocols.
z Error control: error detection and correction
to deal with bit errors. z Contention-based networks: basic Ethernet.
» May also include other reliability support, e.g.
retransmission z Ethernet bridging and switching.
z Flow control: avoid that the sender outruns z Connectivity to the home.
the receiver.
z Circuit-based communication
3 4

Framing Character and Bit Stuffing

z Mark frames with special character.

z A link layer function, defining which bits have » What happens when the user sends this character?
which function. » Use escape character when controls appear in data:
z Minimal functionality: mark the beginning and *abc*def -> *abc\*def
» Very common on serial lines, in editors, etc.
end of ppackets (or
( frames). )
z M k fframes with
Mark ith special
i l bit sequence
z Some techniques: » must ensure data containing this sequence can be
» out of band delimiters (e.g. FDDI 4B/5B control symbols) transmitted
» frame delimiter characters with character stuffing » example: suppose 11111111 is a special sequence.
» frame delimiter codes with bit stuffing » transmitter inserts a 0 when this appears in the data:
» synchronous transmission (e.g. SONET) » 11111111 -> 111111101
» must stuff a zero any time seven 1s appear:
» 11111110 -> 111111100
» receiver unstuffs.

5 6

1
 1/29/2008

Example: Ethernet Framing SONET

z SONET is the Synchronous Optical Network

standard for data transport over optical fiber.
preamble datagram length more stuff
z One of the design goals was to be backwards
compatible with many older telco standards.
z Preamble is 7 bytes of 10101010 (5 MHz z Beside minimal framing functionality, it
square wave) followed by one byte of provides many other functions:
» operation, administration and maintenance (OAM)
10101011 communications
z Allows receivers to recognize start of » synchronization
transmission after idle channel » multiplexing of lower rate signals
» multiplexing for higher rates

7 8

Standardization History A Word about Data Rates

z Process was started by divestiture in 1984. z Bandwidth of telephone channel is under

» Multiple telephone companies building their own 4KHz, so when digitizing:
infrastructure
8000 samples/sec * 8 bits = 64Kbits/second
z SONET concepts originally developed by
B ll
Bellcore. z Common data rates supported by telcos in
North America:
z First standardized by ANSI T1X1 group for the » Modem: rate improved over the years
US. » T1/DS1: 24 voice channels plus 1 bit per sample
z Later picked up by CCITT and developed its (24 * 8 + 1) * 8000 = 1.544 Mbits/second
own version. » T3/DS3: 28 T1 channels:
z SONET/SDH standards approved in 1988. 7 * 4 * 1.544 = 44.736 Mbits/second

9 10

Synchronous Data Transfer SONET Framing

z Sender and receiver are always synchronized. z Base channel is STS-1 (Synchronous Transport System).
» Frame boundaries are recognized based on the clock » Takes 125 μsec and corresponds to 51.84 Mbps
» No need to continuously look for special bit sequences » 1 byte/frame corresponds to a 64 Kbs channel (voice)
» Transmitted on an OC-1 optical carrier (fiber link)
z SONET frames contain room for control and data.
» Data frame multiplexes bytes from many users z Standard ways of supporting slower and faster channels.
» Control
C t l provides
id information
i f ti on data,
d t management,
t … » Support both old standards and future (higher) data rates
z Actual payload frame “floats” in the synchronous frame.
» Clocks on individual links do not have to be synchronized
3 cols 3 cols 87 cols payload capacity,
transport 87 cols payload capacity transport including 1 col path overhead
overhead overhead

9 rows 9 rows

11 12

2
 1/29/2008

How Do We Support How Do We Support

Lower Rates? Higher Rates?

z 1 Byte in every consecutive z Send multiple frames in a 125

frame corresponds to a 64 μsec time slot.

125 μsec

125 μsec
Kbit/second channel. z The properties of a channel
» 1 voice call. using a single byte/ST-1
z Higher bandwidth channels frame are maintained!
hold more bytes per frame.
frame » Constant 64 Kbit/second rate

125 μsec

125 μsec
» Multiples of 64 Kbit/second » Nice spacing of the byte samples

z Channels have a “telecom” z Rates typically go up by a

flavor. factor of 4.
» Fixed bandwidth z Two ways of doing
interleaving.

125 μsec

125 μsec
» Just data – no headers
» SONET multiplexers remember » Frame interleaving
how bytes on one link should be » Column interleaving
mapped to bytes on the next link
– concatenated version, i.e.
– Byte 33 on incoming link 1 OC-3c
is byte 97 on outgoing link 7

13 14

The SONET Signal Hierarchy Using SONET in Networks

Add-drop capability allows soft configuration of networks,
usually managed manually.
Signal Type line rate # of DS0

DS0 (POTS) 64 Kbs 1

OC-48 mux
DS1 1.544 Mbs 24
STS-1 carries DS3 44.736 Mbs 672 DS1
one DS-3 plus
OC-1 51.84 Mbs 672
overhead OC-3c mux
OC-3 155 Mbs 2,016
OC-12 622 Mbs 8,064 OC-12c
STS-48 2.49 Gbs 32,256
mux
STS-192 9.95 Gbs 129,024
STS-768 39.8 Gbs 516,096

15 16

Self-Healing SONET Rings SONET as Physical Layer

OC3/12 OC3/12
OC3/12 Access CO CO Access
OC-48
Access CO OC12/48
mux mux OC12/48 Metro
CO
Metro
POP
CO
POP WDM Backbone OC3/12
OC48/192 Access
OC3/12
Access
DS1 POP

mux mux
OC-3c OC3/12 OC12/48
CO CO
OC3/12
Access Metro
OC-12c Access
17 18

3
 1/29/2008

Basic Concept:
Error Coding Hamming Distance

z Hamming distance of two

z Transmission process may introduce errors 1 0 1 1 0 HD=2
bit strings = number of bit
into a message. 1 1 0 1 0
positions in which they
» Single bit errors versus burst errors
differ.
z Detection: HD=3
z If the valid words of a code
» Requires a convention that some messages are invalid
have minimum Hamming
» Hence requires extra bits
distance D, then D-1 bit
» An (n,k) code has codewords of n bits with k data bits errors can be detected.
and r = (n-k) redundant check bits
z Correction z If the valid words of a code
» Forward error correction: many related code words map
have minimum Hamming
to the same data word distance D, then [(D-1)/2] bit
» Detect errors and retry transmission errors can be corrected.

19 20

Cyclic Redundancy Codes

Examples (CRC)

z A (4,3) parity code has D=2: z Commonly used codes that have good error
0001 0010 0100 0111 1000 1011 1101 1110 detection properties.
(last bit is binary sum of previous 3, inverted - “odd parity”) » Can catch many error combinations with a small number or
redundant bits
z A (7,4) code with D=3 (2ED, 1EC):
0000000 0001101 0010111 0011010
z Based on division of p
polynomials.
y
0100011 0101110 0110100 0111001 » Errors can be viewed as adding terms to the polynomial
1000110 1001011 1010001 1011100 » Should be unlikely that the division will still work
1100101 1101000 1110010 1111111 z Can be implemented very efficiently in
z 1001111 corrects to 1001011 hardware.
z Note the inherent risk in correction; consider z Examples:
a 2-bit error resulting in 1001011 -> 1111011. » CRC-32: Ethernet
» CRC-8, CRC-10, CRC-32: ATM
z There are formulas to calculate the number of
extra bits that are needed for a certain D.
21 22

Datalink Architectures Media Access Control

z How do we transfer packets between two hosts

connected to the same network?
z Switches connected by point-to-point links --
store-and-forward.
» Used in WAN, LAN, and for home connections
» Conceptually similar to “routing”
– But at the datalink layer instead of the network layer
» Today

Packet forwarding. z Multiple access networks -- contention based.

z z Media access
» Multiple hosts are sharing the same transmission medium
z Error and flow control. control. » Used in LANs and wireless
z Scalability. » Need to control access to the medium
» Mostly Thursday lecture

23 24

4
 1/29/2008

A Switch-based Network Switching Introduction

z Switches are connected by point-point links.

z Packets are forwarded hop-by-hop by the switches z Idea: forward units of data based on address in
towards the destination. header.
» Forwarding is based on the address z Many data-link technologies use switching.
z How does a switch work? » Virtual circuits: Frame Relay, ATM, X.25, ..
z How do nodes exchange packets over a link? » Packets:
P k t Eth Ethernet,t MPLS
MPLS, …
z How is the destination addressed? z “Switching” also happens at the network layer.
Point-Point » Layer 3: Internet protocol
Switch link » In this case, address is an IP address
PCs at » IP over SONET, IP over ATM, ..
Work PC at
Home » Otherwise, operation is very similar
z Switching is different from SONET mux/demux.
» SONET channels statically configured - no addresses

25 26

An Inter-network Internetworking Options

Host Host 7 7 7 7
6 6 6 6
5 5 5 5
Host Wireless Host 4 4 4 4
Host 3 3 3 data link 3
2 physical 2 2 2 2
1 1 1 1 1 1 1
Eth
Ethernet
t H
Host repeater
t Switching/bridging
S it hi /b id i
Host Ethernet Framerelay (e.g. 802 MAC)

Host
7 7 7 7
ATM IP/SONET 6 6 6 6
Host 5 5 5 5
4 network 4 4
... 4
3 3 3 3 3 3 3
Host Ethernet Host 802.X Host 2 2 2 2 2 2 2 2
Host 1 1 1 1 1 1 1 1
router gateway
Host Host
27 28

Packet Forwarding:
Switch Architecture Address Lookup

z Takes in packets in one Switch

interface and has to forward Control
them to an output interface Processor
based on the address.
Input Output
» A big intersection Port Port
» Same idea for bridges, switches,
routers: address look up differs Output Input
Port Port
z Control processor manages Switch
the switch and executes Fabric Address Next Hop Info
higher level protocols. Output Output z Address from header.
» E.g. routing, management, ..
Port Port B31123812508 3 13 » Absolute address (e.g. Ethernet)
Input Input 3 » (IP address for routers)
z The switch fabric directs the Port Port
38913C3C2137 -
traffic to the right output port. » (VC identifier, e.g. ATM))

z The input and output ports

A21023C90590 0 - z Next hop: output port for packet.
deal with transmission and z Info: priority, VC id, ..
reception of packets. z Table is filled in by routing protocol.
128.2.15.3 1 (2,34)
29 30

5
 1/29/2008

Link Flow Control and

Error Control A Naïve Protocol

z Naïve protocol. z Sender simply sends to the receiver whenever it has

z Dealing with receiver overflow: flow control. packets.
z Dealing with packet loss and corruption: error control. z Potential problem: sender can outrun the receiver.
» Receiver too slow, buffer overflow, ..
z Meta-comment: these issues are relevant at many
layers. z Not always a problem: receiver might be fast enough
enough.
» Link layer: sender and receiver attached to the same “wire”
» End-to-end: transmission control protocol (TCP) - sender and
receiver are the end points of a connection
z How can we implement flow control?
» “You may send” (windows, stop-and-wait, etc.)
» “Please shut up” (source quench, 802.3x pause frames, etc.)
» Where are each of these appropriate? Sender Receiver

31 32

Adding Flow Control Window Flow Control

z Stop and wait flow control: sender waits to send the z Stop and wait flow control results in poor throughput
next packet until the previous packet has been for long-delay paths: packet size/ roundtrip-time.
acknowledged by the receiver. z Solution: receiver provides sender with a window that
» Receiver can pace the receiver it can fill with packets.
» The window is backed up by buffer space on receiver
z Drawbacks: adds overheads, slowdown for long links.
» Receiver acknowledges the a packet every time a packet is
consumed and a buffer is freed

Sender Receiver Sender Receiver

33 34

Dealing with Errors

Bandwidth-Delay Product Stop and Wait Case

RTT z Packets can get lost, corrupted, or duplicated.

Sender » Error detection or correction turns corrupted packet in lost or
correct packet
z Duplicate packet: use sequence numbers.
z Lost packet: time outs and acknowledgements.
» Positive versus negative
g acknowledgements
g
» Sender side versus receiver side timeouts
z Window based flow control: more aggressive use of
sequence numbers (see transport lectures).
Receiver
Time

Window Size
Max Throughput = Sender Receiver
Roundtrip Time

35 36

6
 1/29/2008

What is Used in Practice? Datalink Layer Architectures

z No flow or error control.

» E.g. regular Ethernet, just uses CRC for error detection
z Flow control only.
» E.g.
g Gigabit
g Ethernet
z Flow and error control.
» E.g. X.25 (older connection-based service at 64 Kbs that
guarantees reliable in order delivery of data)
z Packet forwarding. z Media access
z Error and flow control. control.
z Scalability.

37 38

Datalink Classification Multiple Access Protocols

Datalink z Prevent two or more nodes from transmitting

at the same time over a broadcast channel.
» If they do, we have a collision, and receivers will not be
able to interpret the signal
Switch-based
Switch based Multiple Access
z S
Several
l classes
l off multiple
lti l access protocols.
t l
» Partitioning the channel, e.g. frequency-division or time
Virtual Packet Scheduled Random division multiplexing
Circuits Switching Access Access – With fixed partitioning of bandwidth –
– Not flexible; inefficient for bursty traffic
ATM, Bridged Token ring, Ethernet, » Taking turns, e.g. token-based, reservation-based
framerelay LANs FDDI, 802.11 802.11, Aloha protocols, polling based
» Contention based protocols, e.g. Aloha, Ethernet
– Next lecture

39 39 40

Fiber Distributed Data Interface Other “Taking Turn”

(FDDI) Protocols
z One token holder may send,
with a time limit z Central entity polls stations, inviting them to
» Provides known upper bound on
delay. transmit
» Simple design – no conflicts
z Optical version of 802.5 token
ring,
g but multiple packets may y » Not very efficient – overhead of polling operation
travel in train: token released » Example: the “Point Control Function” mode for 802.11
at end of frame z Stations reserve a slot for transmission.
z 100 Mbps, 100km » For example, break up the transmission time in
z Optional dual ring for fault contention-based and reservation based slots
tolerance – Contention based slots can be used for short
messages or to reserve time slots
z Concerns: – Communication in reservation based slots only
» Token overhead allowed after a reservation is made
» Latency » Issues: fairness, efficiency
» Single point of failure
41 42

7
 1/29/2008

MAC Protocols - Discussion

z Channel partitioning MAC protocols:

» Share channel efficiently at high load
» Inefficient at low load: delay in channel
access, 1/N bandwidth allocated even if
only 1 active node!
z “Taking turns” protocols
» More flexible bandwidth allocation, but
» Protocol can introduce unnecessary
overhead and access delay at low load
z Random access MAC protocols (next lecture)
» Efficient at low load: single node can fully
utilize channel
» High load: collision overhead
Lecture 7: 9-19-06 43 43