Computer Networks

BITS ZC481
Vishal Gupta
BITS Pilani
Pilani|Dubai|Goa|Hyderabad

Department of Computer Science and Information

Systems
Birla Institute of Technology and Science
Pilani Campus, Pilani

BITS Pilani
Pilani|Dubai|Goa|Hyderabad

Agenda: Based on RL 2.1

1. Delay, Loss, and Throughput

How do loss and delay

occur?
packets queue in router buffers

packet arrival rate to link 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-3

Four sources of packet

delay
transmission

propagation
B

nodal
processing

queueing

dnodal = dproc + dqueue + dtrans + dprop

dproc: nodal processing

check bit errors
determine output link
typically < msec

dqueue: queueing delay

time waiting at output link

for transmission
depends on congestion level
of router
Introduction 1-4

Four sources of packet

delay
transmission

propagation
B

nodal
processing

queueing

dnodal = dproc + dqueue + dtrans + dprop

dtrans: transmission delay:

dprop: propagation delay:

L: packet length (bits)

R: link bandwidth (bps)
dtrans = L/R

d: length of physical link

s: propagation speed in
medium (~2x108 m/sec)
dprop = d/s

dtrans and dprop

very different

Introduction 1-5

Caravan analogy
100 km
ten-car
caravan

toll
booth

cars propagate at
100 km/hr
toll booth takes 12 sec to
service car (transmission
time)
car~bit; caravan ~ packet
Q: How long until caravan
is lined up before 2nd toll
booth?

100 km
toll
booth
time to push entire
caravan through toll
booth onto highway =
12*10 = 120 sec
time for last car to
propagate from 1st to
2nd toll both: 100km/
(100km/hr)= 1 hr
A: 62 minutes
Introduction 1-6

Caravan analogy (more)

100 km
ten-car
caravan

toll
booth

100 km
toll
booth

cars now propagate at 1000 km/hr

toll booth now takes 1 min to service a car
Q: Will cars arrive to 2nd booth before all cars
serviced at 1st booth?
A: Yes! After 7 min, 1st car arrives at second booth; three
cars still at 1st booth.
1st bit of packet can arrive at 2nd router before packet is
fully transmitted at 1st router!
Introduction 1-7

Queueing delay

R: link bandwidth (bps)

L: packet length each packet
(bits)
a: average packet arrival rate
La/R: Traffic Intensity

Theoretically:
La/R > 1: more work arriving than can be serviced, average delay
infinite!
La/R < 1: Nature of arriving traffic impact queuing delay.
Ideally, traffic intensity = 1
Introduction 1-8

Questions ?
Q.
Out of four types of delays, which one can vary from packet to
packet ??

COMPUTER NETWORKS
9

11/5/16

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

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
buffer
previous node,
by
source
end
system,
packet being
transmitted
(waiting
area)
A
or not at all
B

packet arriving to
full buffer is lost
BITS Pilani, Deemed to be University under Section Introduction
3 of UGC Act,1-10
1956

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

link
capacity
that
can carry
server,
server
sendswith
bits pipe
fluid
at rate
file of
F bits
(fluid)
into
pipe
Rs bits/sec
to send to client
Rs bits/sec)

link that
capacity
pipe
can carry
at rate
Rfluid
c bits/sec
Rc bits/sec)

BITS Pilani, Deemed to be University under Section Introduction

3 of UGC Act,1-11
1956

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

Time to transfer a large file of F bits from S to C (ignoring

allbottleneck
delays) =link
F / min (Rs, Rc)
link on end-end path that constrains end-end throughput
BITS Pilani, Deemed to be University under Section Introduction
3 of UGC Act,1-12
1956

Throughput: Internet scenario

per-connection

end-end
throughput:
min(Rc,Rs,R/10)
in

practice: Rc
or Rs is often
bottleneck

Rs
Rs

Rs
R

Rc

Rc
Rc

10 connections (fairly) share

backbone bottleneck link R bits/sec
BITS Pilani, Deemed to be University under Section Introduction
3 of UGC Act,1-13
1956

Questions ?
Q. How long does it take a packet of length 1000 bytes to
propagate over a link of distance 2500 Km, propagation speed
2.5x108 m/s, and transmission rate 2 Mbps ? Ignore queuing
and processing delay here.
Propagation delay = (2500 x 1000) / (2.5 x 108) sec = 0.01 sec
Transmission delay = L / R = (1000 x 8) / (2x106) sec = ?

COMPUTER NETWORKS
14

11/5/16

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Questions ?
Consider two hosts, A and B, connected by a single link
of rate R bps. Suppose that the two hosts are
separated by m meters, and suppose the propagation
speed along the link is s meters/sec. Host A is to send a
packet of size L bits to Host B.
Express the propagation delay dprop in terms of m and s.
Determine the transmission time of packet, d trans, in terms of L
and R.
Ignoring processing and queuing delays, obtain an expression for
the end-to-end delay.
Suppose Host A begins to transmit the packet at time t = 0. At
time t = dtrans, where is the last bit of the packet?
Suppose dprop is greater than dtrans. At time t = dtrans, where is the
first bit of the packet?
Suppose s = 2.5 x 108, L = 100 bits, and R = 28 kbps. Find the
distance m so that dprop equals dtrans.
COMPUTER NETWORKS

15

11/5/16

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

BITS Pilani
Pilani|Dubai|Goa|Hyderabad