Showing papers on "Destination-Sequenced Distance Vector routing 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.

ARPANET Routing Algorithm Improvements

Abstract: : This report describes progress during the first six months of a contract to make several improvements to ARPANET routing. Some principal conclusions are: Several problems have been discovered in the present congestion control, line up/down procedures, and loop suppression techniques through the use of a new real-time monitoring capability. Solutions to most of these problems have been developed; operational experience with these changes is presented. A new set of line up/down procedures with much better performance was developed and analyzed. Extensive measurements of network delay were carried out; delays fluctuate rapidly over a large range, making it difficult to devise effective estimation techniques. The present routing algorithm is itself a major contributor to network delay due to the computations and update messages it requires. A set of improvements was designed for the present routing algorithm to make it more efficient and effective. However, a new algorithm, based on performing the entire shortest path calculation at each node, incrementally for each network change, appears to be a better choice for installation in work change, appears to be a better choice for installation in the ARPANET.

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.

Extension of an Adaptive Distributed Routing Algorithm to Mixed Media Networks

Abstract: By modeling the broadcast portion of a mixed media network as a fully connected point-to-point network with link capacities varying as functions of the traffic rate it is possible to extend an adaptive distributed routing algorithm that was originally developed for point-to-point ground networks. Additional modifications for improved dynamic performance at the satellite interface message processors are also considered.

Extension of an Adaptive Distributed Routing Algorithm to

Abstract: By modeling the broadcast portion of a mixed media network as a fully connected point-to-point network with link capacities varying as functions of the traffic rate it is possible to extend an adaptive distributed routing algorithm that was originally developed for point-to-point ground networks. Additional modifications for improved dynamic performance at the satellite interface message processors are also considered.

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.

A minimum principle/queueing theory approach to routing in message-switched networks

Abstract: Preliminary results for minimum message-delay routing in message-switched, store-and-forward, data-communication networks are presented using a minimum principle/queueing theory approach. The routing algorithm is a decentralized one which requires only local information. The results are illustrated via a special case, and extensions and problems for future research are discussed.