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

A Failsafe Distributed Routing Protocol

Abstract: An algorithm for constructing and adaptively maintaining routing tables in communication networks is presented. The algorithm can be employed in message as well as circuit switching networks, uses distributed computation, provides routing tables that are loop-free for each destination at all times, adapts to changes in network flows, and is completely failsafe. The latter means that after arbitrary failures and additions, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes. For each destination, the routes are independently updated by an update cycle triggered by the destination.

The Minimum Width Routing of a 2-Row 2-Layer Polycell-Layout

Abstract: This paper presents a new routing principle that leads to an algorithm to realize the minimum width of the 2-layer channel area between two rows of terminals to be interconnected. Besides the theoretical results, practically applicable routing algorithms based on our principle are developed.

Dynamic models of shortest path routing algorithms for communication networks with multiple destinations

Abstract: This paper provides analysis and computational results relating to the dynamic behavior of shortest path routing algorithms for store and forward communication networks. A companion paper [1] focuses on networks with a single destination. The present work considers networks with multiple destinations.

A decentralized algorithm for optimal routing in data-communication networks

Abstract: The goal coordination technique of optimization theory for large-scale systems is used to develop a decentralized algorithm for optimal routing in data-communication networks. The algorithm is in two parts of which the first solves the optimal flow assignment problem and the second provides the corresponding optimal routing. All calculations are distributed among the nodes and require information only from adjacent nodes. The results are illustrated via an example and problems for future research are indicated.

A Routing Algorithm Using the Nearest-Neighbor Concept

Abstract: The design of routes for delivery or assembly of goods or people and the associated problem of vehicle scheduling is a relatively new problem to be tackled by operations researchers although it has vexed decision makers in the business world since the invention of the delivery vehicle. The salient feature of the problem is that of finding the leastcost paths emanating from and terminating at a warehouse or depot over which one or more vehicles are to traverse in serving each of n customers. This is by no means a trivial problem given the service-oriented nature of today's economy, the congestion on highways and streets, and the present energy situation. Further, it is not easily resolved with traditional techniques of the operations researcher because of its "combinatorial" nature (see Hallberg and Kriebel). The first researchers to tackle this problem appear to have been Garvin, Crandall, John, and Spellman. Their approach, however, relied on the use of linear programming which is not known to be particularly efficient (if feasible at all even with modern-sized computers) at solving "combinatorial" problems. They were able to generate optimal solutions, but only for routing problems of a size that had no practical significance. This work spurred others to investigate the problem and led to the work of Clarke and Wright, who developed a simple but effective heuristic approach that has proven in a variety of applications to yield "good," although not necessarily "optimal," solutions to routing problems of a practical size.' In a recent application, we have isolated problems having certain unique characteristics for which the Clarke-Wright technique will often produce unacceptable (and clearly nonoptimal) results. While several authors have suggested modifications to improve upon the Clarke-Wright technique (see the review articles by Turner, Ghare, and Fourds, and by Golden, Magnanti, and Nguyen), none have dealt with the specific problem encountered here. In this paper we describe the nature of these u iquely structured problems, and outline a modification of the Clarke-Wright method which mainains the integrity of the basic procedure, ensures better (more nearly optimal) solutions for the class of problems described, and ensures no worse solutions for routing problems that do not have the structure of those described here.

A simulation model for network routing

Abstract: The simulation program described in this paper was devised as a vehicle for the study of communication network routing procedures. It was designed to model the behavior of a wide range of network topologies and routing disciplines. An event driven simulation approach was chosen to minimize program development time and complexity.GASP-IV was selected as the simulation language. The determining factor in choosing the language was the clean interface it presents to FORTRAN. The use of GASP-IV permits utilizing the full power of FORTRAN in describing complex routing algorithms while simultaneously relieving the programmer of the responsibility for such essential housekeeping functions as enqueuing and dequeuing messages, file manipulation and event sequencing.As an application of this simulator, a loop-free distributed adaptive routing algorithm is proposed and analyzed. Simulation results are presented and the effect of the algorithm on overall network performance is examined. In addition to a loop-free property, the algorithm is shown to provide a partial solution to the single path routing problem. Furthermore, a modification to the algorithm is given which precludes message loss, and is shown to be superior in performance to current update algorithms (PUA).