Showing papers on "Routing protocol published in 1978"

A Review of the Development and Performance of the ARPANET Routing Algorithm

Abstract: This paper presents a comprehensive review of the ARPANET routing algorithm, from its original implementation to our plans for future modifications. We hope that by collecting this information, and by providing considerable details, we can provide others with a useful reference document concerning some of the practical problems of network algorithm design. Much of the discussion below assumes a basic familiarity with the principles of packet switching, the ARPANET implementation, and some of the relevant terminology, information which can be found, for example, in [4]. Sections 1 and 2 give a brief summary of basic routing concepts and of the original routing algorithm, respectively. The following two sections describe in detail subsequent modifications and the actual implementation currently in use. Section 5 then discusses some problems that have developed over the past few years, as network usage has grown considerably. The final sections outline some explanations for these problems and some mechanisms for improving performance. We are in the process of implementing these and other changes to the routing algorithm.

A recoverable protocol for loop-free distributed routing

Abstract: An algorithm fQr adaptive routing in data-conmunication networks is presented. The algorithm uses distributed computation, provides loop-fre_ routing for each destination in the network, adapts to changes in network flows and is completely failsafe. The latter means that after arbitrary failures and additions of nodes and links, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes. Proofs of all these properties are provided in a separate paper.

A Comparison of Information Policies for Minimum Delay Routing Algorithms

Abstract: The problem of routing in a computer networks is dealt with by separating the information problem and the control problem. Several classes of information policies are examined, and numerical comparisons are made of their performance, using representative values of network parameters. Routing based on the expected values of delay, rather than actual values of delay, is shown to be superior to the other algorithms considered.