The Internet's Plumbing: Where Packets Actually Go

Mailing a birthday card sounds simple — until you count the steps. You drop it in a mailbox, a truck carries it to a sorting center, workers sort it onto another truck, and a carrier walks it to the right door. Every handoff adds hours. A message between two computers takes the same kind of journey — through machines instead of post offices — but each handoff adds only a tiny fraction of a second. Miss one stop on the route and the card never arrives; skip measuring one handoff and the delay stays invisible. This lesson traces that journey, machine by machine, and shows where every bit of waiting sneaks in.

Here's the puzzle.

Scenario. A trader working from home complains that their orders feel sluggish — "like shouting through a long hallway." You get the full route their messages take from their home computer to the exchange's matching computer, with each handoff's delay measured. One of the handoffs is wildly out of family with the rest. The trader wants three things: the total one-way delay, the culprit, and the right question to ask whoever runs that piece.

Given artifacts. The path exhibit: every stop in order, each with its measured delay. Delays are one-way (home → exchange).

PATH EXHIBIT — home PC to exchange (one-way delays, measured)
---------------------------------------------------------------
1. Home PC → home router ............ 0.05 ms   (your own desk to your own box)
2. Home router → internet provider .. 1.0 ms   (your box to the provider's door)
3. Provider → backbone hop 1 ........ 2.0 ms   (entering the long-haul network)
4. Backbone hop 1 → hop 2 ........... 2.0 ms   (crossing the country)
5. Backbone hop 2 → hop 3 ........... 80.0 ms  ← measured three times, same result
6. Hop 3 → exchange's front door ..... 1.0 ms   (leaving the long-haul network)
7. Exchange front door → matching
   computer ......................... 0.05 ms  (inside the exchange's building)

Your task: Add up the total one-way delay (show the addition), name which hop is the problem, and write the one sentence you'd say to whoever runs that hop.

Workspace. Analyze-and-answer: a text box for your addition, the culprit hop, and your one-sentence question. Submitting is optional — the ritual below is what unlocks the worked answer.

Hint ladder.

Commitment ritual. ☐ "I've attempted this challenge and thought it through." Check the box (or submit an answer above) and the worked answer in S7 reveals. Nothing is graded; the struggle is the point.

Messages travel as envelopes

Computers never send a message as one continuous stream. They chop it into packets (in plain English: small envelopes, each carrying a piece of the message plus a label saying where it's going and which piece it is). The receiving computer collects the envelopes and reassembles the message. If one envelope goes missing, only that piece is re-sent — not the whole message.

Why chop at all? Because the road is shared. Thousands of computers' envelopes interleave on the same cables, like cars merging on a highway. Small envelopes keep any single message from hogging the road, and they let each envelope take whatever route is fastest at that moment. Every delay in this lesson is measured per envelope — and your message's total wait is the sum of every envelope's journey.

Why this matters for the challenge: the delays in the exhibit are per-handoff waits for these envelopes. The total is a sum because each envelope pays every handoff's toll in turn.

The mailbox on every computer

Every computer connects to the network through a network card (in plain English: the computer's mailbox and door — the physical plug where the cable goes in, plus the chip that puts envelopes onto the wire and takes them off). When your computer sends a message, the network card wraps each piece in an envelope, labels it, and pushes it onto the cable. When a message arrives, the card unwraps envelopes and hands the pieces to the computer.

The network card adds a tiny delay — tens of microseconds — because wrapping, labeling, and pushing take real work. It's the first handoff in every journey and the last one, and on a fast trading computer, engineers obsess over making this step as quick as physically possible. In your exhibit, the 0.05 ms steps at both ends are these mailbox handoffs.

Why this matters for the challenge: hops 1 and 7 are the mailboxes — small, normal, and not the problem. Knowing what's supposed to be small helps you spot what isn't.

Cables are roads; intersections decide the route

Between mailboxes run cables (in plain English: the roads — usually fiber-optic strands carrying pulses of light). Light in fiber is fast but not instant: roughly 5 microseconds per kilometer. A cross-country cable is thousands of kilometers, so distance alone contributes real, unavoidable delay. This is why trading firms pay fortunes to be physically close to the exchange — you cannot negotiate with the speed of light.

Where roads meet, you need intersections. A switch (in plain English: a local intersection that reads each envelope's label and sends it out the right road — fast, simple, one neighborhood) handles traffic inside one building or campus. A router (in plain English: a bigger intersection that chooses between whole highways — it reads the destination and picks which long-distance road each envelope takes) connects networks to networks. Switches and routers each add a small delay — microseconds — because reading a label and choosing a road takes a moment. Your exhibit's middle hops are these intersections chained together.

Why this matters for the challenge: hops 3–6 are the intersections and highways. They should all cost roughly the same small delay — which is exactly why one of them sticking out is a clue, not a coincidence.

Every handoff adds up — and the worst one wins

Here's the rule that runs this lesson: total delay is the sum of every handoff, and one bad handoff dominates the total. Six healthy 3 ms hops plus one 90 ms hop isn't a 108 ms trip with a small blemish — it's a trip where a single intersection contributes over 80% of the wait. Fixing the six good hops to zero would barely move the needle; fixing the one bad hop transforms the journey.

This is the single most useful instinct in network troubleshooting: don't average, don't admire the healthy parts — find the outlier. Engineers call the slowest handoff the bottleneck (in plain English: the narrowest part of the road, where everything queues up — the one stretch that sets the pace for the whole trip). In trading, where microseconds are money (Lesson 3), a bottleneck you don't know about is a tax you pay on every single trade.

Why this matters for the challenge: the addition gives you the total, but the real deliverable is the outlier. The sentence you write to the hop's owner is the beginning of every real troubleshooting conversation.

• Messages travel as packets — small labeled envelopes — so many computers can share the roads and only lost pieces get re-sent.
• Every computer's network card is its mailbox: it wraps, labels, and pushes envelopes onto the wire, adding the first and last small delay.
• Cables are roads (light in fiber: ~5 μs per km) and switches/routers are the intersections that read labels and choose roads — each adds its own small delay.
• Total delay is the sum of every handoff, so one bad handoff dominates: find the outlier by comparing each hop against same-job neighbors.
• The slowest handoff — the bottleneck — sets the pace for the whole trip, and in trading it's a tax paid on every single trade.

Next: Why Trading Needs Its Own Special Network — you can now trace every hop and spot the bottleneck; next you'll learn why a trading firm refuses to race on the public roads at all.