Chapter 5

Peer-to-Peer Protocols
and Data Link Layer
PART I: Peer-to-Peer Protocols
Peer-to-Peer Protocols and Service Models
ARQ Protocols and Reliable Data Transfer
Flow Control
Timing Recovery
TCP Reliable Stream Service & Flow Control
 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
PART II: Data Link Controls
Framing
Point-to-Point Protocol
High-Level Data Link Control
Link Sharing Using Statistical Multiplexing
Chapter Overview
 Peer-to-Peer protocols: many protocols involve the
interaction between two peers
 Service Models are discussed & examples given
 Detailed discussion of ARQ provides example of
development of peer-to-peer protocols
 Flow control, TCP reliable stream, and timing recovery
 Data Link Layer
 Framing
 PPP & HDLC protocols
 Statistical multiplexing for link sharing
 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
Peer-to-Peer Protocols and
Service Models
 Peer-to-Peer Protocols



 Peer-to-Peer processes
execute layer-n protocol
to provide service to
n + 1 peer process n + 1 peer process layer-(n+1)

 Layer-(n+1) peer calls

SDU SDU layer-n and passes
PDU Service Data Units
n peer process n peer process (SDUs) for transfer

 Layer-n peers exchange

Protocol Data Units
(PDUs) to effect transfer
n – 1 peer process n – 1 peer process
 Layer-n delivers SDUs to
destination layer-(n+1)
peer


Service Models
 The service model specifies the information transfer
service layer-n provides to layer-(n+1)
 The most important distinction is whether the
service is:
 Connection-oriented
 Connectionless
 Service model possible features:
 Arbitrary message size or structure
 Sequencing and Reliability
 Timing, Pacing, and Flow control
 Multiplexing
 Privacy, integrity, and authentication
Connection-Oriented Transfer
Service
 Connection Establishment
 Connection must be established between layer-(n+1) peers
 Layer-n protocol must: Set initial parameters, e.g. sequence numbers; and
Allocate resources, e.g. buffers
 Message transfer phase
 Exchange of SDUs
 Disconnect phase
 Example: TCP, PPP

n + 1 peer process n + 1 peer process

send receive

SDU Layer n connection-oriented service SDU

Connectionless Transfer Service
 No Connection setup, simply send SDU
 Each message send independently
 Must provide all address information per message
 Simple & quick
 Example: UDP, IP

n + 1 peer process n + 1 peer process

send receive

SDU Layer n connectionless service

Message Size and Structure
 What message size and structure will a
service model accept?
 Different services impose restrictions on size &
structure of data it will transfer
 Single bit? Block of bytes? Byte stream?
 Ex: Transfer of voice mail = 1 long message
 Ex: Transfer of voice call = byte stream

1 voice mail= 1 message = entire sequence of speech samples

(a)

1 call = sequence of 1-byte messages

(b)
Segmentation & Blocking
 To accommodate arbitrary message size, a layer may have
to deal with messages that are too long or too short for its
protocol
 Segmentation & Reassembly: a layer breaks long messages
into smaller blocks and reassembles these at the destination
 Blocking & Unblocking: a layer combines small messages
into bigger blocks prior to transfer

1 long message 2 or more short messages

2 or more blocks 1 block

Reliability & Sequencing
 Reliability: Are messages or information
stream delivered error-free and without loss
or duplication?
 Sequencing: Are messages or information
stream delivered in order?
 ARQ protocols combine error detection,
retransmission, and sequence numbering to
provide reliability & sequencing
 Examples: TCP and HDLC
Pacing and Flow Control
 Messages can be lost if receiving system
does not have sufficient buffering to store
arriving messages
 If destination layer-(n+1) does not retrieve its
information fast enough, destination layer-n
buffers may overflow
 Pacing & Flow Control provide backpressure
mechanisms that control transfer according to
availability of buffers at the destination
 Examples: TCP and HDLC
Timing
 Applications involving voice and video generate
units of information that are related temporally
 Destination application must reconstruct temporal
relation in voice/video units
 Network transfer introduces delay & jitter
 Timing Recovery protocols use timestamps &
sequence numbering to control the delay & jitter in
delivered information
 Examples: RTP & associated protocols in Voice
over IP
Multiplexing
 Multiplexing enables multiple layer-(n+1)
users to share a layer-n service
 A multiplexing tag is required to identify
specific users at the destination
 Examples: UDP, IP
Privacy, Integrity, &
Authentication
 Privacy: ensuring that information transferred
cannot be read by others
 Integrity: ensuring that information is not
altered during transfer
 Authentication: verifying that sender and/or
receiver are who they claim to be
 Security protocols provide these services and
are discussed in Chapter 11
 Examples: IPSec, SSL
End-to-End vs. Hop-by-Hop
 A service feature can be provided by implementing
a protocol
 end-to-end across the network
 across every hop in the network
 Example:
 Perform error control at every hop in the network or only
between the source and destination?
 Perform flow control between every hop in the network or
only between source & destination?
 We next consider the tradeoffs between the two
approaches
 Error control in Data Link Layer
Packets Packets
(a)
 Data Link operates
Data link Data link
over wire-like,
layer Frames layer directly-connected
A B systems
Physical Physical
layer layer  Frames can be
corrupted or lost, but
arrive in order
(b)
1 1  Data link performs
2 2
12 3 12 3
error-checking &
21 21
Medium retransmission
2  Ensures error-free
A B 1
packet transfer
1 Physical layer entity between two systems
2 Data link layer entity

3 Network layer entity

 Error Control in Transport Layer
 Transport layer protocol (e.g. TCP) sends segments across
network and performs end-to-end error checking &
retransmission
 Underlying network is assumed to be unreliable

Messages Messages

Transport Segments Transport

layer layer
Network Network Network Network
layer layer layer layer
Data link Data link Data link Data link
layer layer layer layer
End system End system
A Physical Physical Physical Physical
layer layer
B
layer layer

Network
 Segments can experience long delays, can be lost, or
arrive out-of-order because packets can follow different
paths across network
 End-to-end error control protocol more difficult

C
1 2 3 2 1
2 2
1 1

End System
α 1 1 End System
1 2
2 2 β
4 3 21 12 3 2 1 1 2 3 2 1 1 2 3 4
Medium
2
A B 1
Network

3 Network layer entity

4 Transport layer entity

 End-to-End Approach Preferred
Hop-by-hop
Hop-by-hop
cannot ensure
E2E correctness
Data Data Data Data
1 2 3 4 5 Faster recovery
ACK/ ACK/ ACK/ ACK/
NAK NAK NAK NAK

Simple
End-to-end
ACK/NAK
inside the
network

More scalable
1 2 3 4 5 if complexity at
Data Data Data Data the edge
 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
ARQ Protocols and Reliable
Data Transfer
Automatic Repeat Request (ARQ)
 Purpose: to ensure a sequence of information
