Lecture 03:

Computer Networks and the

Internet (3/3)
Protocol Layers and Delay, loss and
throughput in packet-switched networks

CSI3601504 - Jaringan Komunikasi Data

Semester Gasal 2017-2018
Fakultas Ilmu Komputer UI

1
Protocol “layers”
Networks are
complex,
with many “pieces”:
 hosts
Question:
 routers
is there any hope of
organizing structure
 links of various
of network?
media
 applications
…. or at least our
 protocols
discussion of
 hardware, networks?
software
Introduction 1-2
Organization of air travel
ticket (purchase) ticket (complain)

baggage (check) baggage (claim)

gates (load) gates (unload)

runway takeoff runway landing

airplane routing airplane routing

airplane routing

 a series of steps

Introduction 1-3
Layering of airline functionality

ticket (purchase) ticket (complain) ticket

baggage (check) baggage (claim baggage

gates (load) gates (unload) gate

runway (takeoff) runway (land) takeoff/landing

airplane routing airplane routing airplane routing airplane routing airplane routing

departure intermediate air-traffic arrival

airport control centers airport

layers: each layer implements a service

 via its own internal-layer actions
 relying on services provided by layer
below
Introduction 1-4
Why layering?
dealing with complex systems:
 explicit structure allows identification,
relationship of complex system’s pieces
 layered reference model for discussion
 modularization eases maintenance, updating
of system
 change of implementation of layer’s service
transparent to rest of system
 e.g., change in gate procedure doesn’t affect
rest of system
 layering considered harmful?
Introduction 1-5
Internet protocol stack
 application: supporting network
applications
 FTP, SMTP, HTTP application
 transport: process-process data
transfer transport
 TCP, UDP
 network: routing of datagrams
from source to destination network
 IP, routing protocols
 link: data transfer between link
neighboring network elements
 Ethernet, 802.111 (WiFi), PPP physical
 physical: bits “on the wire”

Introduction 1-6
ISO/OSI reference
model
 presentation: allow applications
to interpret meaning of data, application
e.g., encryption, compression,
presentation
machine-specific conventions
 session: synchronization, session
checkpointing, recovery of data transport
exchange
network
 Internet stack “missing” these
layers! link
 these services, if needed, must be physical
implemented in application
 needed?

Introduction 1-7
 Encapsulation
source
message M application
segment Ht M transport
datagram Hn Ht M network
frame Hl Hn Ht M link
physical
link
physical

switch

destination Hn Ht M network
M application Hl Hn Ht M link Hn Ht M
Ht M transport physical
Hn Ht M network
Hl Hn Ht M link router
physical

Introduction 1-8
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-9
Four sources of packet delay
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dproc: nodal dqueue: queueing delay

processing  time waiting at output
link for transmission
 check bit errors  depends on congestion
 determine output link level of router
 typically < msec Introduction 1-10
Four sources of packet delay
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dtrans: transmission delay: dprop: propagation delay:

 L: packet length (bits)  d: length of physical link
 R: link bandwidth (bps)  s: propagation speed in
 dtrans = L/R medium (~2x108 m/sec)
dtrans and dprop  dprop = d/s
very different
* Check out the Java applet for an interactive animation on trans vs. prop delay Introduction 1-11
Caravan analogy
100 km 100 km
ten-car toll toll
caravan booth booth

 cars “propagate” at  time to “push” entire

100 km/hr caravan through toll
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:
100km/(100km/hr)= 1 hr
 Q: How long until caravan  A: 62 minutes
is lined up before 2nd toll
booth?
Introduction 1-12
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
serviced at first booth?
 A: Yes! after 7 min, 1st car arrives at second
booth; three cars still at 1st booth.

Introduction 1-13
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
Introduction 1-14
“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-15
“Real” Internet 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 Introduction 1-16

Packet loss
 queue (aka buffer) preceding link in buffer has
finite capacity
 packet arriving to full queue dropped (aka lost)
 lost packet may be retransmitted by previous
node, by source end system, or not at all
buffer
(waiting area) packet being transmitted
A

B
packet arriving to
full buffer is lost
* Check out the Java applet for an interactive animation on queuing and loss Introduction 1-17
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,
server withbits
sends linkpipe
capacity
that can carry linkpipe
capacity
that can carry
file of into
(fluid) F bitspipe Rs bits/sec
fluid at rate Rc bits/sec
fluid at rate
to send to client Rs bits/sec) Rc bits/sec)

