Showing papers on "Wireless Routing Protocol published in 1977"
TL;DR: The specification, analysis and evaluation of some hierarchical routing procedures which are effective for large store-and-forward packet-switched computer networks are dealt with, finding that in the limit of a very large network, enormous table reduction may be achieved with essentially no increase in network path length.
457 citations
TL;DR: It is shown that a simple, convergent relaxation procedure can be used to "solve" the analog network, thereby yielding the optimal routing strategy, and the computational load compares favorably with other (centralized) methods, although further work is needed to obtain quantitive comparisons in specific cases.
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.
73 citations
Proceedings Article•
01 Jan 1977
10 citations
27 Sep 1977
TL;DR: Analytic study of the model shows that local congestion control with random routing is superior to similar control with deterministic routing for a particular example worked out here.
Abstract: This paper considers the problem of congestion in message-switched, or packet-switched, networks, which employ probabilistic routing schemes. A queueing model for the analysis of a local congestion control scheme is presented. Analytic study of the model shows that local congestion control with random routing is superior to similar control with deterministic routing for a particular example worked out here.
9 citations
3 citations
TL;DR: A simple modification of Chyung and Reddy's routing algorithm provides this generalization of a new algorithm for routing data packets in networks of computers connected by communication links.
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.
01 Dec 1977
TL;DR: An adaptive routing algorithm for store-and-forward networks is proposed, which aims to minimize delay per message and maximize message delivery rate.
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.