packets is delivered in order and without errors or
duplications despite transmission errors & losses
 We will look at:
 Stop-and-Wait ARQ
 Go-Back N ARQ
 Selective Repeat ARQ
 Basic elements of ARQ:
 Error-detecting code with high error coverage
 ACKs (positive acknowledgments
 NAKs (negative acknowlegments)
 Timeout mechanism
Stop-and-Wait ARQ
Transmit a frame, wait for ACK
Error-free
Packet
packet
Information frame
Transmitter Receiver
Timer set after (Process A) (Process B)
each frame
transmission Control frame

Header
CRC
Information Header
packet CRC
Information frame Control frame: ACKs
Need for Sequence Numbers
(a) Frame 1 lost Time-out
Time
A Frame Frame Frame Frame
0 1 1 2
ACK ACK
B

(b) ACK lost Time-out

Time
A Frame Frame Frame Frame
0 1 1 2
ACK ACK ACK
B
 In cases (a) & (b) the transmitting station A acts the same way
 But in case (b) the receiving station B accepts frame 1 twice
 Question: How is the receiver to know the second frame is also frame 1?
 Answer: Add frame sequence number in header
 Slast is sequence number of most recent transmitted frame
Sequence Numbers
(c) Premature Time-out

Time-out
Time
A Frame
0 Frame Frame Frame
ACK 0 1 2
ACK
B

 The transmitting station A misinterprets duplicate ACKs

 Incorrectly assumes second ACK acknowledges Frame 1
 Question: How is the receiver to know second ACK is for frame 0?
 Answer: Add frame sequence number in ACK header
 Rnext is sequence number of next frame expected by the receiver
 Implicitly acknowledges receipt of all prior frames
1-Bit Sequence Numbering
Suffices
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1

Slast Rnext
Timer

Transmitter Slast Receiver

A B
Rnext

Global State: Error-free frame 0

(Slast, Rnext) (0,0) (0,1)
arrives at receiver
ACK for
ACK for frame 0
frame 1 arrives at
arrives at transmitter
transmitter Error-free frame 1
arrives at receiver
(1,0) (1,1)
Stop-and-Wait ARQ
Transmitter Receiver
Ready state Always in Ready State
 Await request from higher layer for  Wait for arrival of new frame
packet transfer  When frame arrives, check for errors
 When request arrives, transmit  If no errors detected and sequence
frame with updated Slast and CRC number is correct (Slast=Rnext), then
 Go to Wait State  accept frame,
Wait state  update Rnext,
 Wait for ACK or timer to expire;  send ACK frame with Rnext,
block requests from higher layer  deliver packet to higher layer
 If timeout expires  If no errors detected and wrong
 retransmit frame and reset timer sequence number
 If ACK received:
 discard frame
 If sequence number is incorrect or if
 send ACK frame with Rnext
errors detected: ignore ACK  If errors detected
 If sequence number is correct (Rnext =  discard frame
Slast +1): accept frame, go to Ready
state
Applications of Stop-and-Wait
ARQ
 IBM Binary Synchronous Communications
protocol (Bisync): character-oriented data
link control
 Xmodem: modem file transfer protocol
 Trivial File Transfer Protocol (RFC 1350):
simple protocol for file transfer over UDP
Stop-and-Wait Efficiency
Last frame bit ACK
First frame bit enters channel arrives
enters channel Channel idle while transmitter
waits for ACK

A t

B t

First frame bit Receiver

arrives at Last frame bit processes frame
receiver arrives at and
receiver prepares ACK
 10000 bit frame @ 1 Mbps takes 10 ms to transmit
 If wait for ACK = 1 ms, then efficiency = 10/11= 91%
 If wait for ACK = 20 ms, then efficiency =10/30 = 33%
Stop-and-Wait Model
t0 = total time to transmit 1 frame
A
tproc

B
frame
tprop tproc tack tprop
tf time

t0  2t prop  2t proc  t f  t ack bits/info frame

nf na bits/ACK frame
 2t prop  2t proc  
R R

channel transmission rate

 S&W Efficiency on Error-free
channel
Effective transmission rate: bits for header & CRC

number of information bits delivered to destination n f  no

R 0
eff   ,
total time required to deliver the information bits t0

Transmission efficiency:
Effect of
n f  no no
1 frame overhead
Reff t0 nf
0    .
R R na 2(t prop  t proc ) R
1 
nf nf

Effect of
Effect of
Delay-Bandwidth Product
ACK frame
Example: Impact of Delay-
Bandwidth Product
nf=1250 bytes = 10000 bits, na=no=25 bytes = 200 bits
2xDelayxBW 1 ms 10 ms 100 ms 1 sec
Efficiency
200 km 2000 km 20000 km 200000 km
1 Mbps 103 104 105 106
88% 49% 9% 1%
1 Gbps 106 107 108 109
1% 0.1% 0.01% 0.001%

Stop-and-Wait does not work well for very high speeds or long propagation
delays
S&W Efficiency in Channel with
Errors
 Let 1 – Pf = probability frame arrives w/o errors
 Avg. # of transmissions to first correct arrival is then 1/ (1–Pf )
 “If 1-in-10 get through without error, then avg. 10 tries to success”
 Avg. Total Time per frame is then t0/(1 – Pf)

n f  no
t0 no
1
Reff 1  Pf nf
 SW    (1  Pf )
R R na 2(t prop  t proc ) R
1 
nf nf
Effect of
frame loss
 Example: Impact Bit Error Rate
nf=1250 bytes = 10000 bits, na=no=25 bytes = 200 bits
Find efficiency for random bit errors with p=0, 10-6, 10-5, 10-4
nf n f p
1  Pf  (1  p ) e for large n f and small p

1 – Pf 0 10-6 10-5 10-4

Efficiency
1 Mbps 1 0.99 0.905 0.368
& 1 ms 88% 86.6% 79.2% 32.2%

Bit errors impact performance as nfp approach 1

Go-Back-N
 Improve Stop-and-Wait by not waiting!
 Keep channel busy by continuing to send frames
 Allow a window of up to Ws outstanding frames
 Use m-bit sequence numbering
 If ACK for oldest frame arrives before window is
exhausted, we can continue transmitting
 If window is exhausted, pull back and retransmit all
outstanding frames
 Alternative: Use timeout
 Go-Back-N ARQ
Go-Back-4: 4 frames are outstanding; so go back 4

fr fr fr fr fr fr fr fr fr fr fr fr fr fr Time
0 1 2 3 4 5 6 3 4 5 6 7 8 9
A

B
A A A out of sequence A A A A A A
C C C frames C C C C C C
K K K K K K K K K
1 2 3 4 5 6 7 8 9

Rnext 0 1 2 3 3 4 5 6 7 8 9
 Frame transmission are pipelined to keep the channel busy
 Frame with errors and subsequent out-of-sequence frames are ignored
 Transmitter is forced to go back when window of 4 is exhausted
Window size long enough to cover round trip time
Time-out expires
Stop-and-Wait ARQ
fr fr fr Time
0 0 1
A

B
Receiver is A
looking for C
K
Rnext=0
1

Go-Back-N ARQ Four frames are outstanding; so go back 4

fr fr fr fr fr fr fr fr fr fr fr
0
Time
1 2 3 0 1 2 3 4 5 6
A

B A A
A A A A
Receiver is Out-of- C C
C C C C
looking for sequence K K K K K K
Rnext=0 frames 1 2 3 4 5 6
Go-Back-N with Timeout
 Problem with Go-Back-N as presented:
 If frame is lost and source does not have frame to
send, then window will not be exhausted and
recovery will not commence
 Use a timeout with each frame
 When timeout expires, resend all outstanding
frames
 Go-Back-N Transmitter & Receiver
Transmitter Receiver

Send Window
... Receive Window

Frames
transmitted S
last Srecent Slast+Ws-1
and ACKed
Frames
Buffers Rnext
received
oldest un-
Timer Slast
ACKed frame
Timer Slast+1 Receiver will only accept
... a frame that is error-free and
that has sequence number Rnext
Timer
Srecent most recent
transmission
When such frame arrives Rnext is
...
incremented by one, so the
Slast+Ws-1 max Seq # receive window slides forward by
allowed one
 Sliding Window Operation
Transmitter

Send Window m-bit Sequence Numbering

...

Frames
transmitted S 0
and ACKed
last Srecent Slast+Ws-1 2 –1
m
1

2
Transmitter waits for error-free
ACK frame with sequence
number Slast Slast
send
When such ACK frame arrives, i
Slast is incremented by one, and
window
the send window slides forward i + Ws – 1 i+1
by one
Maximum Allowable Window Size is Ws = 2m-1
M = 22 = 4, Go-Back - 4: Transmitter goes back 4
fr fr fr fr fr fr fr fr Time
A 0 1 2 3 0 1 2 3

A A A A
B C C C C Receiver has Rnext= 0, but it does not
K K K K
1 2 3 0
know whether its ACK for frame 0 was
received, so it does not know whether
Rnext 0 1 2 3 0 this is the old frame 0 or a new frame 0

M = 22 = 4, Go-Back-3: Transmitter goes back 3

fr fr fr fr fr fr Time
A 0 1 2 0 1 2

A A A
B C C C
K K K Receiver has Rnext= 3 , so it
1 2 3
rejects the old frame 0
Rnext 0 1 2 3
ACK Piggybacking in Bidirectional GBN
SArecent RA next
Transmitter Receiver
Receiver Transmitter
S B
recent R
B
next

“A” Receive Window “B” Receive Window

RA next RB next
“A” Send Window “B” Send Window
... ...

SA last SA last+WA s-1 SB last SB last+WB s-1

Buffers Buffers
Timer SA last Timer SB last

Timer SA last+1 Note: Out-of- Timer SBlast+1

... ...
sequence error-free
Timer SArecent Timer SBrecent
...
frames discarded
...
after Rnext examined
Timer S +WA s-1
A
last Timer SB last+WB s-1
Applications of Go-Back-N ARQ
 HDLC (High-Level Data Link Control): bit-
oriented data link control
 V.42 modem: error control over telephone
modem links
Required Timeout & Window Size
Tout
Tproc

Tprop Tf Tf Tprop

 Timeout value should allow for:

 Two propagation times + 1 processing time: 2 Tprop + Tproc
 A frame that begins transmission right before our frame arrives Tf
 Next frame carries the ACK, Tf
 Ws should be large enough to keep channel busy for Tout
Required Window Size for
Delay-Bandwidth Product

Frame = 1250 bytes =10,000 bits, R = 1 Mbps

2(tprop + tproc) 2 x Delay x BW Window

1 ms 1000 bits 1

10 ms 10,000 bits 2

100 ms 100,000 bits 11

1 second 1,000,000 bits 101

Efficiency of Go-Back-N
 GBN is completely efficient, if Ws large enough to keep channel
busy, and if channel is error-free
 Assume Pf frame loss probability, then time to deliver a frame is:
 tf if first frame transmission succeeds (1 – Pf )
 Tf + Wstf /(1-Pf) if the first transmission does not succeed Pf

Ws t f Ws t f
tGBN  t f (1  Pf )  Pf {t f  }  t f  Pf and
1  Pf 1  Pf
n f  no no
1
tGBN nf
GBN   (1  Pf )
R 1  (Ws  1) Pf

Delay-bandwidth product determines Ws

 Example: Impact Bit Error Rate on
GBN
nf=1250 bytes = 10000 bits, na=no=25 bytes = 200 bits
Compare S&W with GBN efficiency for random bit errors with p = 0, 10-6, 10-5, 10-4 and R = 1 Mbps & 100 ms
1 Mbps x 100 ms = 100000 bits = 10 frames → Use Ws = 11

Efficiency 0 10-6 10-5 10-4

S&W 8.9% 8.8% 8.0% 3.3%

GBN 98% 88.2% 45.4% 4.9%

 Go-Back-N significant improvement over Stop-and-Wait for large delay-bandwidth product

 Go-Back-N becomes inefficient as error rate increases
Selective Repeat ARQ
 Go-Back-N ARQ inefficient because multiple frames
are resent when errors or losses occur
 Selective Repeat retransmits only an individual frame
 Timeout causes individual corresponding frame to be resent
 NAK causes retransmission of oldest un-acked frame
 Receiver maintains a receive window of sequence
numbers that can be accepted
 Error-free, but out-of-sequence frames with sequence
numbers within the receive window are buffered
 Arrival of frame with Rnext causes window to slide forward by
1 or more
Selective Repeat ARQ

fr fr fr fr fr fr fr fr fr fr fr fr fr fr Time
0 1 2 3 4 5 6 2 7 8 9 10 11 12
A

B
A A N A A A A A A A A A
C C A C C C C C C C C C
K K K K K K K K K K K K
1 2 2 2 2 2 7 8 9 1 1 1
0 1 2
Selective Repeat ARQ
Transmitter Receiver

Send Window Receive Window

...

Frames Frames
transmitted S received Rnext Rnext + Wr-1
last Srecent Slast+ Ws-1
and ACKed

Buffers Buffers
Timer Slast Rnext+ 1
Timer Slast+ 1 Rnext+ 2
...
Timer
Srecent ...
Rnext+ Wr- 1 max Seq #
... accepted
Slast+ Ws - 1
 Send & Receive Windows
Transmitter Receiver

0 0
2 -1
m
1 2 -1
m
1

2 2
Rnext
Slast
send receive j
window i window
i
i + Ws – 1 i+1
j + Wr – 1
Moves k forward when ACK Moves forward by 1 or more
arrives with Rnext = Slast + k when frame arrives with
k = 1, …, Ws-1 Seq. # = Rnext
 What size Ws and Wr allowed?
 Example: M=22=4, Ws=3, Wr=3
Frame 0 resent
Send
{0,1,2} {1,2} {2} {.}
Window
fr0 fr1 fr2 fr0
A Time

B ACK1 ACK2 ACK3

Receive
{0,1,2} {1,2,3} {2,3,0} {3,0,1}
Window
Old frame 0 accepted as a
new frame because it falls
in the receive window
 Ws + Wr = 2m is maximum allowed
 Example: M=22=4, Ws=2, Wr=2
Frame 0 resent
Send
{0,1} {1} {.}
Window
fr0 fr1 fr0
A Time

B ACK1 ACK2
Receive
{0,1} {1,2} {2,3}
Window
Old frame 0 rejected because it
falls outside the receive window
 Why Ws + Wr = 2m works
 Transmitter sends frames 0  Receiver window starts at {0, …, Wr}
to Ws-1; send window empty
 All arrive at receiver
 Window slides forward to {Ws,
…,Ws+Wr-1}
 All ACKs lost
 Receiver rejects frame 0 because it is outside receive
window
 Transmitter resends frame 0

0 0
2m-1 1 2 -1
m
1

Slast Ws +Wr-1 2
2

receive Rnext Ws
send window
window Ws-1
Applications of Selective Repeat
ARQ
 TCP (Transmission Control Protocol):
transport layer protocol uses variation of
selective repeat to provide reliable stream
service
 Service Specific Connection Oriented
Protocol: error control for signaling
messages in ATM networks
Efficiency of Selective Repeat
 Assume Pf frame loss probability, then number of
transmissions required to deliver a frame is:
 tf / (1-Pf)

n f  no
t f /(1  Pf ) no
 SR   (1  )(1  Pf )
R nf
 Example: Impact Bit Error Rate on
Selective Repeat
nf=1250 bytes = 10000 bits, na=no=25 bytes = 200 bits
Compare S&W, GBN & SR efficiency for random bit errors with p=0, 10-6, 10-5, 10-4 and R= 1
Mbps & 100 ms

Efficiency 0 10-6 10-5 10-4

S&W 8.9% 8.8% 8.0% 3.3%

GBN 98% 88.2% 45.4% 4.9%

SR 98% 97% 89% 36%

 Selective Repeat outperforms GBN and S&W, but efficiency drops as error
rate increases
 Comparison of ARQ Efficiencies
Assume na and no are negligible relative to nf, and
L = 2(tprop+tproc)R/nf =(Ws-1), then
Selective-Repeat:
no
 SR  (1  Pf )(1  )  (1  Pf )
nf
Go-Back-N: For Pf≈0, SR & GBN same
1  Pf 1  Pf
GBN  
1  (WS  1) Pf 1  LPf
For Pf→1, GBN & SW same
Stop-and-Wait:
(1  Pf ) 1  Pf
 SW  
n 2(t  t ) R 1 L
1  a  prop proc
nf nf
ARQ Efficiencies
ARQ Efficiency Com parison
Selective
1.5 Repeat
Go Back N 10
Efficiency

0.5 Stop and Wait

100
0 Go Back N 100
-9-9 10
10 -8-8 10
-7-7 10-6-6 10-5
-5 -4
10 -4 -3
10-3 10-2
-2
10-1
-1

- LOG(p)
p Stop and Wait
10

Delay-Bandwidth product = 10, 100

 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
Flow Control
Flow Control
buffer fill
Information frame
Transmitter
Receiver

Control frame

 Receiver has limited buffering to store arriving

frames
 Several situations cause buffer overflow
 Mismatch between sending rate & rate at which user can
retrieve data
 Surges in frame arrivals
 Flow control prevents buffer overflow by regulating
rate at which source is allowed to send information
 X ON / X OFF
threshold
Information frame
Transmitter
Receiver

Transmit X OFF Transmit

Time
A

on off on off

B Time

2Tprop

Threshold must activate OFF signal while 2 Tprop R bits still

remain in buffer
 Window Flow Control
Return of permits
tcycle
A
Time

B
Time
 Sliding Window ARQ method with Ws equal to buffer available
 Transmitter can never send more than Ws frames
 ACKs that slide window forward can be viewed as permits to transmit
more
 Can also pace ACKs as shown above
 Return permits (ACKs) at end of cycle regulates transmission rate
 Problems using sliding window for both error & flow control
 Choice of window size
 Interplay between transmission rate & retransmissions
 TCP separates error & flow control
 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
Timing Recovery
 Timing Recovery for Synchronous
Services
Synchronous source Network output
sends periodic not periodic
information blocks

Network

 Applications that involve voice, audio, or video can generate a

synchronous information stream
 Information carried by equally-spaced fixed-length packets
 Network multiplexing & switching introduces random delays
 Packets experience variable transfer delay
 Jitter (variation in interpacket arrival times) also introduced
 Timing recovery re-establishes the synchronous nature of the stream
 Introduce Playout Buffer
Packet Arrivals Packet Playout
Playout
Buffer

Packet Arrivals

Sequence numbers help order

packets
Packet Playout

Tmax
• Delay first packet by maximum network delay
• All other packets arrive with less delay
• Playout packet uniformly thereafter
 Arrival times
Time
Playout clock must
Send
be synchronized to times Receiver too
transmitter clock Playout slow;
times buffer fills and
overflows

Tplayout time

Receiver too fast Receiver speed

Time buffer starvation Time just right

Many late
packets

Tplayout time Tplayout time

 Clock Recovery
Timestamps inserted in Buffer for information blocks
packet payloads
indicate when info was
Playout
produced command
Error
signal
+ Smoothing Adjust
Add frequency
filter
t4 t3 t2 t1 Recovered
-
Timestamps clock

Counter

 Counter attempts to replicate transmitter clock

 Frequency of counter is adjusted according to arriving timestamps
 Jitter introduced by network causes fluctuations in buffer & in local clock
 Synchronization to a Common
Clock
Transmitter Receiver

M M
fs Network fr

M=#ticks in local clock

In time that net clock f=fn-fs=fn-(M/N)fn
does N ticks fn
fn/fs=N/M N ticks N ticks fr=fn-f
Network clock

 Clock recovery simple if a common clock is available to transmitter &

receiver
 E.g. SONET network clock; Global Positioning System (GPS)
 Transmitter sends f of its frequency & network frequency
 Receiver adjusts network frequency by f
 Packet delay jitter can be removed completely
Example: Real-Time Protocol
 RTP (RFC 1889) designed to support real-
time applications such as voice, audio, video
 RTP provides means to carry:
 Type of information source
 Sequence numbers
 Timestamps
 Actual timing recovery must be done by
higher layer protocol
 MPEG2 for video, MP3 for audio
 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
TCP Reliable Stream Service &
Flow Control
 TCP Reliable Stream Service
TCP transfers byte
Application Layer stream in order, without Application Layer reads
writes bytes into send bytes from receive buffer
buffer through socket
errors or duplications
through socket
Write 45 bytes
Write 15 bytes Read 40 bytes
Application layer Write 20 bytes Read 40 bytes
Transport layer
Segments

Transmitter Receiver
Send buffer Receive buffer
ACKs
 TCP ARQ Method
• TCP uses Selective Repeat ARQ
• Transfers byte stream without preserving boundaries
• Operates over best effort service of IP
• Packets can arrive with errors or be lost
• Packets can arrive out-of-order
• Packets can arrive after very long delays
• Duplicate segments must be detected & discarded
• Must protect against segments from previous connections
• Sequence Numbers
• Seq. # is number of first byte in segment payload
• Very long Seq. #s (32 bits) to deal with long delays
• Initial sequence numbers negotiated during connection setup
(to deal with very old duplicates)
• Accept segments within a receive window
 Transmitter Receiver

Send Window Receive Window

Slast + Wa-1 Rlast Rlast + WR – 1

... ... ...

octets Rnext Rnew

S Srecent Slast + Ws – 1
transmitted last
& ACKed

Slast oldest unacknowledged byte Rlast highest-numbered byte not

Srecent highest-numbered yet read by the application
Rnext next expected byte
transmitted byte
Slast+Wa-1 highest-numbered byte Rnew highest numbered byte
that can be transmitted received correctly
Slast+Ws-1 highest-numbered byte Rlast+WR-1 highest-numbered byte
that can be accepted from the that can be accommodated in
application receive buffer
TCP Connections
 TCP Connection
 One connection each way
 Identified uniquely by Send IP Address, Send TCP Port #,
Receive IP Address, Receive TCP Port #
 Connection Setup with Three-Way Handshake
 Three-way exchange to negotiate initial Seq. #’s for
connections in each direction
 Data Transfer
 Exchange segments carrying data
 Graceful Close
 Close each direction separately
 Three Phases of TCP Connection
Host A S Y N , S e q_ Host B
no = x

= x +1
n o = y , A C K, Ack_no
Three-way SYN, Seq_
Handshake Seq_no = x+1,
ACK, Ack_no =
y+ 1

Data Transfer
FIN, Seq_no =
w

w +1
ACK, Ack_no =
Graceful
Close Data Transfer =z
FIN, Seq_no
ACK, Ack_no = z+1
1st Handshake: Client-Server
Connection Request

Initial Seq. # from

client to server

SYN bit set indicates request to

establish connection from client to
server
2nd Handshake: ACK from Server

ACK Seq. # =
Init. Seq. # + 1

ACK bit set acknowledges

connection request; Client-
to-Server connection
established
2nd Handshake: Server-Client
Connection Request

Initial Seq. # from

server to client

SYN bit set indicates request to

establish connection from server
to client
3rd Handshake: ACK from Client

ACK Seq. # =
Init. Seq. # + 1

ACK bit set acknowledges

connection request;
Connections in both
directions established
TCP Data Exchange
 Application Layers write bytes into buffers
 TCP sender forms segments
 When bytes exceed threshold or timer expires
 Upon PUSH command from applications
 Consecutive bytes from buffer inserted in payload
 Sequence # & ACK # inserted in header
 Checksum calculated and included in header
 TCP receiver
 Performs selective repeat ARQ functions
 Writes error-free, in-sequence bytes to receive
buffer
Data Transfer: Server-to-Client
Segment

12 bytes of payload
Push set

12 bytes of payload
carries telnet option
negotiation
Graceful Close: Client-to-Server
Connection

Client initiates closing

of its connection to
server
Graceful Close: Client-to-Server
Connection

ACK Seq. # =
Previous Seq. # + 1
Server ACKs request; client-
to-server connection closed
 Flow Control
 TCP receiver controls rate at which sender transmits to prevent buffer overflow
 TCP receiver advertises a window size specifying number of bytes that can be
accommodated by receiver
WA = WR – (Rnew – Rlast)
 TCP sender obliged to keep # outstanding bytes below W A
(Srecent - Slast) ≤ WA

Send Window Receive Window

Slast + WA-1
WA
... ... ...

Rlast Rnew Rlast + WR – 1

Slast Srecent Slast + Ws – 1
TCP window flow control
Host A Host B

ta
4 8, No Da t0
20 00 , Win = 20
_no =
= 1, A c k
Seq_no

Seq_no =
t1 20 00, Ack_n
o = 1, Win =
1024, Dat
a = 2000-30
Seq_no = 23
t2 30 24, Ack_n
o = 1, Win =
1024, Data
= 3024-40
47
= 1-128
12, Data t3
, Win = 5
, Ac k _ n o = 4048
Seq_ no = 1

Seq_no =
4048, Ack
t4 _no = 129
, Win = 102
4 , Data = 4
048-4559
 TCP Retransmission Timeout
 TCP retransmits a segment after timeout period
 Timeout too short: excessive number of retransmissions
 Timeout too long: recovery too slow
 Timeout depends on RTT: time from when segment is sent to
when ACK is received
 Round trip time (RTT) in Internet is highly variable
 Routes vary and can change in mid-connection
 Traffic fluctuates
 TCP uses adaptive estimation of RTT
 Measure RTT each time ACK received: n

tRTT(new) = tRTT(old) + (1 – ) n

 typical
RTT Variability
 Estimate variance 2 of RTT variation
 Estimate for timeout:
tout = tRTT + k RTT
 If RTT highly variable, timeout increase accordingly
 If RTT nearly constant, timeout close to RTT estimate

 Approximate estimation of deviation

dRTT(new) = dRTT(old) + (1-) | n - tRTT |

tout = tRTT + 4 dRTT

 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
PART II: Data Link Controls
Framing
Point-to-Point Protocol
High-Level Data Link Control
Link Sharing Using Statistical Multiplexing
 Data Link Protocols
Packets Packets Data Links Services
 Framing
Data link Data link  Error control
layer Frames layer  Flow control
A B
Physical Physical  Multiplexing
layer layer
 Link Maintenance
 Security: Authentication &
Encryption

Examples
 Directly connected, wire-like  PPP
 Losses & errors, but no out-of-  HDLC
sequence frames
 Ethernet LAN
 Applications: Direct Links;
 IEEE 802.11 (Wi Fi) LAN
LANs; Connections across
WANs
 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
Framing
Framing
transmitted received
 Mapping stream of
frames frames physical layer bits into
frames
 Mapping frames into
Framing bit stream
 Frame boundaries can
be determined using:
 Character Counts
0110110111
0111110101

 Control Characters
 Flags
 CRC Checks
 Character-Oriented Framing
Data to be sent
A DLE B ETX DLE STX E
After stuffing and framing
DLE STX A DLE DLE B ETX DLE DLE STX E DLE ETX
 Frames consist of integer number of bytes
 Asynchronous transmission systems using ASCII to transmit printable
characters
 Octets with HEX value <20 are nonprintable
 Special 8-bit patterns used as control characters
 STX (start of text) = 0x02; ETX (end of text) = 0x03;
 Byte used to carry non-printable characters in frame
 DLE (data link escape) = 0x10
 DLE STX (DLE ETX) used to indicate beginning (end) of frame
 Insert extra DLE in front of occurrence of DLE STX (DLE ETX) in frame
 All DLEs occur in pairs except at frame boundaries
Framing & Bit Stuffing
HDLC frame

Flag Address Control Information FCS Flag

any number of bits

 Frame delineated by flag character

 HDLC uses bit stuffing to prevent occurrence of flag
01111110 inside the frame
 Transmitter inserts extra 0 after each consecutive
five 1s inside the frame
 Receiver checks for five consecutive 1s
 if next bit = 0, it is removed
 if next two bits are 10, then flag is detected
 If next two bits are 11, then frame has errors
Example: Bit stuffing & de-
stuffing
(a) Data to be sent

0110111111111100
After stuffing and framing

0111111001101111101111100001111110

(b) Data received

01111110000111011111011111011001111110
After destuffing and deframing

*000111011111-11111-110*
 PPP Frame
Flag Address Control Protocol Information Flag
CRC
01111110 1111111 00000011 01111110

integer # of bytes

All stations are to Unnumbered Specifies what kind of packet is contained in the
accept the frame frame payload, e.g., LCP, NCP, IP, OSI CLNP, IPX

 PPP uses similar frame structure as HDLC, except

 Protocol type field
 Payload contains an integer number of bytes
 PPP uses the same flag, but uses byte stuffing
 Problems with PPP byte stuffing
 Size of frame varies unpredictably due to byte insertion
 Malicious users can inflate bandwidth by inserting 7D & 7E
Byte-Stuffing in PPP
 PPP is character-oriented version of HDLC
 Flag is 0x7E (01111110)
 Control escape 0x7D (01111101)
 Any occurrence of flag or control escape inside of frame is
replaced with 0x7D followed by
original octet XORed with 0x20 (00100000)

Data to be sent
41 7D 42 7E 50 70 46

7E 41 7D 5D 42 7D 5E 50 70 46 7E
After stuffing and framing
Generic Framing Procedure
GFP payload area

2 2 2 2 0-60
PLI cHEC Type tHEC GEH GFP payload

Payload Core Payload Type GFP GFP

length header type header extension payload
indicator error error headers
checking checking

 GFP combines frame length indication with CRC

 PLI indicated length of frame, then simply count characters
 cHEC (CRC-16) protects against errors in count field (single-bit
error correction + error detection)
 GFP designed to operate over octet-synchronous physical
layers (e.g. SONET)
 Frame-mapped mode for variable-length payloads: Ethernet
 Transparent mode carries fixed-length payload: storage devices
GFP Synchronization &
Scrambling
 Synchronization in three-states
 Hunt state: examine 4-bytes to see if CRC ok
 If no, move forward by one-byte
 If yes, move to pre-sync state
 Pre-sync state: tentative PLI indicates next frame
 If N successful frame detections, move to sync state
 If no match, go to hunt state
 Sync state: normal state
 Validate PLI/cHEC, extract payload, go to next frame
 Use single-error correction
 Go to hunt state if non-correctable error
 Scrambling
 Payload is scrambled to prevent malicious users from inserting
long strings of 0s which cause SONET equipment to lose bit
clock synchronization (as discussed in line code section)
 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
Point-to-Point Protocol
PPP: Point-to-Point Protocol
 Data link protocol for point-to-point lines in Internet
 Router-router; dial-up to router
1. Provides Framing and Error Detection
 Character-oriented HDLC-like frame structure
2. Link Control Protocol
 Bringing up, testing, bringing down lines; negotiating
options
 Authentication: key capability in ISP access
3. A family of Network Control Protocols specific to
different network layer protocols
 IP, OSI network layer, IPX (Novell), Appletalk
PPP Applications
PPP used in many point-to-point applications
 Telephone Modem Links 30 kbps
 Packet over SONET 600 Mbps to 10 Gbps
 IP→PPP→SONET

 PPP is also used over shared links such as

Ethernet to provide LCP, NCP, and
authentication features
 PPP over Ethernet (RFC 2516)
 Used over DSL
PPP Frame Format

1 or 2 variable 2 or 4
Flag Address Control Protocol Information Flag
FCS
01111110 1111111 00000011 01111110

CRC 16 or
All stations are to
CRC 32
accept the frame

HDLC
Unnumbered frame

• PPP can support multiple network protocols simultaneously

• Specifies what kind of packet is contained in the payload
•e.g. LCP, NCP, IP, OSI CLNP, IPX...
PPP Example
 PPP Phases
1. Carrier Home PC to Internet Service
Dead Provider
7. Carrier detected
1. PC calls router via modem
dropped 2. PC and router exchange LCP
packets to negotiate PPP
Failed parameters
Terminate Establish
3. Check on identities
2. Options 4. NCP packets exchanged to
6. Done negotiated configure the network layer, e.g.
TCP/IP ( requires IP address
Failed assignment)
5. Open Authenticate 5. Data transport, e.g. send/receive
IP packets
6. NCP used to tear down the
3. Authentication network layer connection (free up
4. NCP completed IP address); LCP used to shut
configuration Network down data link layer connection
7. Modem hangs up
PPP Authentication
 Password Authentication Protocol
 Initiator must send ID & password
 Authenticator replies with authentication success/fail
 After several attempts, LCP closes link
 Transmitted unencrypted, susceptible to eavesdropping
 Challenge-Handshake Authentication Protocol
(CHAP)
 Initiator & authenticator share a secret key
 Authenticator sends a challenge (random # & ID)
 Initiator computes cryptographic checksum of random # &
ID using the shared secret key
 Authenticator also calculates cryptocgraphic checksum &
compares to response
 Authenticator can reissue challenge during session
Example: PPP connection setup
in dialup modem to ISP

LCP
Setup
PAP
IP NCP
setup
 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
High-Level Data Link Control
High-Level Data Link Control
(HDLC)
 Bit-oriented data link control
 Derived from IBM Synchronous Data Link
Control (SDLC)
 Related to Link Access Procedure Balanced
(LAPB)
 LAPD in ISDN
 LAPM in cellular telephone signaling
 NLPDU Network
Network
layer layer
“Packet”

DLSDU DLSAP DLSAP DLSDU

DLPDU
Data link
Data link
layer
layer
“Frame”

Physical Physical
layer layer
HDLC Data Transfer Modes
 Normal Response Mode
 Used in polling multidrop lines
Commands
Primary
Responses

Secondary Secondary Secondary

 Asynchronous Balanced Mode

 Used in full-duplex point-to-point links

Primary Commands Responses Secondary

Secondary Responses Commands Primary

 Mode is selected during connection establishment

HDLC Frame Format

Flag Address Control Information FCS Flag

 Control field gives HDLC its functionality

 Codes in fields have specific meanings and uses
 Flag: delineate frame boundaries
 Address: identify secondary station (1 or more octets)
 In ABM mode, a station can act as primary or secondary so
address changes accordingly
 Control: purpose & functions of frame (1 or 2 octets)
 Information: contains user data; length not standardized, but
implementations impose maximum
 Frame Check Sequence: 16- or 32-bit CRC
 Control Field Format
Information Frame
1 2-4 5 6-8
0 N(S) P/F N(R)

Supervisory Frame

1 0 S S P/F N(R)

Unnumbered Frame

1 1 M M P/F M M M

 S: Supervisory Function Bits  M: Unnumbered Function Bits

 N(R): Receive Sequence Number  P/F: Poll/final bit used in interaction
 N(S): Send Sequence Number between primary and secondary
Information frames
 Each I-frame contains sequence number N(S)
 Positive ACK piggybacked
 N(R)=Sequence number of next frame expected
acknowledges all frames up to and including N(R)-1
 3 or 7 bit sequence numbering
 Maximum window sizes 7 or 127
 Poll/Final Bit
 NRM: Primary polls station by setting P=1; Secondary
sets F=1 in last I-frame in response
 Primaries and secondaries always interact via paired P/F
bits
Error Detection & Loss Recovery
 Frames lost due to loss-of-synch or receiver buffer
overflow
 Frames may undergo errors in transmission
 CRCs detect errors and such frames are treated as
lost
 Recovery through ACKs, timeouts & retransmission
 Sequence numbering to identify out-of-sequence &
duplicate frames
 HDLC provides for options that implement several
ARQ methods
Supervisory frames
Used for error (ACK, NAK) and flow control (Don’t Send):
 Receive Ready (RR), SS=00
 ACKs frames up to N(R)-1 when piggyback not available
 REJECT (REJ), SS=01
 Negative ACK indicating N(R) is first frame not received
correctly. Transmitter must resend N(R) and later frames
 Receive Not Ready (RNR), SS=10
 ACKs frame N(R)-1 & requests that no more I-frames be sent
 Selective REJECT (SREJ), SS=11
 Negative ACK for N(R) requesting that N(R) be selectively
retransmitted
Unnumbered Frames
 Setting of Modes:
 SABM: Set Asynchronous Balanced Mode
 UA: acknowledges acceptance of mode setting commands
 DISC: terminates logical link connectio
 Information Transfer between stations
 UI: Unnumbered information
 Recovery used when normal error/flow control fails
 FRMR: frame with correct FCS but impossible semantics
 RSET: indicates sending station is resetting sequence
numbers
 XID: exchange station id and characteristics
Connection Establishment &
Release
 Supervisory frames used to establish and release data link
connection
 In HDLC
 Set Asynchronous Balanced Mode (SABM)
 Disconnect (DISC)
 Unnumbered Acknowledgment (UA)

SABM UA
Data UA
transfer DISC
 Example: HDLC using NRM
(polling)Address of secondary
Primary A Secondaries B, C
A polls B B, RR, 0, P N(S) N(R)

B, I, 0, 0
N(R) B sends 3 info
X B, I, 1, 0
frames
B, I, 2, 0,F
A rejects fr1 B, SREJ, 1
A polls C C, RR, 0, P
C, RR, 0, F C nothing to
send
A polls B, B, SREJ, 1,P
requests
selective B, I, 1, 0 B resends fr1
retrans. fr1 B, I, 3, 0 Then fr 3 & 4
B, I, 4, 0, F
A send info fr0 B, I, 0, 5
to B, ACKs up to 4
Time
 Frame Exchange using
Asynchronous Balanced Mode
Combined Station A Combined Station B
B, I, 0, 0 A, I, 0, 0

B, I, 1, 0 A, I, 1, 1 A ACKs fr0
X
B sends 5
frames B, I, 2, 1 A, I, 2, 1

B, I, 3, 2 A rejects
B, REJ, 1
fr1
B, I, 4, 3
A, I, 3, 1
B goes B, I, 1, 3
back to 1
B, I, 2, 4 B, RR, 2 A ACKs fr1
B, I, 3, 4
B, RR, 3 A ACKs fr2
Flow Control
 Flow control is required to prevent transmitter from
overrunning receiver buffers
 Receiver can control flow by delaying
acknowledgement messages
 Receiver can also use supervisory frames to
explicitly control transmitter
 Receive Not Ready (RNR) & Receive Ready (RR)

I3 I4 I5 RNR5 RR6 I6
 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
Link Sharing Using Statistical
Multiplexing
 Statistical Multiplexing
 Multiplexing concentrates bursty traffic onto a shared line
 Greater efficiency and lower cost

Header Data payload

B Buffer

Output line
C

Input lines
 Tradeoff Delay for Efficiency
(a) Dedicated lines A1 A2

B1 B2

C1 C2

(b) Shared lines A1 C1 B1 A2 B2 C2

 Dedicated lines involve not waiting for other users, but lines
are used inefficiently when user traffic is bursty
 Shared lines concentrate packets into shared line; packets
buffered (delayed) when line is not immediately available
Multiplexers inherent in Packet
Switches

1 1

2 2

 
 
 

N N

 Packets/frames forwarded to buffer prior to transmission from

switch
 Multiplexing occurs in these buffers
Multiplexer Modeling
Input lines
A
Output line
B Buffer

 Arrivals: What is the packet interarrival pattern?

 Service Time: How long are the packets?
 Service Discipline: What is order of transmission?
 Buffer Discipline: If buffer is full, which packet is dropped?

 Performance Measures:
 Delay Distribution; Packet Loss Probability; Line Utilization
 Delay = Waiting + Service Times

P1 P2 P3 P4 P5
Packet completes
transmission
Service
Packet begins
time
transmission

Waiting
Packet arrives
time
at queue P1 P2 P3 P4
P5
 Packets arrive and wait for service
 Waiting Time: from arrival instant to beginning of service
 Service Time: time to transmit packet
 Delay: total time in system = waiting time + service time
 Fluctuations in Packets in the
System

(a) Dedicated lines A1 A2

B1 B2

C1 C2

(b) Shared line A1 C1 B1 A2 B2 C2

(c) N(t)

Number of
packets in the
system
Packet Lengths & Service Times
 R bits per second transmission rate
 L = # bits in a packet
 X = L/R = time to transmit (“service”) a packet
 Packet lengths are usually variable
 Distribution of lengths → Dist. of service times
 Common models:
 Constant packet length (all the same)
 Exponential distribution
 Internet Measured Distributions fairly constant
 See next chart
Measure Internet Packet
Distribution
 Dominated by TCP
traffic (85%)
 ~40% packets are
minimum-sized 40 byte
packets for TCP ACKs
 ~15% packets are
maximum-sized
Ethernet 1500 frames
 ~15% packets are 552
& 576 byte packets for
TCP implementations
that do not use path
MTU discovery
 Mean=413 bytes
 Stand Dev=509 bytes
 Source: caida.org
M/M/1/K Queueing Model
Exponential service
K – 1 buffer
Poisson Arrivals time with rate 
rate 
At most K customers allowed in system

 1 customer served at a time; up to K – 1 can wait in queue

 Mean service time E[X] = 1/
 Key parameter Load: 
 When ≈0)customers arrive infrequently and usually
find system empty, so delay is low and loss is unlikely
 As  approaches →1)customers start bunching up and
