Back to index

The New Routing Algorithm for the ARPANET

John M. McQuillan, Ira Richer, Eric C. Rosen

One-line summary: Shortest-path-first (based on delay) routing trees are constructed and updated to direct routing, with various precautions taken to insure that all nodes' databases are consistent.

Overview/Main Points


The humble beginnings of modern routing-update protocols. Like other papers from the early days (except for the Cerf and Kahn paper), it's somewhat jumbled and hard to read.


Back to index