Lecture 04: Network Delays

Lecture 04
Network Delays
Lecture 04: Network Delays
What’s the Internet: “nuts and bolts”
view
PC • millions of connected computing devices:
mobile network
server – hosts = end systems
wireless – running network apps global ISP
laptop
smartphone
home
 communication network
regional ISP
wireless
links
links  fiber, copper,
wired
links radio, satellite
 transmission
rate: bandwidth
 Packet switches: forward
router packets (chunks of data) institutional
 routers and switches network
1-2
Lecture 04: Network Delays

The network core

• mesh of
interconnected routers
• packet-switching: hosts
break application-layer
messages into packets
– forward packets from
one router to the next,
across links on path
from source to
destination
– each packet transmitted
at full link capacity
Introduction 1-3
Lecture 04: Network Delays

In a real world

•Computer networks are constrained by

throughput (the amount of data per second
that can be transferred), introduce delays,
and can actually lose packets.
Lecture 04: Network Delays

store-and-forward

L bits
per packet

3 2 1
source destination
R bps R bps

• takes L/R seconds to transmit (push out) L-bit packet

into link at R bps
• store and forward: entire packet must arrive at
router before it can be transmitted on next link

 end-end delay = 2L/R (assuming zero propagation

delay)
Lecture 04: Network Delays

one-hop numerical example:

L = 7.5 Mbits, R = 1.5 Mbps, one-hop transmission delay = L/R = 5
sec

In general sending one packet from source to destination over a

path consisting of N links each of rate R (thus, there are N-1
routers between source and destination)

What the delay would be for P packets sent over a series of N links?

(N+P-1)
Lecture 04: Network Delays

Sources of packet delay

• The delay we have just seen can be

termed as the Transmission delay.

• This is the amount of time required to push

(that is, transmit) all of the packet’s bits
into the link.
Lecture 04: Network Delays
Four sources of packet delay
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dproc: nodal processing dqueue: queueing delay

 check bit errors  time waiting at output
 determine output link link for transmission
 typically < msec
 depends on
congestion level of
router
Lecture 04: Network Delays
Four sources of packet delay
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dtrans: transmission dprop: propagation

delay: delay:
 L: packet length (bits)  d: length of physical link
 R: link bandwidth (bps)  s: propagation speed in
dtrans and dprop medium (~2x108 m/sec)
 dtrans = L/R
very different  dprop = d/s
* Check out the Java applet for an interactive animation on trans vs. prop delay
Lecture 04: Network Delays

End to End delay

• We have seen previously that the end-to-end delay for a
packet, only considering transmission delay is

• In above equation L/R is only the transmission delay, we

can generalize it (ignoring queueing delay?) as follows:
Lecture 04: Network Delays
Caravan analogy

100 km 100 km
ten-car toll toll
caravan booth booth
 time to “push” entire
• cars “propagate” at caravan through toll
100 km/hr booth onto highway =
• toll booth takes 12 sec to 12*10 = 120 sec
service car (bit  time for last car to
transmission time) propagate from 1st to
• car~bit; caravan ~ packet 2nd toll both:
• Q: How long until caravan 100km/(100km/hr)= 1
is lined up before 2nd toll hr
booth?  A: 62 minutes
Lecture 04: Network Delays
Caravan analogy (more)
100 km 100 km
ten-car toll toll
caravan booth booth

• suppose cars now “propagate” at 1000 km/hr

• and suppose toll booth now takes one min to
service a car
• Q: Will cars arrive to 2nd booth before all cars
 A: Yes!at after
serviced first booth?
7 min, 1st car arrives at second
booth; three cars still at 1st booth.
Lecture 04: Network Delays
Queueing delay (revisited)
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dqueue: queueing delay

 time waiting at output link for
transmission
 depends on congestion level of
router
Lecture 04: Network Delays

Queueing delay (revisited)

• Unlike the other three delays, the queuing delay

can vary from packet to packet

• When is the queuing delay large and when is it

insignificant?
– rate at which traffic arrives
– the transmission rate of the link
– the nature of the arriving traffic
Lecture 04: Network Delays
Queueing delay
(revisited)

average queueing
• R: link bandwidth (bps)

delay
• L: packet length (bits)
• a: average packet
arrival rate
traffic intensity
= La/R

 La/R ~ 0: avg. queueing delay small La/R ~ 0

 La/R -> 1: avg. queueing delay large
 La/R > 1: more “work” arriving
