Showing papers on "Wireless Routing Protocol published in 1981"

Advances in Verifiable Fail-Safe Routing Procedures

Abstract: Two new versions of a distributed protocol for establishing and maintaining loop-free routing tables for communication networks with changing topology are presented. The protocols here possess significant advantages over previous versions in terms of complexity of the node algorithm and of the validation procedure, as well as the communication and storage needs. In addition, we present a procedure for establishing new and disrupted calls in a virtual or physical circuit-switched network, and for canceling existing calls, such that each call is loop-free and is established according to the routing tables provided by the protocol.

A Technique for Adaptive Routing in Networks

Abstract: A two-level adaptive routing scheme for packet-switched computer communication networks is proposed and investigated. The first level is quasi-static and based on the global network status. The second level is dynamic with decisions being made at each node in an attempt to obtain the savings in average delay predicted by a multiserver model of the node. Simulations confirm the predicted improvement.

A Failsafe Distributed Protocol for Minimum Delay Routing

Abstract: Previous distributed routing protocols in data-communication networks that achieve minimum average delay are extended to take into consideration topological changes in the network.

A distributed minimum hop routing algorithm

Abstract: A two-part distributed algorithm for minimum hop routing in message-switched networks subject to end-to-end average message delay constraints is developed. The first part of the algorithm provides for unconstrained minimum hop routing, while the second corrects this routing to satisfy the delay constraints. Both parts are implemented nodewise via low-order linear programs wherein the information exchange required for each node to carry out its computations involves only adjacent neighbor nodes. The algorithm is illustrated via an example of an 8- node, 14-link network with 7 commodities, and directions for future research to enhance present results are indicated.

Adaptive routing in large communication networks: Probabilistic study

Abstract: A network model is presented and conditions for stochastic stability of the network system are given. For adaptation algorithms which change the routing probabilities slowly (small stepsize), expressions for steady-state variances are derived; usimg these, guidelines for the selection of algorithm parameters are discussed.