Introduction 1-18
Throughput (more)
 Rs < Rc What is average end-to-end throughput?

Rs bits/sec Rc bits/sec

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

Rs bits/sec Rc bits/sec

bottleneck link
link on end-to-end path that constrains end-to-end throughput
Introduction 1-19
Throughput: Internet scenario

 per-connection
Rs
end-end
throughput: Rs Rs
min(Rc,Rs,R/10)
R
 in practice: Rc or
Rs is often Rc Rc
bottleneck
Rc

10 connections (fairly) share

backbone bottleneck link R bits/sec
Introduction 1-20
Review
 What is  Delay End-to-end
 TCP/IP  Traceroute

 OSI Layer  Packet loss

 Router  Throughput

 Switch
 Host
 Delay Processing
 Delay Queue
 Delay Transmission
 Delay Propagation

21
Exercises

22
Q01 – Propagation Delay
 How long does it take a packet of length
1,000 bytes to propagate over a link of
distance 5,000 km, propagation speed
2.5x108 m/s and transmission rate 1 Mbps?
Generally, how long does it take a packet
of length L to propagate over a link of
distance d, propagation speed s, and
transmission rate R bps? Does this delay
depend on packet length? Does this delay
depend on transmission rate?

23
Q02 - Transmission delay
 How long does it take to transmit a packet
of length 1,000 bytes a link of distance
5,000 km, propagation speed 2.5x108 m/s
and transmission rate 1 Mbps? Generally,
how long does it take to transmit a
packet of length L over a link of
distance d, propagation speed s, and
transmission rate R bps? Does this delay
depend on the length of the link? Does this
delay depend on the propagation speed of
the link?
24
Q03 - Transmission delay and
propagation delay
 Consider two packet switches directly
connected by a link of 5000 km,
propagation speed 2.5x108m/s and
transmission rate 1 Mbps. How long does it
take to move a packet of length 1,000
bytes from one packet switch to the other
packet switch? Generally, how long does it
take to move a packet of length L over a
link of distance d, propagation speed s,
and transmission rate R bps?

25
Q04 - Delays with multiple
links
 Consider a packet of length L which begins at end system A,
travels over one link to a packet switch, and travels from the
packet switch over a second link to a destination end system
B. Let di, si and Ri denote the length, propagation speed, and
transmission rate of link i, for i = 1, 2. The packet switch
delays each packet by dproc. Assuming no queuing delays, in
terms of di, si , Ri, (i=1,2) and L, what is the total end-to-end
delay for the packet? Suppose the packet is 1,000 bytes,
the propagation speed on both links is 2.5x108 m/s, the
transmission rates of both links is 1 Mbps, the packet switch
processing delay is 1 msec, the length of the first link is
4,000 km, and the length of the last link is 1,000 km. For
these values, what is the end-to-end delay?

26
Q05 - Queuing delay
 A packet switch receives a packet and determines
the outbound link to which the packet should be
forwarded. At packet arrival, one other packet is
half transmitted on this outbound link and three
other packets are waiting to be transmitted.
Packets are transmitted in order of arrival.
Suppose all packets are 1,000 bytes and the link
rate is 1 Mbps. What is the queuing delay for the
packet? Generally, what is the queuing delay when
all packets have length L bits, the transmission
rate is R, x bits of the currently transmitted
packet have been transmitted, and N packets are
already in the queue?
27