- Atlas
- Computer Science
- Routing And Internetworking
Routing And Internetworking
Routing is the set of decisions that determine where a packet of data goes next.
11 frameworks, from 1961 to today · Networks · Computer Science
- Packet Switching 1961-Present
- Internet Protocol 1974-Present
- Distance-vector routing protocol 1975-Present
- Link-state routing protocol 1978-Present
- Interdomain Policy Routing 1989-Present
- Classless Inter-Domain Routing 1993-Present
- Network Address Translation 1994-Present
- List of IPv6 transition mechanisms 1998-Present
- Routing Security and Origin Validation 2008-Present
- Software-Defined Networking 2008-Present
- Segment Routing 2013-Present
Overview
Routing is the set of decisions that determine where a packet of data goes next1. Internetworking is the larger project of joining many separate networks into one that behaves, more or less, like a single network2. The two are inseparable: the moment you connect two networks, someone has to decide which traffic crosses the boundary and by what path. What is at stake is coordination without central control. No one owns the Internet, yet billions of machines route packets across it every second. The history of this subfield is the story of how engineers built that coordination out of local decisions, and of the repeated crises—scale, address exhaustion, security, and the tension between automation and policy—that forced each new layer of machinery into being.
Packet switching and the first routing problem
The founding idea was packet switching, developed in the 1960s in work by Paul Baran at RAND and Donald Davies at the UK's National Physical Laboratory, and realized in the ARPANET, whose first link connected UCLA and Stanford Research Institute in 1969. Instead of reserving a circuit, packet switching chops messages into small units that share links statistically. That immediately raised the routing question: with no reserved path, each packet needs a next hop chosen at the moment it travels.
ARPANET's early answer was a distributed, adaptive scheme3. Each node kept a table of the least-delayed path to every destination and updated it by exchanging delay estimates with neighbours. The lesson learned painfully in the early 1970s was that adaptive schemes can oscillate—everyone shifts to the "best" path, congesting it, then shifts away. The fix was to damp updates and to separate the algorithm (how paths are computed) from the protocol (how routers exchange what they know). That separation has organized the field ever since.
Two families of routing algorithms
By the late 1970s two competing approaches had crystallized, and their rivalry still structures routing.
Distance-vector routing has each router tell its neighbours its own estimate of the distance to every destination; a router adopts a neighbour's route if going through that neighbour is shorter13. It is simple and needs little memory, but it converges slowly and suffers from the "count-to-infinity" problem, where a broken link is advertised around a loop and distances creep upward. The classic remedy, split horizon with poisoned reverse, was refined through the 1970s and 1980s. The Routing Information Protocol (RIP), standardized in the 1980s, is the canonical distance-vector protocol34.
Link-state routing takes the opposite approach: each router floods the network with the state of its own links, so every router builds an identical map of the whole topology and runs Dijkstra's shortest-path algorithm on it15. The idea descends from work at BBN and elsewhere in the late 1970s; the Open Shortest Path First (OSPF) protocol, developed in the late 1980s and standardized in the early 1990s, became its dominant embodiment, alongside IS-IS, which had been developed for the ISO protocol suite. Link-state converges faster and avoids loops, at the cost of memory and flooding overhead. The trade-off—simple and local versus complete and costly—is a recurring theme.
Internetworking: the Internet Protocol
The decisive move came with the design of the Internet Protocol by Vint Cerf and Bob Kahn, published in 1974 and refined into IPv4 in 198167. Their insight was to make the network's job minimal: a common packet format and a common addressing scheme, with no guarantee of delivery, ordering, or reliability. Reliability would live in the endpoints—the end-to-end principle later articulated by Jerome Saltzer, David Reed, and David Clark in 1984. This "best-effort" datagram model let wildly different underlying networks (ARPANET, satellite links, Ethernet, radio) interconnect, because the only thing they had to agree on was the IP header.
The corollary was that routing had to be hierarchical. Within an organization, routers could use whatever interior protocol suited them; between organizations, they needed a common exterior protocol. The terms interior gateway protocol and exterior gateway protocol date from this period. The first widely used exterior protocol, EGP, appeared in the early 1980s; it was replaced by the Border Gateway Protocol (BGP), first specified in 1989 and brought to version 4 in 1994.
Interdomain policy routing and the rise of BGP
BGP solved a problem the interior protocols could not: the Internet is not one administrative domain but tens of thousands, each owned by a different party with its own commercial and political interests. A path between two networks is not chosen for shortness but for policy—who is willing to carry whose traffic, and on what terms. BGP lets each network (an autonomous system) advertise the routes it will accept and the paths it offers, and each chooses among them by local rules89. The result is a routing system that is decentralized, path-vector rather than distance-vector (it carries the full AS path, which also serves to detect loops), and fundamentally about trust and business relationships rather than optimality.
This design made the Internet scale, but it also made it fragile in ways that would take decades to confront. BGP has no built-in authentication: a network can, by misconfiguration or malice, advertise routes it does not own and hijack traffic. Notable incidents—such as the 2008 leak by Pakistan Telecom that briefly took YouTube offline worldwide—made the vulnerability concrete.
Scaling the address space: classless routing and NAT
IPv4's original addressing divided the world into fixed classes (A, B, C), a scheme that wasted addresses badly. By the early 1990s exhaustion was in sight10. Two responses reshaped routing.
Classless Inter-Domain Routing (CIDR), introduced in 1993, abandoned fixed classes for arbitrary-length prefixes and, crucially, allowed route aggregation: many contiguous addresses could be advertised as one prefix, keeping global routing tables from exploding11. CIDR also made longest-prefix matching the core forwarding operation—a router picks the most specific matching route12.
Network Address Translation (NAT) let many devices share one public address by rewriting addresses at the boundary10. NAT was conceived as a short-term fix but became pervasive, and it changed the Internet's topology: it made the end-to-end principle conditional, since hosts behind NAT are not directly reachable. Together, CIDR and NAT bought decades of life for IPv4.
IPv6 and the long transition
The long-term answer was a new protocol with a vastly larger address space. IPv6 was designed through the early 1990s and standardized in 1998. It also simplified the header and was meant to restore end-to-end addressing. But deployment has been slow and incremental, and the field's real history is one of coexistence: dual-stack hosts running both protocols, tunnelling IPv6 over IPv4, and translation mechanisms at the boundary. The transition is still incomplete, and the coexistence machinery—not the clean replacement—is what practitioners actually built.
Securing the routing system
Because BGP trusts what it is told, the 2000s and 2010s saw a sustained effort to add verification. The Resource Public Key Infrastructure (RPKI) lets address holders certify which networks are authorized to originate which prefixes, so routers can validate route origins13. The approach is real and deployed, but partial: it secures origin, not the full path, and adoption has been uneven. The open question—how to secure interdomain routing without breaking its decentralized, policy-driven character—remains live.
Separating control from forwarding: SDN and segment routing
The most recent turning point reverses an assumption. Traditionally every router ran its own control software, computing routes independently. Software-Defined Networking pulls the control logic out into a separate, programmable controller that computes paths centrally and installs them in the switches, which become simple forwarders14. The idea grew from earlier work on separating control and data planes and on programmable networks in the 2000s; the OpenFlow protocol, around 2008, gave it a concrete interface, and it became widely used in data centres and wide-area backbones where centralized control is practical. SDN did not replace distributed routing on the public Internet—scale and autonomy still favour it—but it changed how networks are operated and made routing programmable.
Segment routing, developed in the 2010s, takes a different tack: instead of signalling state along a path, a source lists a short sequence of "segments" (instructions) in the packet header, and routers execute them. It simplifies traffic engineering and is now used in large service-provider networks.
Where the field stands
Today's routing runs on the same two-tier skeleton: link-state and distance-vector protocols inside domains, BGP between them, with CIDR aggregation and NAT holding the address system together while IPv6 coexistence slowly deepens. Around this core sit the newer layers—RPKI for origin validation, SDN controllers for programmable operation, segment routing for traffic engineering. The open questions are the ones the history kept postponing: how to secure interdomain routing end to end without centralizing it, how to complete the IPv6 transition, and how to keep a system built on local trust and local decisions robust as it grows and as its operators' interests diverge.
References
- Routing (introduction, Distance vector algorithms, Link-state algorithms), Wikipedia
- Internetworking, Wikipedia
- Distance-vector routing protocol (introduction, Development of distance-vector routing), Wikipedia
- Routing Information Protocol, Wikipedia
- Link-state routing protocol, Wikipedia
- Internet Protocol, Wikipedia
- IPv4 (History), Wikipedia
- Border Gateway Protocol, Wikipedia
- BGP hijacking (Background), Wikipedia
- Network address translation (History, introduction), Wikipedia
- Classless Inter-Domain Routing, Wikipedia
- Longest prefix match, Wikipedia
- Resource Public Key Infrastructure, Wikipedia
- Software-defined networking, Wikipedia
The frameworks of Routing And Internetworking
Each framework is a way of working the field has used: when it held, and the question it answers.
- 1961-Present
Packet Switching
How can data be transmitted without reserving a dedicated path?
- 1974-Present
Internet Protocol
What minimal requirements must a network use to connect disparate networks?
- 1975-Present
Distance-vector routing protocol
How can a router determine the best path using only neighbor information?
- 1978-Present
Link-state routing protocol
How can a router build a complete map of the network topology?
- 1989-Present
Interdomain Policy Routing
How should routing decisions be made when different networks have different business rules?
- 1993-Present
Classless Inter-Domain Routing
How can address space be used more efficiently when prefixes are not fixed?
- 1994-Present
Network Address Translation
How can multiple private devices share a single public address?
- 1998-Present
List of IPv6 transition mechanisms
How can a network transition between different addressing schemes?
- 2008-Present
Routing Security and Origin Validation
How can the origin of a network route be cryptographically verified?
- 2008-Present
Software-Defined Networking
How can the logic for path computation be separated from the forwarding hardware?
- 2013-Present
Segment Routing
How can a packet be instructed to follow a specific sequence of network hops?
How the ideas connect
Each arrow runs from an earlier idea to the later one it shaped. The list below says what passed between them.
Internet Protocol grew out of Packet Switching
The concept of packet switching provided the fundamental basis for the Internet Protocol's datagram model, allowing data to be broken into units for transmission across interconnected networks.
Carried by Paul Baran; Donald Davies.
Interdomain Policy Routing grew out of Internet Protocol
The hierarchical nature of the Internet Protocol necessitated a mechanism for routing between independently administered networks, leading to the concept of interdomain routing.
Classless Inter-Domain Routing influenced by Internet Protocol
The limitations of fixed-length addressing within the protocol's addressing scheme drove the development of more flexible prefix definitions.
Network Address Translation grew out of Internet Protocol
As the Internet grew and address space became constrained, NAT was developed as a practical mechanism to allow multiple private devices to communicate using limited public addresses defined by the protocol.
List of IPv6 transition mechanisms grew out of Internet Protocol
The exhaustion of IPv4 necessitated a new addressing scheme, and the transition mechanisms were built to allow the existing protocol infrastructure to coexist with the new standard.
Software-Defined Networking influenced by Internet Protocol
SDN emerged from the need to gain centralized, programmable control over the distributed forwarding decisions inherent in the traditional protocol model.
Carried by OpenFlow.
Routing Security and Origin Validation grew out of Interdomain Policy Routing
The inherent trust model of interdomain routing, which relies on advertised claims, prompted the development of cryptographic verification methods to secure route origins.
Distance-vector routing protocol influenced by Packet Switching
The distributed nature of packet switching necessitated local, neighbor-to-neighbor routing decisions, which distance-vector protocols addressed.
Link-state routing protocol influenced by Packet Switching
The need for each node to make routing decisions based on local link knowledge, rather than just neighbor summaries, stemmed from the packet-switched environment.
Interdomain Policy Routing influenced by Distance-vector routing protocol
The limitations of simple distance-vector metrics in handling complex administrative boundaries led to the development of policy-aware exterior routing.
Interdomain Policy Routing influenced by Link-state routing protocol
The need for a more robust, topology-aware routing mechanism between administrative domains influenced the design of the exterior routing protocol.
Segment Routing influenced by Software-Defined Networking
The concept of decoupling control and forwarding planes, central to SDN, provided a conceptual framework that informed the design of segment routing's explicit instruction mechanism.
Beyond the field
Where Routing And Internetworking's ideas came from in other fields, and what they led to there: the strongest 12 of 50 links.
Packet Switching reacted against Circuit Switching in Network Architecture
Packet switching was formulated by Baran and Davies as a deliberate alternative to circuit switching, whose reservation of a dedicated path per call was the model being rejected for bursty data traffic.
Carried by Paul Baran; Donald Davies.
Packet Switching influenced Internetworking and the End-to-End Argument in Networks
Packet switching as a routing and internetworking technique is the substrate the end-to-end argument addresses, since the argument concerns functions placed in a packet-switched internetwork. The 1981 formulation arose from experience with such networks.
Carried by Jerome Saltzer; David Reed; David Clark.
Internet Protocol led to IPsec in Network Security
IPsec was designed as a security extension of the Internet Protocol, adding authentication and encryption headers to IP packets; it is a direct outgrowth of the IP architecture.
Internet Protocol grew out of Packet Switching in Networks
The Internet Protocol is a direct descendant of the packet-switching research programme, built to join the packet networks that programme produced.
Carried by Vint Cerf; Robert Kahn.
Internet Protocol grew out of Packet Switching in Computer Systems
IP was developed within the same packet-switching computer-systems tradition, as the addressing and forwarding layer for hosts on packet networks.
Carried by Vint Cerf; Robert Kahn.
Internet Protocol grew out of Packet switching in Network Protocols
IP grew directly out of packet-switching protocol work; Cerf and Kahn's 1974 paper framed the new protocol explicitly as an internetworking layer over packet networks.
Carried by Vint Cerf; Robert Kahn.
Internet Protocol grew out of Packet Switching in Network Architecture
The Internet Protocol was designed by Cerf and Kahn as a way to interconnect dissimilar packet-switched networks, so packet switching is the substrate the protocol generalises.
Carried by Vint Cerf; Robert Kahn; A Protocol for Packet Network Intercommunication (1974).
Internet Protocol grew out of Packet Switching and Layered Network Architecture in Communication Systems
Layered network architecture over packet switching is the immediate parent of IP; the Cerf-Kahn design placed a common internetwork layer above heterogeneous packet networks.
Carried by Vint Cerf; Robert Kahn.
Internet Protocol influenced Constrained-device and IoT protocols in Network Protocols
Constrained-device and IoT protocols such as 6LoWPAN and CoAP were built directly on the Internet Protocol, adapting IP to low-power links. The IoT protocol stack is defined by its use of IP addressing and the IP architecture.
Carried by RFC 4944 (2007); RFC 7252 (2014).
Interdomain Policy Routing grew out of Internetworking and Federation in Network Architecture
Interdomain policy routing grew directly out of internetworking and federation work, as independently administered networks needed rules for exchanging routes across administrative boundaries.
Software-Defined Networking grew out of Control-Data Plane Separation in Software Defined Networking
Software-defined networking is the generalisation of control-data plane separation into a programmable, centrally controlled architecture. The earlier separation of signalling from forwarding is the core idea SDN extended with open interfaces and centralised controllers.
Packet Switching influenced End-to-end principle in Network Architecture
Packet switching's best-effort, stateless forwarding created the conditions the end-to-end argument addresses, and the principle was formulated to justify keeping packet networks simple. The argument generalises the design stance implicit in packet switching.
Carried by Jerome Saltzer; David Reed; David Clark.

Routing And Internetworking is a planet in Nousfarer
Its city has a tower for each of these 11 frameworks. Land, walk in, and climb one concept at a time.
Land on Routing And InternetworkingRelated fields
Fields its ideas are linked to
- Network Protocols 17 links
- Network Architecture 13 links
- Networks 7 links
- Software Defined Networking 4 links
- Computer Systems 4 links
- Communication Systems 2 links
- Digital Privacy 2 links
- Network Security 1 link
More in Networks
- Congestion Control
- Network Architecture
- Network Protocols
- Networks
- Peer To Peer And Content Delivery
- Software Defined Networking
- Wireless Networks
See where Routing And Internetworking sits on the Map of Human Knowledge