than can be serviced, average delay
infinite!
* Check out the Java applet for an interactive animation on queuing and loss La/R -> 1
Lecture 04: Network Delays
How do loss and delay
occur?
packets queue in router buffers
• packet arrival rate to link (temporarily) exceeds
output link capacity
• packets queue, wait for turn
packet being transmitted (delay)

B
packets queueing (delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers
Introduction 1-16
Lecture 04: Network Delays
Lecture 04: Network Delays
“Real” Internet delays and
routes
• what do “real” Internet delay & loss look like?
• traceroute program: provides delay
measurement from source to router along end-
end Internet path towards destination. For all i:
– sends three packets that will reach router i on path
towards destination
– router i will return packets to sender
– sender times interval between transmission and reply.

3 probes 3 probes

3 probes

Introduction 1-18
 “Real” Internet delays,
Lecture 04: Network Delays

routes
traceroute: gaia.cs.umass.edu to www.eurecom.fr
3 delay measurements from
gaia.cs.umass.edu to cs-gw.cs.umass.edu
1 cs-gw (128.119.240.254) 1 ms 1 ms 2 ms
2 border1-rt-fa5-1-0.gw.umass.edu (128.119.3.145) 1 ms 1 ms 2 ms
3 cht-vbns.gw.umass.edu (128.119.3.130) 6 ms 5 ms 5 ms
4 jn1-at1-0-0-19.wor.vbns.net (204.147.132.129) 16 ms 11 ms 13 ms
5 jn1-so7-0-0-0.wae.vbns.net (204.147.136.136) 21 ms 18 ms 18 ms
6 abilene-vbns.abilene.ucaid.edu (198.32.11.9) 22 ms 18 ms 22 ms
7 nycm-wash.abilene.ucaid.edu (198.32.8.46) 22 ms 22 ms 22 ms trans-oceanic
8 62.40.103.253 (62.40.103.253) 104 ms 109 ms 106 ms
9 de2-1.de1.de.geant.net (62.40.96.129) 109 ms 102 ms 104 ms link
10 de.fr1.fr.geant.net (62.40.96.50) 113 ms 121 ms 114 ms
11 renater-gw.fr1.fr.geant.net (62.40.103.54) 112 ms 114 ms 112 ms
12 nio-n2.cssi.renater.fr (193.51.206.13) 111 ms 114 ms 116 ms
13 nice.cssi.renater.fr (195.220.98.102) 123 ms 125 ms 124 ms
14 r3t2-nice.cssi.renater.fr (195.220.98.110) 126 ms 126 ms 124 ms
15 eurecom-valbonne.r3t2.ft.net (193.48.50.54) 135 ms 128 ms 133 ms
16 194.214.211.25 (194.214.211.25) 126 ms 128 ms 126 ms
17 * * *
18 * * * * means no response (probe lost, router not replying)
19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms

* Do some traceroutes from exotic countries at www.traceroute.org

Lecture 04: Network Delays

Throughput

• throughput: rate (bits/time unit) at which

bits transferred between sender/receiver
– instantaneous: rate at given point in time
– average: rate over longer period of time

server, with
server sends link capacity
pipe that can carry link capacity
pipe that can carry
file ofbits
F bits fluid at rate
Rs bits/sec fluid at rate
Rc bits/sec
to(fluid)
send into
to client
pipe Rs bits/sec) Rc bits/sec)
Lecture 04: Network Delays

Throughput (more)

• Rs < Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

 Rs > Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

bottleneck
link onlink
end-end path that constrains end-end
throughput
 Throughput: Internet
Lecture 04: Network Delays

scenario
• per-connection
Rs
end-end
Rs Rs
throughput:
min(Rc,Rs,R/10) R
• in practice: Rc
Rc Rc
or Rs is often
Rc
bottleneck
10 connections (fairly) share
backbone bottleneck link R bits/sec
Lecture 04: Network Delays

Computer Networking: A Top Down Approach

6th edition
Jim Kurose, Keith Ross
Addison-Wesley
March 2012

A note on the origin of these ppt slides:

These slides are freely provided by the book authors and it represents a lot of work on their part.
We would like to thank J.F Kurose and K.W. Ross.