computer-science transportation

​

Multi hop routing

​

Description

A pattern where items cannot travel direct from source to destination but instead transit intermediate hubs, each of which knows only how to forward to the next hop — not where the cargo ultimately ends up. The routing topology is a structural primitive distinct from both the cargo and any individual hop: the same topology routes anything, and the same cargo can flow through different topologies. The diagnostic shape: source → A → B → C → destination, where A doesn’t know about destination; A only knows about B. The concept is structurally distinct from loop-completion (which is about closure of a route through hubs — the diagnostic question is “does the route close?”), from flow (which is about directed substance-movement — the diagnostic question is “what flows?”), and from asymmetric-gate (which is about boundary checks at hops — the diagnostic question is “can crossing happen?”). Multi-hop-routing’s diagnostic question is “what does each hop know, and what does it not need to know?”

​

Triggers

User-initiated: User describes indirect routing, hops, intermediate forwarding, transit, or “X goes to Y via Z.” Vocabulary cues: “multi-hop,” “transit,” “relay,” “forwarding,” “next hop,” “hub,” “broker,” “gateway.” Agent-initiated: Agent notices a system where transit happens via intermediate stages that don’t know the full path. Candidate inference: “what’s the per-hop information; what does each hub know about the topology?” Situation-shape signals: Systems where you can’t directly connect source to destination. Conversations about routing protocols, transit, or “how does X get to Y from here.” Architectural discussions involving brokers, gateways, or message buses.

​

Exclusions

• Direct point-to-point — when source and destination are directly connected, there are no intermediate hubs. The concept doesn’t fire.
• Broadcast / flood — when “routing” means “everyone gets it,” there’s no per-hop next-hop decision; the topology is the whole graph.
• Routes encoded in the cargo itself — source-routed packets (IP source routing; some carrier-pigeon scenarios) put the full path in the message; multi-hop-routing’s defining property is per-hop local-only decisions.
• Trivially-known topology — if every hop knows the full destination explicitly, the concept collapses to “directed graph traversal” without the load-bearing per-hop-locality insight.

​

Structure

​

Relationships

• shape — the routing topology is shape independent of cargo.
• stack-layer — each hop is a layer; the routing decision often happens at the layer boundary; OSI model frames this explicitly.
• seam — hop boundaries are seams; the routing decision lives at the seam.
• flow — multi-hop-routing is flow through a non-direct topology; the topology is what distinguishes it from simple source-to-destination flow.
• grain — what counts as a single hop is a grain choice; an “L1 hop” might be one BGP-router; an “L2 hop” might be one ASN; the choice changes the analysis.

​

Examples