Draw two cities on a map and connect them with a straight line. It is a good beginning for thinking about distance, and a poor ending for thinking about an internet connection. The packet will travel through infrastructure operated by different organizations, under routing choices and measurement conditions the line does not show.

There are several maps hiding inside the word network. One represents physical locations. Another represents which networks exchange reachability information. Another represents the sequence of responding interfaces a particular probe discovers. A latency chart adds observations about time. Each is useful, but none can silently inherit all the meanings of the others.

What counts as a preferable route?

The BGP specification in RFC 4271 describes route selection in terms that include locally configured policy and degrees of preference. A network's preferred available route is therefore not simply a calculation of the shortest geographic distance between the two cities. The protocol carries reachability and path information through a decision process with explicit policy inputs.

This is understandable once networks are treated as organizations as well as diagrams. A connection has operational conditions, and different paths can be eligible or preferable under different policies. The base specification is not an exhaustive account of every modern extension or deployment. It is enough to dislodge the assumption that one global cartographer chooses a shortest line for every packet.

Consider two hypothetical routes between the same endpoints. One crosses fewer autonomous systems, but that fact alone does not tell us its physical length or current delay. The other may have a different policy preference. Without observations about the actual paths and traffic, a count of network names is a limited description of the journey.

The same caution applies in reverse. A route that looks geographically indirect is a question worth investigating. Its appearance alone is not a diagnosis of a mistake. A useful investigation asks which routing information and constraints were available to the relevant operators at that time.

A round trip contains two journeys

Now send a probe and measure how long it takes to receive a response. The result is concrete, but the meaning still requires a method. RFC 2681's round-trip delay metric discusses asymmetric forward and reverse paths, differences in queueing, and uncertainty contributed by the measurement endpoints. A round-trip measurement combines effects rather than isolating a single outward route.

In the hypothetical two-city connection, the outward trip could be quick and the return slow. Dividing the total by two produces an arithmetic average of those directions, not an independently measured one-way delay. The distinction matters if the application mostly sends a large stream one way or if the suspected problem lies on only one side.

Even the responding device participates in the result. The time it takes to generate a reply is part of a practical measurement unless accounted for. A probe is an experiment involving the network and its endpoints. Recording packet type, timing method, and observation period makes the number more portable than copying a single millisecond value into a slide.

Traceroute constructs a view

Traceroute is appealing because it gives the journey a visible sequence. Probes sent with increasing hop limits solicit responses from devices along the way. The resulting rows look like a path that one packet could have followed, which makes them easy to read as a literal itinerary.

The primary research on traceroute measurement artifacts and Paris traceroute shows why that interpretation can fail under load balancing. Varying probe fields can cause probes to follow different paths; combining their responses may suggest links or structures that do not represent one actual route. The authors designed Paris traceroute to control relevant fields and reduce artifacts associated with per-flow balancing.

This is a historical study of a measurement method, not a current census of every router. It also does not promise that one improved trace enumerates every path in every situation. Its lasting contribution is methodological: a tool's probes interact with the system they observe. Changing the probes can change which part of the network becomes visible.

For our invented connection, several responding addresses at a hop need not mean a packet visited all of them. A blank response need not mean that ordinary traffic cannot pass that point. The rows deserve interpretation as observations made by a method, rather than decorative coordinates on a ready-made route.

Keep the distribution in view

One latency number also hides variation. RIPE Atlas's LatencyMON documentation distinguishes minimum, middle, and maximum values and explains how aggregated probe groups can be separated. Those distinctions matter because a stable baseline, intermittent spikes, and missing observations tell different stories. A chart can clarify them or flatten them, depending on how it is read.

A proposed investigation of the fictional link would retain observations over time, identify the vantage points, and compare routing and timing changes without assuming that a coincidence proves a cause. It would inspect individual probes before treating a group average as the experience of everyone in a city. No such measurement was performed for this essay; the example describes how to frame the question.

The goal would be a claim proportionate to the observations: this probe, using this method, saw these delays during this interval, alongside this route information. That statement is less dramatic than announcing that a whole country has slow internet. It is also far easier for another investigator to examine and extend.

The internet's geography is real, but it reaches us through policy, machinery, and instruments. A map supplies context. Routing information supplies another view. Probes supply evidence with conditions. Put them together carefully and the connection becomes more understandable. Draw a straight line through all of them and much of the interesting network disappears.

About the author

Writer

I write about computing systems, from the meaning of a saved record to the work that turns a letter into pixels.

A thought worth keeping?