Showing papers on "Routing protocol published in 1977"

A Minimum Delay Routing Algorithm Using Distributed Computation

Abstract: An algorithm is defined for establishing routing tables in the individual nodes of a data network. The routing table at a node i specifies, for each other node j , what fraction of the traffic destined for node j should leave node i on each of the links emanating from node i . The algorithm is applied independently at each node and successively updates the routing table at that node based on information communicated between adjacent nodes about the marginal delay to each destination. For stationary input traffic statistics, the average delay per message through the network converges, with successive updates of the routing tables, to the minimum average delay over all routing assignments. The algorithm has the additional property that the traffic to each destination is guaranteed to be loop free at each iteration of the algorithm. In addition, a new global convergence theorem for noncontinuous iteration algorithms is developed.

The Modeling of Adaptive Routing in Data-Communication Networks

Abstract: Basic analytical models for problems of dynamic and quasi-static routing in data-communication networks are introduced. The models are intended to handle the quantities of interest in an algorithmic form, and as such require only a minimal number of assumptions. Control and estimation methods are used to construct algorithms for the solution of the routing problem.

A correctness proof of a topology information maintenance protocol for a distributed computer network

Abstract: In order for the nodes of a distributed computer network to communicate, each node must have information about the network's topology. Since nodes and links sometimes crash, a scheme is needed to update this information. One of the major constraints on such a topology information scheme is that it may not involve a central controller. The Topology Information Protocol that was implemented on the MERIT Computer Network is presented and explained; this protocol is quite general and could be implemented on any computer network. It is based on Baran's “Hot Potato Heuristic Routing Doctrine.” A correctness proof of this Topology Information Protocol is also presented.

Source routing in computer networks

Abstract: As plans for network interconnection develop, the problems of internet routing and addressing become increasingly important. In one popular model of internet addressing, a hierarchical form of network and local (within network) address is used, with the source providing only the destination address while the intermediate network(s) and/or Gateways between networks take care of routing packets to that destination by various paths. This and related techniques requiring some form of routing table and knowledge at intermediate nodes are more fully discussed in [1,2,3].This paper considers another technique for internet routing in which the source of internet packets specifies the complete internet route. When the entire route accompanies each internet packet, no routing decisions or tables are required at Gateways, but the packet format is complicated and overhead increases. In particular, the packet must carry a varying number of intermediate addresses depending on the path and destination [4]. This overhead may be reduced by setting up a fixed route with connection tables [1] when a connection is established.

A Class of Decentralized Routing Algorithms Using Relaxation

Abstract: An important problem in packet-switched communication networks is the optimal assignment of routes to the message packets. An optimal routing assignment is one which chooses network paths for the packets in a way that minimizes some cost function, typically average message delay. A class of optimal routing algorithms is described which utilize a type of iterative computation known as relaxation. Computation is decentralized in the sense that each node computes its routing strategy using only information supplied from adjacent nodes. Being iterative, the algorithms are inherently adaptive. The routing computation is based conceptually on an electrical network analog for the optimization problem. We show that a simple, convergent relaxation procedure can be used to "solve" the analog network, thereby yielding the optimal routing strategy. A simple example is presented to illustrate the method. In general, the computational load compares favorably with other (centralized) methods, although further work is needed to obtain quantitive comparisons in specific cases.

Routing and control in a centrally directed network

Abstract: TYMNET I is a centrally directed network with over 200 nodes interconnected in a topology that allows alternate paths between nodes in the network. Routing within the network is done by a central supervisor program, with full knowledge of network topology and network load. Within network nodes routing is table driven.The supervisor communicates with nodes through a command tree that is built at network takeover time. The supervisor has no a priori knowledge of the network topology when it starts network takeover, and the topology may change while the supervisor is in control. The control tree is dynamically modified by the supervisor to accommodate the new topology.

A Routing Algorithm for Digraphs

Abstract: : A new algorithm for routing data packets in networks of computers connected by communication links is given by Chyung and Reddy. Because they assume that the communication links are two-way, their result applies, properly, to routing messages in a graph. However, some communication networks have asymmetrical cross links either by design or because the radio circuits that must be paralleled in opposite directions to compose them may fail. Such networks are represented by digraphs and it is clear that they require a generalized routing algorith. A simple modification of Chyung and Reddy's routing algorithm, shown below, provides this generalization.

Priority queueing for the autodin store-and-forward network

Abstract: An adaptive routing algorithm for store-and-forward networks is proposed. The messages in the system are transmitted in their full length, and they are assigned priorities. The algorithm's objective is to minimize delay per message and maximize message delivery rate.