Network Delays in Computer Networks + End-to-End Delay Calculation (200 MB over 1 Gbps with 3 Routers)
Network Delays in Computer Networks + End-to-End Delay Calculation (200 MB over 1 Gbps with 3 Routers)
In computer networks, the time a message takes to travel from a source host to a destination host is called network delay (often discussed as latency). A packet experiences multiple components at each hop (router-to-router or host-to-router), commonly modeled as:
keyword Transmission delay
keyword Propagation delay
keyword Queuing delay
keyword Processing delay
A standard breakdown is that nodal delay equals the sum of processing, queuing, transmission, and propagation delays at each router, and end-to-end delay accumulates these across hops. 2
Footnotes
-
Network delay - Wikipedia https://en.wikipedia.org/wiki/Network_delay - Defines processing, queuing, transmission, and propagation delay as components of network delay. ↩
-
Delay and Loss in Packet-Switched Networks (delay formulas, transmission L/R, end-to-end accumulation) http://www2.ic.uff.br/~michael/kr1999/1-introduction/1_06-delay.htm - Gives , propagation as distance/s, and end-to-end accumulation of nodal delays. ↩
Transmission and Propagation Delay (types of network delay)
Types of Delays (What they mean and why they matter)
1) Processing delay ()
This is the time a router (or switch) takes to process the packet header—e.g., checking bit-level errors, determining the outgoing interface, updating header fields, etc.
2) Queuing delay ()
When the router is busy transmitting other packets, an arriving packet must wait in a queue. The queuing delay depends on traffic intensity/congestion and buffer state. 2
3) Transmission delay ()
Transmission delay is the time required to put all bits of the packet onto the link. If the packet has length bits and the link transmits at rate bits/s (bandwidth in this context), then:
- This is sometimes called the “store-and-forward delay” component for packet switching analysis. 2
4) Propagation delay ()
Propagation delay is the time for the signal to travel from one node to another through the transmission medium. If distance is and propagation speed is , then:
- It depends on distance and medium speed, not directly on packet size. 2
Footnotes
-
Network Delay (types: processing and queuing delay and other components) https://nsrc.org/workshops/2019/ubuntunet-nren-noc/netmgmt/en/smokeping/types-of-delay.pdf - Describes processing delay and queuing delay concepts and their causes. ↩ ↩2
-
Delays in Computer Network (transmission vs propagation, formula overview) https://www.geeksforgeeks.org/computer-networks/delays-in-computer-network - Provides practical overview and formulas for transmission and propagation delay. ↩ ↩2
-
Network delay - Wikipedia https://en.wikipedia.org/wiki/Network_delay - Defines processing, queuing, transmission, and propagation delay as components of network delay. ↩
-
Delay and Loss in Packet-Switched Networks (delay formulas, transmission L/R, end-to-end accumulation) http://www2.ic.uff.br/~michael/kr1999/1-introduction/1_06-delay.htm - Gives , propagation as distance/s, and end-to-end accumulation of nodal delays. ↩ ↩2
Total delay for the given network (200 MB, 1 Gbps, 3 routers; other delays = 0)
- 1Step 1
With 3 routers between A and B, the packet traverses 4 links total: A→R1, R1→R2, R2→R3, and R3→B. With only transmission/propagation considered and processing/queuing set to 0, the per-link delays simplify to transmission + propagation.
- 2Step 2
200 MB bytes bits bits.
- 3Step 3
"Bandwidth is 1 Gbps bits/s. So per link transmission delay is
- 4Step 4
The problem states other delays equal to 0. Under the usual interpretation, this includes propagation delay, so per link.
- 5Step 5
Total delay across 4 links is $$d_{total} = 4\times d_{trans} = 4\times 1.6 = 6.4\text{ s}.$
Per-link delay components (given assumptions)
Processing and queuing are 0; propagation assumed 0 as “other delays equal 0”. Only transmission contributes.
Key modeling point
"When routers are modeled with store-and-forward transmission, transmission delay of is incurred on each link, so end-to-end delay scales with the number of links (hops), not just with the number of routers." 2
Footnotes
-
Network delay - Wikipedia https://en.wikipedia.org/wiki/Network_delay - Defines processing, queuing, transmission, and propagation delay as components of network delay. ↩
-
Delay and Loss in Packet-Switched Networks (delay formulas, transmission L/R, end-to-end accumulation) http://www2.ic.uff.br/~michael/kr1999/1-introduction/1_06-delay.htm - Gives , propagation as distance/s, and end-to-end accumulation of nodal delays. ↩
Ambiguity to watch for
"Some problems say “other delays = 0” but still intend propagation to be nonzero. If propagation distance/speed were given, you’d add per link; here the statement implies propagation is also 0, yielding a pure transmission-time total. Always check whether propagation is explicitly provided." 2
Footnotes
-
Delay and Loss in Packet-Switched Networks (delay formulas, transmission L/R, end-to-end accumulation) http://www2.ic.uff.br/~michael/kr1999/1-introduction/1_06-delay.htm - Gives , propagation as distance/s, and end-to-end accumulation of nodal delays. ↩
-
Delays in Computer Network (transmission vs propagation, formula overview) https://www.geeksforgeeks.org/computer-networks/delays-in-computer-network - Provides practical overview and formulas for transmission and propagation delay. ↩
Quick FAQ (common exam interpretations)
Delay Component Mastery
Knowledge Check
With 3 routers between A and B, how many link traversals (hops/segments) does the packet experience?
Explore Related Topics
Computer Networks: Architecture, Protocols, Operation, and Security
The course covers the fundamentals of computer networking, including architecture, layered models, addressing, switching/routing, transport protocols, application services, and security principles.
- Packet switching and layered OSI/TCP‑IP models explain how data moves from application to physical media.
- Hosts, switches, routers, and topologies (star, mesh, etc.) define network components and forwarding behavior.
- Addressing uses MAC, IPv4/IPv6, ports, and DNS with CIDR subnets for routing.
- TCP provides reliable delivery, UDP/QUIC offer low‑overhead alternatives, and TLS secures traffic.
- Security uses firewalls, segmentation, VPNs, and designs for availability (e.g., ).
Moving from Stop-and-Wait ARQ to Go-Back-N ARQ: Reasons and Performance Implications
Round Robin Scheduling Analysis for Five Processes with Time Quantum 3 ms