Journal ArticleDOI
An overview of the new routing algorithm for the ARPANET
John M. McQuillan,Ira Richer,Eric C. Rosen +2 more
- Vol. 25, Iss: 1, pp 54-60
Reads0
Chats0
TLDR
The original routing algorithm of the ARPANET, in service for over a decade, has recently been removed from the ARpANET and replaced with a new and different algorithm that is a distributed, adaptive routing algorithm.Abstract:
The original routing algorithm of the ARPANET, in service for over a decade, has recently been removed from the ARPANET and replaced with a new and different algorithm. Although the new algorithm, like the old, is a distributed, adaptive routing algorithm, it is not similar to the old in any other important respect. In the new algorithm, each node maintains a data base describing the delay on each network line. A shortest-path computation is run in each node which explicitly computes the minimum-delay paths (based on the delay entries in the data base) from that node to all other nodes in the network. The average delay on each network line is measured periodically by the nodes attached to the lines. These measured delays are broadcast to all network nodes, so that all nodes use the same data base for performing their shortest-path computations. The new routing algorithm was extensively tested on the ARPANET before being released. This paper describes the algorithm and summarizes the results of these tests.read more
Citations
More filters
Journal ArticleDOI
Achieving sub-second IGP convergence in large IP networks
TL;DR: The authors' measurements and simulations indicate that sub-second link-state IGP convergence can be easily met on an ISP network without any compromise on stability.
Patent
Synchronization mechanism for link state packet routing
TL;DR: In this article, the authors propose a method of providing loop free and shortest path routing of data packets in a network having a plurality of switches, routing messages for communicating network topology information between the switches, a pluralityof links connecting the switches to the links, and the plurality of channels connecting the nodes to the switches.
Patent
Message routing in a computer network
TL;DR: In this paper, an adaptive distributed message routing algorithm that may be implemented in a computer program to control the routing of data messages in a packet message switching digital computer network is presented.
Patent
Network interface and protocol
TL;DR: A communication interface for providing an interface between a data link and a data processor, the data processor being capable of supporting an operating system and a user application, is described in this paper.
Journal ArticleDOI
The updating protocol of ARPANET's new routing algorithm
TL;DR: The problem of devising a good updating protocol is shown to be a problem in the management of a distributed data base and the requirements which any such protocol must meet are presented and discussed.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
Efficient Algorithms for Shortest Paths in Sparse Networks
TL;DR: Algorithms for finding shortest paths are presented which are faster than algorithms previously known on networks which are relatively sparse in arcs, and a class of “arc set partition” algorithms is introduced.
Journal ArticleDOI
The ARPA network design decisions
TL;DR: A number of key decisions made in the design of the ARPA network over a five-year period serve as the context for an analysis of the fundamental properties and requirements of packet-switching networks and formulation of thefundamental criteria for evaluating network performance.