About this simulator
Queuing delay is the time a packet waits in a router's buffer before it can be transmitted. Unlike the other delays it changes from packet to packet and depends on traffic. This simulation runs a real first-in-first-out queue so you can compare a burst of packets with steady and random arrivals and see how traffic intensity decides everything.
How it works
- Packets arrive at the router and join a FIFO queue if the link is busy transmitting another packet.
- Each packet waits for every packet ahead of it to finish transmitting ( each).
- If the arrival rate times the packet length exceeds the link rate () the queue grows without bound.
Formulas used
Worked example
Five 1,500-byte packets arrive together at a 10 Mbps link (each takes to transmit). The first waits , the second , then , and . The average is , exactly . With traffic intensity above 1 the waits keep growing without limit.
Enter these numbers in the simulator above to see every step.
When to use it
- Practising the average queuing delay for a burst of N packets.
- Seeing why buffers fill when arrival rate times packet size exceeds the link rate.
- Comparing steady traffic with random (Poisson) arrivals.
Frequently asked questions
What is traffic intensity?
Traffic intensity is : the average packet arrival rate times the packet length , divided by the link rate . When it is below 1 the queue stays bounded; at or above 1 the queue grows without bound.
How do you calculate queuing delay for N packets arriving at once?
The -th packet waits . The average over packets is .
Why does queuing delay change from packet to packet?
Each packet finds a different number of packets ahead of it, so unlike transmission or propagation delay it depends on traffic, not just on the packet and the link.