Scribd
Upload
9 views

Delay Loss Throughput

The document discusses how packet loss and delay occur in computer networks. Packets can queue up in router buffers if the arrival rate exceeds the link capacity. This causes packets to experience queueing delay while waiting to be transmitted. There are four main sources of packet delay: transmission, propagation, nodal processing, and queueing.

Uploaded by

Heba Stay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Delay Loss Throughput

The document discusses how packet loss and delay occur in computer networks. Packets can queue up in router buffers if the arrival rate exceeds the link capacity. This causes packets to experience queueing delay while waiting to be transmitted. There are four main sources of packet delay: transmission, propagation, nodal processing, and queueing.

Uploaded by

Heba Stay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

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-43
Four sources of packet delay
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
 determine output link for transmission
 typically < msec  depends on congestion
level of router
Introduction 1-44
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 medium
 dtrans = L/R (~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-45
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
 toll booth takes 12 sec to booth onto highway =
service car (bit transmission 12*10 = 120 sec
time)  time for last car to
 car~bit; caravan ~ packet propagate from 1st to
 Q: How long until caravan is 2nd toll both:
lined up before 2nd toll 100km/(100km/hr)= 1
booth? hr
 A: 62 minutes
Introduction 1-46
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-47
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-48

You might also like