delays increase and losses occur more frequently
 When >0)customers arrive faster than they can be
processed, so most customers find system full and those that
do enter have to wait about K – 1 service times
Poisson Arrivals
 Average Arrival Rate:  packets per second
 Arrivals are equally-likely to occur at any point in time
 Time between consecutive arrivals is an exponential random
variable with mean 1/ 
 Number of arrivals in interval of time t is a Poisson random
variable with mean t

( t ) k   t
P k arrivals in t seconds  e
k!
Exponential Distribution

- t/E [X] - t
P[ X > t ] = e =e for t > 0 .
Probability density

1-e-t

P[X<t]
e-t

t t
0 0
M/M/1/K Performance Results
(From Appendix A)
Probability of Overflow:
(1   )  K
Ploss  K 1
1 

Average Total Packet Delay:

K 1
 ( K  1) 
E[ N ]  
1  1  K 1

E[ N ]
E[T ] 
 (1  PK )
 M/M/1/10
10
normalized avg delay

9
E[T]/E[X]

8  Maximum 10 packets
7
6 allowed in system
5
4  Minimum delay is 1
3
2 service time
1
0  Maximum delay is 10
0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 2.2 2.4 2.6 2.8 3

1 load service times

p ro b a b i l i ty

0.9
 At 70% load delay &
