Showing papers on "Wireless Routing Protocol published in 1979"
TL;DR: 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.
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.
227 citations
TL;DR: This paper evaluating the tradeoff between the reduction in routing table length and the increase in network path length in terms of the more meaningful network performance measures of delay and throughput shows the enormous efficiency of optimized hierarchical routing for a class of large networks.
75 citations
Proceedings Article•
01 Jan 1979
8 citations
01 Dec 1979
TL;DR: 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 that solves the optimal flow assignment problem and provides the corresponding optimal routing.
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.
5 citations
2 citations
01 Jan 1979
TL;DR: The goal coordination technique of optimization theory for large-scale systems is used to develop a decentralized algorithm for optimal routing in datacomunication networks that solves the optimal flow assignment problem and provides the corresponding optimal routing.
Abstract: The goal coordination technique of optimization theory for large-scale systems is used to develop a decentralized algorithm for optimal routing in datacomunication 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.