12/24/2019 1

What
is
This
??????????????

12/24/2019 niarB noitavitcA 2

 Alpha Breathing

12/24/2019 ISP 3
 Evocation

12/24/2019 ISP 4
 Packet Switching – Delay , Loss
and Throughput

12/24/2019 ISP 5
 Throughput

• Amount of data per second that can be transmitted

between the end system
• Major constrain on throughput is
– Delay(Refer next slide)
– Loss of packet

12/24/2019 6
 How Delay Occurs?
• Listen to lecture
• Delays to be concentrate
– Nodal Processing Delay
– Queuing Delay
– Transmission Delay Total Nodal Delay

– Propagation Delay
 Types of Delay
• Listen to lecture
 Processing Delay
• Examine packet’s header and determine
where to direct the packet
• Time need to check the bit-level errors
• Normally in high speed router the delay is in
microseconds or less.
• Listen to lecture

12/24/2019 ISP 9
 Queuing Delay
• This delay occurs due to packet waits to be
transmitted onto the link.
• Listen to lecture

12/24/2019 ISP 10
 Transmission Delay
• Packets can be transmitted only after all the
packets that have arrived before it have been
transmitted.
• The Transmission Delay is given by L/R
– Where L is Length of packet in bits
– R is Transmission Rate of a link in bits/sec
normally it will be microsecond to millisecond.
Listen to lecture

12/24/2019 ISP 11
 Propagation Delay
• The time required to propagate from the
beginning of the link to end of the link.
• Bit propagates at the propagation speed of
the link.
• Propagation speed depends on the physical
medium of the link(2 •108 meters/sec to 3
•108 meters/sec)
• Propagation delay=d/s where d is distance
between two router and s is speed of the link
12/24/2019 ISP 12
 Total Nodal Delay
• If we let dproc, dqueue, dtrans, and dprop
denote the processing, queuing, transmission,
and propagation delays, then the total nodal
delay is given by

• dnodal = dproc + dqueue + dtrans + dprop

12/24/2019 ISP 13
 Queuing Delay
• Depends on

• Rate at which traffic arrives at queue

• Transmission rate of the link
• Nature of arriving traffic
12/24/2019 ISP 14
 Calculation of Traffic Intensity
• Let,
– a(packet per second)-Average Rate of the Packet
arrive at the queue.
– R –Transmission rate
– L-No of bits then
– Traffic Intensity=La/R

12/24/2019 ISP 15
 Need of traffic intensity

 La/R > 1: more “work” arriving

than can be serviced, queuing delay infinite!
 La/R ~ 0: avg. queueing delay small
 La/R ≤ 1 : According to the nature of arriving traffic
impacts the queuing delay
 Listen to the lecture
 Due to this Packet loss occur if the queue is finite
12/24/2019 16
 End-End Delay

dend-end = N (dproc + dtrans + dprop)

 Where
 N number of Routers+1
 dtrans= transmission delay which is L/R
dprop= propagation delay which is d/s
dproc= processing delay

 Refer traceroute.org

In VOIP there is a delay which is packetization

Delay
12/24/2019 17
 End-End Delay
Consider the figure below, with three links, each with the
specified transmission rate and link length.

Find the end-to-end delay (including the transmission delays

and propagation delays on each of the three links, but
ignoring queueing delays and processing delays) from when
the left host begins transmitting the first bit of a packet to the
time when the last bit of that packet is received at the server
at the right. The speed of light propagation delay on each link
is 3x10**8 m/sec. Note that the transmission rates are in
Mbps and the link distances are in Km. Assume a packet
length of 8000 bits. Give your answer in milliseconds.
12/24/2019 18
 “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

12/24/2019 19
 “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 trans-oceanic
7 nycm-wash.abilene.ucaid.edu (198.32.8.46) 22 ms 22 ms 22 ms 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
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)
* means no response (probe 135
lost,ms 128not
router ms replying)
133 ms
16 194.214.211.25 (194.214.211.25) 126 ms 128 ms 126 ms
17 * * *
18 * * *
12/24/2019 20
19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms
 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
12/24/2019 21
 Throughput

throughput is min{Rc, Rs}

Time taken to transfer the file

F/min{Rs, Rc}
Listen to the lecture
 Throughput
Suppose Rs = 2 Mbps, Rc = 1 Mbps, R = 5 Mbps, and the common link divides its
transmission rate equally among the 10 downloads. Then the bottleneck for each
download is no longer in the access network, but is now instead the shared link in
the core, which only provides each download with 500 kbps of throughput. Thus the
end-to-end throughput for each download is now reduced to 500 kbps.
 2 Minutes

niarB
noitavitcA

12/24/2019 niarB noitavitcA 24

 Puzzle 1

Tom's mother has three children. One is named April, one

is named May. What is the third one named?

12/24/2019 niarB noitavitcA 25

 Solution 1

Tom

12/24/2019 niarB noitavitcA 26

 Puzzle 2
What number comes next?
2, 2, 4, 12, 48, ___

12/24/2019 niarB noitavitcA 27

 Solution 2

240

To get the number, multiply the previous number in the

series by its position. 48 is in the 5th position.

12/24/2019 niarB noitavitcA 28

 Puzzle 3
A murderer is condemned to death. He has to choose
Between three rooms. The first is full of raging fires, the
second is full of assassins with loaded guns, and the third
is full of lions that haven't eaten in 3 years. Which room is
safest for him?

12/24/2019 niarB noitavitcA 29

 Solution 3

The third room, since the lions would be dead.

12/24/2019 niarB noitavitcA 30

 Puzzle 4
Is the center square of stars standing still or moving?

12/24/2019 niarB noitavitcA 31

 Solution 4

Your brain thinks it is moving, but in reality, it is standing still!

12/24/2019 niarB noitavitcA 32

 Survey and Reading
• Text Book : James F.Kurose & Keith W.Ross, “Computer
Networking A Top-down Approach Featuring the Internet”,
PHI, 2007.

• Page No : 63 to 70

12/24/2019 ISP 33
 Discussion

12/24/2019 ISP 34
 Mind Map
Waiting & then Throughput-
packet being bits/time unit
transmitted

Packets  Buffer Delay and Loss in Four Sources of

Packets Packet delay
dproc
dqueue
dtrans
dprob

Queueing & Nodal

Processing

Propagation

12/24/2019 ISP 35
 Summary
• Internet can be viewed as an infrastructure that provides services to
distributed applications running on end systems.
• Internet services to be able to move as much data as we want
between any two end systems, instantaneously, without any loss of
data.
• Instead, computer networks necessarily constrain throughput (the
amount of data per second that can be transferred) between end
systems, introduce delays between end systems, and can actually
lose packets.
• A packet starts in a host (the source), passes through a series of
routers, and ends its journey in another host (the destination).

12/24/2019 ISP 36
• As a packet travels from one node (host or router) to the
subsequent node (host or router) along this path, the packet
suffers from several types of delays at each node along the
path.

• The most important of these delays are the nodal processing

delay, queuing delay, transmission delay, and propagation
delay; together, these delays accumulate to give a total nodal
delay.

12/24/2019 37