Showing papers on "Equal-cost multi-path routing published in 1978"

Reverse path forwarding of broadcast packets

Abstract: A broadcast packet is for delivery to all nodes of a network. Algorithms for accomplishing this delivery through a store-and-forward packet switching computer network include (1) transmission of separately addressed packets, (2) multidestination addressing, (3) hot potato forwarding, (4) spanning tree forwarding, and (5) source based forwarding. To this list of algorithms we add (6) reverse path forwarding, a broadcast routing method which exploits routing procedures and data structures already available for packet switching. Reverse path forwarding is a practical algorithm for broadcast routing in store-and-forward packet switching computer networks. The algorithm is described as being practical because it is not optimal according to metrics developed for its analysis in this paper, and also because it can be implemented in existing networks with less complexity than that required for the known alternatives.

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 Topologically Based Non-Minimum Distance Routing Algorithm

Abstract: In this paper, a unique topologically based non-minimum distance routing algorithm is presented. It offers both maximal completion rates and minimal via usage. The algorithm is based on a topological transformation of a significant subset of the PC routing problem: A broad channel encompassing a full row of DIPs and all routes within it. This transformation eliminates the need to consider detailed path shapes during routing. The routing problem is transformed into a permutation of nets. It is coupled with a backtrack search to produce a powerful routing algorithm. The search is conducted in a planar environment.

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.