routers.

The propagation delay, on the other hand, is the time it takes a bit to propagate
COMPUTER NETWORKS AND THE INTERNET
from one router to the next; it is a function of the distance between the two routers, but
has nothing to do with the packets length or the transmission rate of the link.
An analogy might clarify the notions of transmission and propagation delay. Consider a highway that has a tollbooth every 100 kilometers, as shown in Figure 1.17.
EE281
Iwith
nternetworking
HW1 the forwarding.
ID:009389081
process
then
continues
router
B now between
performing
In wide-area
You can
think
of the highway
segments
tollbooths as links and
the toll
networks,
propagation
delays
are
on
the
order
of
milliseconds.
booths as routers. Suppose that cars travel (that is, propagate) on the highway at a

rate of 100 km/hour (that is, when a car leaves a tollbooth, it instantaneously accel
erates
100P9,
km/hour
andP28,
maintains
that speed between
Problems:
P5,toP6,
P18, P24,
P30.
Comparing
Transmission
and
Propagation
Delay tollbooths). Suppose next
that 10 cars, traveling together as a caravan, follow each other in a fixed order. You
Newcomers
the field
havesuppose
difficulty
can think oftoeach
car asofa computer
bit and thenetworking
caravan as sometimes
a packet. Also
thatundereach
theservices
difference
between
transmission
delay
andofpropagation
The differtollbooth
(that
is, transmits)
a car at
a rate
one car per delay.
12 seconds,
and
P5: standing
ence
Thethe
transmission
delayare
is the amount
of on
time
for
thatisitsubtle
is latebut
at important.
night so that
caravans cars
only cars
therequired
highway.
(a) Given,
The caravan
hassuppose
carsout
the
router
to10push
packet; the
it isfirst
a function
of the
packets
length
the transFinally,
thatthe
whenever
car of the
caravan
arrives
at aand
tollbooth,
it
The propagation
speed
(R)
is
100
km/hr.
waits atrate
the of
entrance
until
nine to
cars
and lined
up behind
it.
mission
the link,
butthe
hasother
nothing
dohave
witharrived
the distance
between
the two
Number
of
tolls
are
3.
(Thus
the
entire
caravan
must
be
stored
at
the
tollbooth
before
it
can
begin
to
be
forrouters. The propagation delay, on the other hand, is the time it takes a bit to propagate
A tollbooth
services
car
a rate
offor
every
12to
seconds.
warded.)
Theato
time
thecar
tollbooth
push the
entirethe
caravan
onto the
from
one
router
theatrequired
next;
it is
aone
function
of the
distance
between
two routers,
but
The caravan
travels
150
km
(L).
highway
is
(10
cars)/(5
cars/minute)
=
2
minutes.
This
time
is
analogous
to
the
has nothing to do with the packets length or the transmission rate of the link.
The propagation
delay is L/R
150/100
1.5 hours
= 90for
minutes.
transmission
in a=router.
The= time
required
a car topropagation
travel from delay.
the exit
of
An analogydelay
might
ConThe
transmission
delayclarify
is the12notions
* of
10transmission
=
120 andseconds
for
every
one atollbooth
tothat
thehas
nexta tollbooth
is
100 100
km/(100
km/hour)
= 1 hour.
This
time
is tollbooth
sider
highway
tollbooth
every
kilometers,
as
shown
in
Figure
1.17.
So, for 3 tollbooths it is 120 seconds * 3 = 6 minutes
analogous
to propagation
delay.segments
Therefore,between
the timetollbooths
from whenas
thelinks
caravan
stored
You
can think
highway
and isthe
tollThe transaction
delayofis the
6 minutes.
in
front
of
a
tollbooth
until
the
caravan
is
stored
in
front
of
the
next
tollbooth
is
boothsdelay
as routers.
Suppose delay
that cars
travel (thatdelay
is, propagate)
highway the
at a
End-to-End
is Propagation
+ Transaction
= 90 + 6 =on
96the
minutes
sum of transmission delay and propagation delayin this example, 62 minutes.
rate of 100 km/hour (that is, when a car leaves a tollbooth, it instantaneously accelerates to 100 km/hour and maintains that speed between tollbooths). Suppose next
that 10 cars, traveling together as a caravan, follow each other in a fixed order. You
can think of each car as a bit and the caravan as a packet. Also suppose that each

tollbooth services (that is, transmits) a car at a rate of one car per 12 seconds, and


100 km
100 km
that it is late at night so that the caravans cars are the only cars on the highway.


Finally, suppose that whenever the first car of the caravan arrives at a tollbooth, it

Ten-car
Toll
Toll
waits at the entrance until the other nine cars have arrived and lined up behind it.
caravan
booth
booth

(Thus the entire caravan must be stored at the tollbooth before it can begin to be for
warded.)
time
required analogy
for the tollbooth to push the entire caravan onto the
Figure The
1.17
! Caravan
(b) Given,
highway is (10 cars)/(5 cars/minute) = 2 minutes. This time is analogous to the
The caravan has 8 cars
transmission
delay
router.which
The time
The propagation
delay
is in
thea same,
is 90required
minutes.for a car to travel from the exit of
one tollbooth
to the
next
is 100forkm/(100
km/hour) = 1 hour. This time is
The transmission
delay
is 12
* 8tollbooth
= 96 seconds
every tollbooth.
to propagation
delay.
the time
when
caravan is stored
So, foranalogous
3 tollbooths
it is 96 seconds
* 3Therefore,
= 288 seconds
= 4from
minutes
48the
seconds.
End-to-End
Propagation
delay
+ Transaction
= 90
4 min
sec = 94isminutes
and 48
in frontdelay
of a is
tollbooth
until the
caravan
is storeddelay
in front
of+the
next48tollbooth
the
sec sum of transmission delay and propagation delayin this example, 62 minutes.

