Interactive end-of-chapter exercises


Queuing Delay

Consider the queuing delay in a router buffer, where the packet experiences a delay as it waits to be transmitted onto the link. The length of the queuing delay of a specific packet will depend on the number of earlier-arriving packets that are queued and waiting for transmission onto the link. If the queue is empty and no other packet is currently being transmitted, then our packet’s queuing delay will be zero. On the other hand, if the traffic is heavy and many other packets are also waiting to be transmitted, the queuing delay will be long.

Assume a constant transmission rate of R = 1900000 bps, a constant packet-length L = 4100 bits, and a is the average rate of packets/second. Traffic intensity I = La/R, and the queuing delay is calculated as I(L/R)(1 - I) for I < 1.



Question List


1. In practice, does the queuing delay tend to vary a lot? Answer with Yes or No

2. Assuming that a = 36, what is the queuing delay? Give your answer in milliseconds (ms)

3. Assuming that a = 88, what is the queuing delay? Give your answer in milliseconds (ms)

4. Assuming the router's buffer is infinite, the queuing delay is 0.332 ms, and 950 packets arrive. How many packets will be in the buffer 1 second later?

5. If the buffer has a maximum size of 921 packets, how many of the 950 packets would be dropped upon arrival from the previous question?




Solution


1. Yes, in practice, queuing delay can vary significantly. We use the above formulas as a way to give a rough estimate, but in a real-life scenario it is much more complicated.

2. Queuing Delay = I(L/R)(1 - I) * 1000 = 0.0777*(4100/1900000)*(1-0.0777) * 1000 = 0.1546 ms.

3. Queuing Delay = I(L/R)(1 - I) * 1000 = 0.1899*(4100/1900000)*(1-0.1899) * 1000 = 0.332 ms.

4. Packets left in buffer = a - floor(1000/delay) = 950 - floor(1000/0.332) = 0 packets.

5. Packets dropped = packets - buffer size = 950 - 921 = 29 dropped packets.



That's incorrect

That's correct

The answer was: Yes

Question 1 of 5

The answer was: 0.1546

Question 2 of 5

The answer was: 0.332

Question 3 of 5

The answer was: 0

Question 4 of 5

The answer was: 29

Question 5 of 5

Try Another Problem

We’d appreciate your leave us feedback on this networking tutor.

We gratefully acknowledge the programming and problem design work of John Broderick (UMass '21), which has really helped to substantially improve this site. The networking tutor was designed and implemented by Hashim Zia and Shayan Ahmad from New York University Abu Dhabi.

Copyright © 2010-2025 J.F. Kurose, K.W. Ross
Comments welcome and appreciated: kurose@cs.umass.edu