PacketLab

Follow a message from sender to receiver.

Inside the network

A level · GCSE enrichmentTick 0
S–A: 1 ticks; connected1tS–B: 1 ticks; connected1tA–C: 2 ticks; connected2tA–D: 3 ticks; connected3tB–C: 3 ticks; connected3tB–D: 2 ticks; connected2tC–E: 1 ticks; connected1tD–E: 1 ticks; connected1tE–T: 1 ticks; connected1tC–T: 4 ticks; connected4tD–T: 3 ticks; connected3tSender · 192.0.2.10↑Sender192.0.2.10Router A · 192.0.2.1ARouter A192.0.2.1Router B · 192.0.2.2BRouter B192.0.2.2Router C · 198.51.100.1CRouter C198.51.100.1Router D · 198.51.100.2DRouter D198.51.100.2Router E · 203.0.113.1ERouter E203.0.113.1Receiver · 203.0.113.20↓Receiver203.0.113.201234Pink = data · green ✓ = transport ACK · links show transit ticksSwipe the network ↔
Shared links · transport ACKs on

Packet inspector

HELL
Position / total
1 / 4
Source
192.0.2.10
Destination
203.0.113.20
State
Queued
Attempt
1

Journey this attempt

S

Numbering represents transport sequence information. IP itself does not guarantee ordering or delivery.

At the receiver

0/4 received · 0/4 acknowledged · 0 retries · 0 drops
·············
Arrival orderWaiting for the first packet…Inspect a chunk or click a router · model ticks, not real milliseconds

PacketLab learning guide

OCR H446 · 1.3.3 Networks · GCSE enrichment

Predict → Run → Investigate → Modify → Make

Start with First delivery. Predict which packet will arrive first, then Send. Pause and Step through model ticks. Select packets and routers to inspect them. Disconnect a link or add congestion. Finally, create a network experiment and explain its outcome.

Two layers, two responsibilities

Packets carry source and destination addresses. The numbering in this lab represents transport sequence information. IP is best effort: it does not acknowledge delivery or request retransmissions. Reliable mode adds simplified transport acknowledgements and sender timeouts, illustrating ideas used by TCP.

What the model simplifies

Messages are split by visible characters, not real MTU or byte boundaries. ACKs confirm individual chunks here; real TCP uses byte sequence numbers and usually cumulative acknowledgements. There is no TCP handshake, congestion window, DNS lookup, checksum or real network traffic. Routing uses an idealised current view of available links. Each link carries one data/ACK token at a time; the simplified attempt timer includes time queued at the sender. A tick is a teaching step, not a real time measurement.

Packet versus circuit switching

Packet mode shares links and can choose an alternative route after a break. Circuit mode spends two setup ticks reserving one path; if that path fails, this connection fails. Coloured data blocks are shown on the circuit only to make the comparison visible: circuit switching normally carries a stream over the reserved connection.

Classroom use

Use Basic for demonstrations and Advanced for hop limits, timeouts and retry experiments. Focus Mode hides site navigation. On desktop, the network, inspector and receiver share one screen; long history stays inside its panel. Small screens use a scrolling layout. Keyboard users can Tab to routers, links and packets and press Enter.

The eight challenges are independent and can be replayed. Their practice records stay on this device, separate from main-course progress.

Challenge solutions and teaching notes

01 · Follow the message

Prediction: At the receiver. Routers forward data; the destination uses sequence information to put the chunks back in order.

Practical evidence: All chunks delivered and acknowledged. Send starts the run. Pause and Step let you inspect each tick.

02 · Late to the party

Prediction: No, they can arrive first. Packets are forwarded independently. The receiving transport layer can buffer out-of-order data.

Practical evidence: Message complete; the first arrival is not P1. Keep the delayed-first-packet scenario. Watch the arrival-order row.

03 · Delivery is not a promise

Prediction: No, reliability needs a higher-layer protocol. IP provides best-effort delivery. A reliable transport such as TCP adds acknowledgement and retransmission mechanisms.

Practical evidence: Run ended with missing data and no retransmissions. The blank positions show data that never arrived. Wait until the run ends.

04 · Recover the missing piece

Prediction: A missing acknowledgement before timeout. A transport sender can use acknowledgements and timeouts to decide when to retransmit.

Practical evidence: Complete message and at least one retransmission. Leave reliable transport on. The sender waits for its timer before resending P1.

05 · Share the link

Prediction: Increase delay and queuing. Links have limited capacity. Waiting traffic and slower service increase delivery delay.

Practical evidence: Message complete and E–T no longer congested. Select E–T in the link controls, then turn off Congestion.

06 · Find another way

Prediction: No, an alternative path may remain. A network can remain connected through alternative links. Routing information must reflect usable paths.

Practical evidence: Complete message with A–C still down. Do not repair A–C. Inspect the available links through B, D and E.

07 · The reserved road

Prediction: The connection fails and needs a new circuit. This circuit model reserves one path for the connection. A failed path requires a new connection, rather than forwarding each block independently.

Practical evidence: The circuit run ends because a reserved link is down. After the two setup ticks, the reserved path is yellow. Select one of those links and disconnect it.

08 · Restore connectivity

Prediction: No, connectivity must be restored. Retransmission cannot repair a physical disconnection. At least one usable end-to-end path is needed.

Practical evidence: Message complete after a recorded no-route event. Turn off S–A and S–B before sending. After one tick, enable either link.

Curriculum and protocol references

Packet and circuit switching are in OCR A-level H446. Packet switching is enrichment for current GCSE J277; it is not a required J277 topic.

Back to Primm Tools