s s probability

0.8
0.7
0.6 loss begin increasing
0.5
0.4  What if we add more
l oloss

0.3
0.2
0.1
buffers?
0
0 0.3 0.6 0.9 1.2 1.5 1.8 2.1 2.4 2.7 3
lo a d
M/M/1 Queue
Exponential service
Infinite buffer
Poisson Arrivals time with rate 
rate 
Unlimited number of customers
allowed in system
 Pb=0 since customers are never blocked
 Average Time in system E[T] = E[W] + E[X]
 When customers arrive infrequently and delays are low
 As  approaches customers start bunching up and
average delays increase
 When  customers arrive faster than they can be
processed and queue grows without bound (unstable)
Avg. Delay in M/M/1 & M/D/1
10

delay 8

7
avg . delay

6
average

5
no rmalized

4
M/M/1
normalized

3
constant
2
service time
1 M/D/1
0
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 0.99
lo a d

1     1 1   1 1
E[TM ]   
       for M/M/1 model.
 1    1     1     

  1   1 1
E[T D ]  1      for M/D/1 system.
 2(1   )    2(1   )   
Effect of Scale
 C = 100,000 bps  C = 10,000,000 bps
 Exp. Dist. with Avg. Packet  Exp. Dist. with Avg. Packet
Length: 10,000 bits Length: 10,000 bits
 Service Time: X=0.1 second  Service Time: X=0.001
