COMPUTER NETWORKS

Computer Networks
and the Internet
Team Networks
Department of Computer Science and Engineering
COMPUTER NETWORKS

Computer Networks and the Internet

Team Networks
Department of Computer Science and Engineering
COMPUTER NETWORKS

Unit – 1 Computer Networks and the Internet

1.1 Introduction to Computer Networks

1.2 What is the Internet?
• A nuts-and-bolts and Services description, Protocol
1.3 Network edge
• End systems, Access networks, Physical media
1.4 Network core
• Packet switching, Circuit switching, Network structure
1.5 Delay, Loss & Throughput in networks
COMPUTER NETWORKS
Performance: Delay, Loss & Throughput

How do packet loss and delay occurs?

packets queue in router buffers
▪ packets queue, wait for turn
▪ arrival rate to link (temporarily) exceeds output link capacity: packet loss
packet being transmitted (transmission
delay)
A

B
packets in buffers (queueing delay)
free (available) buffers: arriving
packets
dropped (loss) if no free buffers
COMPUTER NETWORKS
Performance: Packet Delay – 4 Sources

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 link for transmission
▪ determine output link ▪ depends on congestion level of router
▪ typically < msec ▪ microseconds to milliseconds
 COMPUTER NETWORKS
Performance: Packet Delay – 4 Sources
transmission
A propagation

B
nodal
processing queueing * Check out the online interactive exercises:
http://gaia.cs.umass.edu/kurose_ross

dnodal = dproc + dqueue + dtrans + dprop

dtrans: transmission delay: dprop: propagation delay:
▪ L: packet length (bits) ▪ d: length of physical link
▪ R: link transmission rate (bps) ▪ s: propagation speed (~2x108 m/sec)
▪ dtrans = L/R ▪ dprop = d/s
dtrans and dprop
very different
 COMPUTER NETWORKS
Transmission Delay vs Propagation Delay

Transmission Delay Propagation Delay

Time required for the router to Time it takes a bit to propagate

push out the packet. from one router to the next.
A function of the packet’s A function of the distance
length and the transmission between the two routers.
rate of the link.
dtrans = L/R dprop = d/s
Nothing to do with the Nothing to do with the
distance between packet’s length or the
the two routers. transmission rate of the link.
 COMPUTER NETWORKS
Performance: Delay – Caravan Analogy

100 km 100 km

ten-car caravan toll booth toll booth

(aka 10-bit packet) (aka router)

▪ cars “propagate” at 100 km/hr ▪ time to “push” entire caravan

▪ toll booth takes 12 sec to service through toll booth onto
car (bit transmission time) highway = 12*10 = 120 sec
▪ car ~ bit; caravan ~ packet ▪ time for last car to propagate
from 1st to 2nd toll both:
▪ Q: How long until caravan is lined 100km/(100km/hr) = 1 hr
up before 2nd toll booth?
▪ A: 62 minutes
COMPUTER NETWORKS
Performance: Delay – Caravan Analogy (more)

100 km 100 km

ten-car caravan toll booth toll booth

(aka 10-bit packet) (aka router)

▪ 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, first car arrives at second

booth; three cars still at first booth
COMPUTER NETWORKS
Performance: Packet Queueing Delay revisited

Unlike other delays (dproc, dtrans, dprop), dqueue is interesting.

• Can vary from packet to packet.
• Characterize dqueue -> average, variance, probability that it
exceeds some specified value.
When is the queuing delay large and when is it insignificant?
• Rate at which traffic arrives at the queue,
• Transmission rate of the link,
• Nature of the arriving traffic – periodically or in bursts
COMPUTER NETWORKS
Performance: Packet Queueing Delay revisited

▪ R: link bandwidth (bps)

average queueing delay

▪ L: packet length (bits)
▪ a: average packet arrival rate (pps)
▪ La: avg. rate at which bits arrive at Design your system so
the queue that the traffic intensity
is no greater than 1.
▪ La/R > 1: more “work” arriving is
more than can be serviced - average
delay infinite! traffic intensity = La/R 1
▪ La/R <= 1: nature of arriving traffic La/R ~
0
▪ La/R ~ 0: avg. queueing delay small
La/R > 1: Average rate at which bits arrive
at the queue exceeds the rate at which the
bits can be transmitted from the queue.
La/R ->
COMPUTER NETWORKS
“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 (with time-to-live field value of i)
• router i will return packets to sender
• sender measures time interval between transmission and
reply

3 probes 3 probes

3 probes
 COMPUTER NETWORKS
“Real” Internet Delays and 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 3 delay measurements
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 to border1-rt-fa5-1-0.gw.umass.edu
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 link
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
10 de.fr1.fr.geant.net (62.40.96.50) 113 ms 121 ms 114 ms looks like delays
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 decrease! Why?
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

COMPUTER NETWORKS
How Traceroute works?

Refer RFC 1393, Traceroute Using an IP

Option
Don’t Trust Traceroute (Completely)
 COMPUTER NETWORKS
Performance: 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
 COMPUTER NETWORKS
Performance: Throughput

▪ throughput: rate (bits/time unit) at which bits are being sent from
sender to receiver
• instantaneous: rate at given point in time
• average: rate over longer period of time

link
pipecapacity
that can carry linkthat
pipe capacity
can carry
serverserver, bits Rs fluid
sendswith at rate
bits/sec Rfluid
c
at rate
bits/sec
(fluid)
fileinto
of Fpipe
bits (Rs bits/sec) (Rc bits/sec)
to send to client
 COMPUTER NETWORKS
Performance: Throughput (more)

Rs < Rc What is average end-end throughput?

R bits/sec R bits/sec
s c

Rs > Rc What is average end-end throughput?

Throughput = min{Rs, Rc}

R bits/sec R bits/sec
s c

bottleneck link
link on end-end path that constrains end-end throughput.
COMPUTER NETWORKS
Throughput – Numerical Example

▪ Suppose you are downloading an MP3 file of F = 32 million bits.

▪ The server has a transmission rate of Rs = 2 Mbps and you have
an access link of Rc = 1 Mbps.
▪ What is the time needed to transfer the file?
Let’s work it out!

Solution:
▪ 32 seconds!
COMPUTER NETWORKS
Performance: Throughput – Network Scenario

▪ per-connection end-end
Rs throughput: min(Rc,Rs,R/10)
* Check out the online interactive
Rs Rs ▪ in practice: Rc or Rs is often exercises for more examples:
bottleneck http://gaia.cs.umass.edu/kurose_ross/

R
▪ Suppose Rs = 2 Mbps, Rc = 1
Rc Rc Mbps, R = 5 Mbps
▪ 10 clients from 10 servers =
Rc 10 downloads

End-to-end throughput for

10 connections (fairly) share
each download is now
backbone bottleneck link R bits/sec
reduced to 500 kbps.
THANK YOU

Team Networks
Department of Computer Science and Engineering