APTER 1

100 km

Ten-car
Eight caravan
car caravan

100 km

Toll
booth

Figure 1.17 ! Caravan analogy

Anuj Gargeya Malkapuram - 009389081

Toll
booth

EE281 Internetworking HW1

ID:009389081

P6:
(a) The Propagation delay dprop=
(b) The Transmission delay dtrans=
(c) End to End delay is

!
!

!
!

!
!
!
!

seconds
seconds

Seconds

(d) At t=0, A begins to transmit the packet. At t= dtrans, last bit of the packet is just leaving the host
A.
(e) If dprop > dtrans, at t= dtrans, the first bit will be in the link and has not reached the host B.
(f) If dprop < dtrans, at t= dtrans, the first bit has reached host B.
(g) Given that dprop = dtrans, so,

!
!

!
!

=
=

120
2.5 10! = 536
56 10^8

P9:
The example is provided with a 1 Mbps link, the users are generating data at a rate of 100
kbps when busy, but are busy generating data only with probability p = 0.1. Now 1Mbps is replaced
by 1Gbps link.
(a) The maximum number of users that can be supported simultaneously under circuit switching
are N which is
For 1Mbps=10 Users are supported, for 1Gbps(1000Mb approx.)=10^4 are supported
which is equal to 10,000.
(b) Probability that N users are sending data
!

!!!

N !
1

!!!

Probability that more than N users are sending data.

!

!!!!!

M !
(1 )!!!

So the probability that more than N users sending data is

!

!!!!!

M !
(1 )!!!

Anuj Gargeya Malkapuram - 009389081

EE281 Internetworking HW1

ID:009389081

P18: Traced www.ny.gov website in three different hours in a day, these are the results

Anuj Gargeya Malkapuram - 009389081

EE281 Internetworking HW1

ID:009389081

A) The averages and standard deviation of the round-trip delays of the three hours are as follows:

Hour
Average
Standard Deviation
1st hour

98.37ms

8.389

2nd hour

101.15ms

2.661

3rd hour

132.43ms
50.79


B) The number of routers in path at each of the three hours is same. The number of routers was 20 in all of
them. No the paths did not change in any of the hours.
C) Two ISPs are involved in the packet transfer from source to destination. The largest delays occurred at the
peering interfaces between adjacent ISPs, which is almost double during the ISPs interfaces when compared
to other interfaces.

Anuj Gargeya Malkapuram - 009389081

EE281 Internetworking HW1

ID:009389081

(D) Traced www.india.gov.in in 3 different hours ,which is inter-continental tracing

Anuj Gargeya Malkapuram - 009389081

EE281 Internetworking HW1

ID:009389081

1. The averages and standard deviation of the round-trip delays of the three hours are as follows:

Hour
Average
Standard Deviation
1st hour

308.28ms

36.56

2nd hour

301.202ms

48.08

3rd hour
304.7ms
9.43


2. The number of routers in path at each of the three hours is same. The number of routers was 13 in all of
them. No the paths did not change in any of the hours.
3. Three ISPs are involved in the packet transfer from source to destination. The largest delays occurred at the
peering interfaces between adjacent ISPs, which is almost double during the ISPs interfaces when compared
to other interfaces.
4. Comparing to Intra continent, the Inter continent packet transfer round trip delay time will be less.

Anuj Gargeya Malkapuram - 009389081

EE281 Internetworking HW1

ID:009389081

P24:
Task is to deliver 40terabytes of data from Boston to Los Angeles and a 100 Mbps dedicated link for data
transfer.
So, 40 terabytes of data = 40*8 = 320 terabits of data = M
100Mbps data link = S
Time to transfer the data = (M/S) =

!"#!"!"

(!""!"^!)

= 889 Hours = 37 days.

FedEx delivers the data in one night. So choosing FedEx delivery is the right option.


P28:
Distance between Host A and Host B is 20000 km.
Rate of transmission is 2 Mbps=2*10^6 bps.
The propagation speed over the link is 2.5 * 108 meters/sec.
Propagation time is 80ms.
!!"!

(a) Time to transfer the file = Tprop=M/S=

=80ms
!.!!"^!
Transmission delay = L/R = (80,000)/(2 (10^6))= 400ms
Total time to send the file=80+400=480ms
(b) Now the length of each packet is 40000, file is broken into 20 pieces
Transmission delay= (40000)/2*(10^6))= 20ms
Propagation tine is 80ms
Total time taken= 20*(Ttrans+(2*Tprop))=20*(20+(2*80))=360ms
(c) We can deduce from (a) and (b) that when the packet is broken into 20pieces then it takes more time to
transfer the entire packet as propagation time is doubled as acknowledgement is needed to send the
consecutive packet which is added to the propagation time. So the first case is more reliable than the
second case.

P30:
When the passenger checks in, their bags are checked, and a tag is attached to the bags and ticket. When a
passenger then passes through security and tag is often added to their ticket, indicating that the passenger
has passed through a security check. So baggage tag and as well as the security tag will ensure secure
baggage transfer to people.

Anuj Gargeya Malkapuram - 009389081