second
 Arrival Rate: 750 pkts/sec
 Arrival Rate: 7.5 pkts/sec
 Load: =0.75  Load: =0.75

 Mean Delay:  Mean Delay:

 E[T] = 0.001/(1-.75) =
E[T] = 0.1/(1-.75) = 0.4 sec
0.004 sec
Reduction by factor of 100

Aggregation of flows can improve Delay & Loss Performance

Example: Header overhead &
Goodput
 Let R=64 kbps
 Assume IP+TCP header = 40 bytes
 Assume constant packets of total length
 L= 200, 400, 800, 1200 bytes
 Find avg. delay vs. goodput (information transmitted
excluding header overhead)

 Service rate  = 64000/8L packets/second

 Total load =  64000/8L
 Goodput =  packets/sec x 8(L-40) bits/packet
 Max Goodput = (1-40/L)64000 bps
 Header overhead limits maximum
goodput
0.6
Average Delay (seconds)

0.5 L=1200

0.4

0.3 L=800
L=400
0.2

0.1
L=200
0
0 8000 16000 24000 32000 40000 48000 56000 64000
Goodput (bits/second)
Burst Multiplexing / Speech
Interpolation

Many Fewer
Voice Trunks
Calls

Part of this burst is lost

 Voice active < 40% time
 No buffering, on-the-fly switch bursts to available trunks
 Can handle 2 to 3 times as many calls
 Tradeoff: Trunk Utilization vs. Speech Loss
 Fractional Speech Loss: fraction of active speech lost
 Demand Characteristics
 Talkspurt and Silence Duration Statistics
 Proportion of time speaker active/idle
 Speech Loss vs. Trunks
