Skip to content

Routing

The process of computing and maintaining admissible network paths or next hops from topology, addressing, metrics, and policy so forwarding can deliver traffic toward destinations.

Version
v1 · 2026-09-28 · History
Domain-specific #
11853
Domain group
Applied Sciences & Engineering
Origin domain
Computer Science & Software Engineering
Subdomains
Computer Networking, Routing Protocols → Computer Science & Software Engineering
Aliases
Network routing

Core Idea

Routing is the decision layer of traffic movement. Static configuration or distributed protocols supply reachability and topology information; metrics and policy select paths; routing tables make those choices available to forwarding devices.

Forwarding then moves each packet or circuit according to installed state. Keeping this separation clear exposes convergence delays, stale routes, aggregation, loops, policy conflicts, and the difference between knowing a destination and successfully carrying traffic.

Structural Signature

Sig role-phrases:

  • Destination namespace — Identifies reachable nodes, prefixes, circuits, or services. It is target. Counterfactual: An unstructured label may require different lookup.
  • Network topology — Provides nodes, links, capacities, and failures. It is carrier. Counterfactual: A path cannot be selected without connectivity state.
  • Metric and policy — Rank admissible alternatives by cost and administrative constraints. It is criterion. Counterfactual: Shortest physical path need not be permitted.
  • Route computation — Chooses next hops or end-to-end paths from available information. It is operation. Counterfactual: Raw advertisements are not yet installed routes.
  • Routing table/control state — Records selected reachability for forwarding. It is output. Counterfactual: Stale state can loop or black-hole traffic.
  • Forwarding plane — Applies the chosen next hop to actual traffic. It is consumer. Counterfactual: Fast forwarding is distinct from path selection.

What It Is Not

  • It is not packet forwarding itself.
  • It is not identical to Ethernet bridging.
  • It is not always shortest-distance selection.
  • It is not guaranteed correct merely because a route was advertised.
  • Closest near-miss. Forwarding executes a next-hop decision for a packet; routing computes and maintains the state from which that decision is drawn.

Scope of Application

  • Internet routing. Selects interdomain and intradomain IP paths.
  • Telephony. Chooses circuits and fallback routes.
  • Data-center fabrics. Balances reachability and traffic engineering.
  • Ad hoc networks. Adapts to changing nodes and links.
  • Operations. Diagnoses convergence, loops, black holes, and policy.

Clarity

Record network layer, destination and prefix, topology source, protocol or static origin, metric, policy, administrative preference, selected next hop, alternatives, convergence time, aggregation, forwarding installation, failure behavior, and observed reachability.

Manages Complexity

Routing compresses a large network into per-destination decisions distributed across nodes. It enables scalable forwarding while hiding path computation, policy, and time-dependent consistency behind a simple next-hop entry.

Abstract Reasoning

  1. Define destinations and the forwarding layer.
  2. Acquire topology or reachability information.
  3. Filter routes by validity and policy.
  4. Rank alternatives under metrics and preferences.
  5. Install selected next hops into forwarding state.
  6. Monitor convergence and recompute after change.

Knowledge Transfer

The transferable cargo is path selection under constraints over a graph. It transfers to transport and logistics structurally, but network addressing, protocols, loops, and convergence must be retyped.

Examples

Applied / In Practice

Routers exchange reachability, apply metrics and policy, install best next hops, and reconverge after a link failure.

Mapped back: control → dynamic; output → forwarding state.

Applied / In Practice

An administrator configures a default route toward an upstream gateway, explicitly trading adaptability for simplicity.

Mapped back: route source → manual.

Applied / In Practice

A switch forwards an Ethernet frame using a learned MAC table; this is bridging unless a broader use of routing is explicitly declared.

Mapped back: layer → link.

Structural Tensions

T1 — Optimality versus Stability. Rapidly chasing a best path can cause oscillation during change.

Diagnostic: What convergence and damping rules apply?

T2 — Aggregation versus Specific Control. Summarized addresses scale tables but can obscure precise failure or policy distinctions.

Diagnostic: Which exceptions require specificity?

T3 — Local Policy versus Global Reachability. Independent choices can interact to produce loops or unreachable destinations.

Diagnostic: Are distributed decisions consistent enough?

Structural–Framed Character

Routing is hybrid: structurally constrained path selection and framed by protocol, addressing, distributed state, administrative policy, and network dynamics.

Structural Core vs. Domain Accent

The core maps destinations to selected paths or next hops. Networking adds routers, prefixes, metrics, advertisements, static routes, policy, convergence, aggregation, forwarding tables, loops, and failures.

This entry presupposes Network.

  • Approved root. No reviewed parent entails this network path-selection control process.

  • Related — forwarding, routing protocol, routing table, path selection, bridging, shortest path, BGP, OSPF, and traffic engineering. These are consumers, implementations, or neighbors.

Relationships to Other Abstractions

Local relationship map for RoutingParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.RoutingDOMAINPrime abstraction: Network — presupposesNetworkPRIMEDomain-specific abstraction: Autonomous system (Internet) — presupposesAutonomous syst…DOMAINDomain-specific abstraction: Link-state Routing — is a kind ofLink-stateRoutingDOMAIN

Current abstraction Routing Domain-specific

Parents (1) — more general patterns this builds on

  • Routing presupposes Network Prime

    Routing computes and maintains paths by which a network delivers traffic to destinations.

Children (2) — more specific cases that build on this

  • Link-state Routing Domain-specific is a kind of Routing

    Link-state routing is network routing with distributed local-link state and topology-derived route computation.

  • Autonomous system (Internet) Domain-specific presupposes Routing

    An Internet autonomous system is defined by the routing prefixes and common routing policy it presents; without routing the AS identity disappears.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Routing sits in a crowded region of the domain-specific corpus (31st percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Computer Systems & Network Architecture (20 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With

  • Forwarding. Tell: Executes installed next-hop state on traffic.
  • Bridging. Tell: Uses link-layer identities and learning under a different scope.
  • Pathfinding Algorithm. Tell: A computational component that need not handle distributed policy or forwarding state.
  • Traffic Engineering. Tell: Optimizes use of capacity and may influence or override ordinary routing.

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Routing (revision 1370185605).
  • Preserved source candidate: http://rainer.baumann.info/public/tik262.pdf
  • Preserved source candidate: http://www.eecs.harvard.edu/~michaelm/postscripts/handbook2001.pdf
  • Preserved source candidate: https://web.archive.org/web/20231213082735/https://www.eecs.harvard.edu/~michaelm/postscripts/handbook2001.pdf
  • Preserved source candidate: http://inspirehep.net/record/887357/files/cer-002474543.pdf
  • Preserved source candidate: https://web.archive.org/web/20190516092754/http://inspirehep.net/record/887357/files/cer-002474543.pdf
  • Preserved source candidate: https://www.researchgate.net/publication/323411017
  • Preserved source candidate: https://www.researchgate.net/publication/323723167
  • Preserved source candidate: http://www.st.ewi.tudelft.nl/~mathijs/publications/intinfra09.pdf

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.