Recall warm-up
- Does a virtual circuit reserve link capacity?
Stuck? Peek at 1.2.3 Virtual circuits and the full comparison
- Virtual circuit: setup chooses a path, switches store (in-link, in-VCI → out-link, out-VCI); packets carry short VCIs; no link capacity reserved.
- Connection-oriented: circuit, VC. Connectionless: datagram.
- Setup? reserved? per-packet routing? → circuit Y/Y/N · VC Y/N/N · datagram N/N/Y.
- Order kept by circuit and VC; datagrams may reorder.
- Rate of one of 24 circuits on a 1.536 Mbps link?
Stuck? Peek at 1.2.1 Circuit switching: setup, reserved resources, teardown
- Circuit switching: setup → data transfer → teardown.
- Dedicated path; each link's share (time slot or frequency band) is reserved: circuit rate = R/n.
- Total time = setup + bits/circuit rate (+ travel time if given).
- + guaranteed rate, in order, no queues; − setup delay, idle capacity wasted, fragile.
- How many bits are in 1500 bytes?
Stuck? Peek at 0.2.1 Bits, bytes and prefixes: powers of 10 for rates, powers of 2 for sizes
- 1 B = 8 b. Lower-case b = bit, upper-case B = byte.
- Rates: k = 10³, M = 10⁶, G = 10⁹ (bps).
- Sizes: K = 2¹⁰, M = 2²⁰, G = 2³⁰ (bytes) — unless the question says 1000.
- Time to push out = (size in bits) ÷ (rate in bit/s).
- ms = 10⁻³ s, µs = 10⁻⁶ s, ns = 10⁻⁹ s.
The Hook
A toll booth lets cars through at one car every 12 seconds. A convoy of 10 cars needs 2 minutes just to get through the booth, no matter how fast the road beyond is. Pushing bits onto a link is the toll booth of networking: it takes time proportional to how many bits you have and inversely proportional to the link's speed.
Predict First
A 1000-byte packet is put onto a 1 Mbps link. How long until its last bit has left the sender: 1 ms, 8 ms, or 1 s?
,8 ms. 1000 bytes = 8000 bits; at 10⁶ bits per second that takes 8000 / 10⁶ = 0.008 s. This is the transmission delay.
Core Concept
Bandwidth and data rate
(Engineers also use "bandwidth" for a range of frequencies in Hz; in GATE networking numericals it always means the bit rate.)
Transmission delay
It depends only on the size and the link rate — not on distance.
Throughput
End to end it can never exceed the slowest link on the path, the bottleneck: throughput ≤ min(B₁, B₂, …).
Putting it together
- Bandwidth is capacity; throughput is what is actually achieved.
- Transmission delay L/B is the time to push all bits onto the link.
- The slowest link caps end-to-end throughput.
Visual
| Quantity | Symbol | Formula | Depends on |
|---|---|---|---|
| Bandwidth (data rate) | B | given | link technology |
| Transmission delay | Tt | L / B | unit size, link rate |
| Throughput | — | bits delivered / time | bottleneck, waiting, losses |
Worked Examples
Transmission delay of a 1000-byte packet on a 1 Mbps link?
Show the full solution
8000 bits ÷ 10⁶ bit/s = 8 ms.
Transmission delay of a 1500-byte packet at 100 Mbps and at 1 Gbps?
Show the full solution
12,000 bits. At 10⁸ bit/s: 120 µs. At 10⁹ bit/s: 12 µs.
A 4 MB file (MB = 2²⁰ bytes) goes over a path whose links are 10 Mbps, 2 Mbps and 5 Mbps. Ignoring every delay except the bottleneck rate, how long does the transfer take (3 decimals)?
Show the full solution
Bottleneck = 2 Mbps. Bits = 4 × 2²⁰ × 8 = 33,554,432. Time = 33,554,432 / (2 × 10⁶) = 16.777 s.
GATE Traps
- Transmission delay does not depend on distance — a 1000 km link and a 1 m link of the same rate have the same Tt.
- Use bits on top: forgetting × 8 makes Tt eight times too small.
- Throughput is measured, bandwidth is capacity; a 100 Mbps link can show 40 Mbps throughput.
Memory Hook
"Transmission = toll booth": how long the whole convoy takes to pass the booth, however long the road.
Connect the Dots
We can now time the first part of our message's trip: getting onto the wire. Next (1.3.2): once the last bit is on the wire it still has to travel, and at routers it may wait — how do all the delays add up across several hops?
Self-Test
- NAT
Transmission delay (ms) of a 2000-byte packet on a 4 Mbps link?
Write your answer before opening the key.
- NAT
A 5 MB file (MB = 10⁶ bytes as stated) is received in 8 s. Throughput in Mbps?
Write your answer before opening the key.
- MCQ
Doubling the length of a link (same rate) changes the transmission delay by a factor of:
- 2
- 1/2
- 1 (no change)
- 4
- MSQ
A path has links of 100, 20 and 50 Mbps. Which are true?
- End-to-end throughput cannot exceed 20 Mbps.
- End-to-end throughput can reach 100 Mbps.
- The 20 Mbps link is the bottleneck.
- A 1250-byte packet has Tt = 0.5 ms on the 20 Mbps link.
- NAT
Transmission delay (µs) of a 64-byte unit at 10 Mbps?
Write your answer before opening the key.
Rule Card
- Bandwidth / data rate B = link capacity in bps (decimal prefixes).
- Tt = L / B (L in bits) — independent of distance.
- Throughput = bits delivered / time ≤ min link rate on the path (bottleneck).
Concept Ledger
- bandwidth (bit rate of a link)
- data rate
- throughput
- bottleneck link
- transmission delay Tt = L/B
Answer Vault
Try the questions first. Open when you are ready to check.
Warm-up answers
- No — only table entries in the switches.
- 64 kbps.
- 12,000.
Self-test answers
- 4 — 16,000 / 4 × 10⁶ = 0.004 s = 4 ms.
- 5 — 40 × 10⁶ bits / 8 s = 5 × 10⁶ bit/s.
- C — Tt = L/B does not involve distance.
- A: Distance affects travel time, not Tt.
- B: Distance affects travel time, not Tt.
- D: No dependence on distance at all.
- ACD — Bottleneck 20 Mbps; 10,000 bits / 20 × 10⁶ = 0.5 ms.
- B: The slowest link limits the whole path.
- 51.2 — 512 bits / 10⁷ = 51.2 µs.
Flashcards
- Transmission delay formula?
Reveal answer
Tt = L / B (bits ÷ bits per second). - Does Tt depend on distance?
Reveal answer
No. - End-to-end throughput bound?
Reveal answer
The minimum link rate on the path (bottleneck).
Exam shortcuts
- Tt in ms = (bytes × 8) ÷ (rate in kbps). — quick mental maths: 1000 B at 1000 kbps = 8000 / 1000 = 8 ms.
- End-to-end throughput ≤ min link rate. — single path, steady transfer; ignores waiting and losses (which only lower it further).