trunks
10 12 14 16 18 20 22 24
1
speech loss

0.1

0.01

Typical 48
requirement
0.001
24 32 40
# connections
n
n k

k  m 1
(k  m)  p (1  p ) n  k
k n n!
speech loss  where    .
np  
k k ! ( n  k )!
Effect of Scale
 Larger flows lead to better performance
 Multiplexing Gain = # speakers / # trunks
Trunks required for 1% speech loss
Multiplexing
Speakers Trunks Utilization
Gain
24 13 1.85 0.74
32 16 2.00 0.80
40 20 2.00 0.80
48 23 2.09 0.83
 Packet Speech Multiplexing
A3 A2 A1
Many voice
terminals
generating B3 B2 B1
voice packets Buffer B3 C3 A2 D2 C2 B1 C1 D1 A1
C3 C2 C1

D3 D2 D1 Buffer overflow

B2

 Digital speech carried by fixed-length packets

 No packets when speaker silent
 Synchronous packets when speaker active
 Buffer packets & transmit over shared high-speed line
 Tradeoffs: Utilization vs. Delay/Jitter & Loss
 Packet Switching of Voice

1 2 3
Sent t

1 2 3
Received t

 Packetization delay: time for speech samples to fill a packet

 Jitter: variable inter-packet arrivals at destination
 Playback strategies required to compensate for jitter/loss
 Flexible delay inserted to produce fixed end-to-end delay
 Need buffer overflow/underflow countermeasures
 Need clock recovery algorithm
 Chapter 5
Peer-to-Peer Protocols
and Data Link Layer
ARQ Efficiency Calculations
Stop & Wait Performance
1 successful transmission i – 1 unsuccessful transmissions

E [t t o t a l ]  t 0   (i  1)t o ut P[nt  i ]
i 1

  (i  1)t o ut (1  Pf )
i 1
t 0 Pf
i 1

t o u t Pf 1
t 0  t 0 .
1  Pf 1  Pf
Efficiency:
n f  no no
1
E[ttotal ] nf
 SW   (1  Pf )  (1  Pf ) 0 .
R na 2(t prop  t proc ) R
1 
nf nf
Go-Back-N Performance
1 successful transmission i – 1 unsuccessful transmissions

E[ttotal ]  t f   (i  1)Ws t f P[nt  i ]
i 1

 t f  Ws t f  (i  1)(1  Pf ) i 1 Pf
i 1

Ws t f Pf 1  (Ws  1) Pf
 tf   tf .
1  Pf 1  Pf

Efficiency:
n f  no no
1
E[ttotal ] nf
GBN   (1  Pf ) .
R 1  (Ws  1) Pf