About this simulator
Every router a packet crosses adds a nodal delay made of four parts: processing, queuing, transmission and propagation. This simulation moves packets across a chain of routers so you can see them waiting in queues, being transmitted and travelling along links, and read off the end-to-end delay.
How it works
- At each router a packet is processed, waits if the output link is busy, is transmitted bit by bit and then propagates to the next node.
- Packets sent back to back queue behind each other at the first link; later links rarely queue if all rates are equal.
- End-to-end delay of one packet over hops of .
Formulas used
- over every hop
Worked example
One 1,500-byte packet crosses 4 links of 10 Mbps with 2 ms propagation per link and 0.5 ms processing at each of the 3 routers. End-to-end delay . Send four packets back to back and the last one arrives later because packets queue behind each other at the first link.
Enter these numbers in the simulator above to see every step.
When to use it
- Practising end-to-end delay questions with several hops.
- Seeing exactly where queues form when packets are sent back to back.
- Explaining how spacing out packets removes queuing delay.
Frequently asked questions
What is end-to-end delay?
It is the total time from the first bit leaving the source to the last bit arriving at the destination: the sum of nodal delays over every hop.
Why do back-to-back packets wait at the first link?
The link can send only one packet at a time, so the later packets wait in the buffer for the earlier ones to be transmitted.
Which delay can be zero?
Queuing delay is zero when the link is idle on arrival. Transmission and propagation delays are never zero for real links.