A Simple Distributed Loop-Free Routing Strategy for Computer Communication Networks

Authors:
Kang G. Shin;Chih-Che Chou
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1993

Citing 6
Cited 0

Data networks

Data networks
Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping

IEEE Transactions on Computers
Computer networks

Computer networks
Distributed Scheduling of Tasks with Deadlines and Resource Requirements

IEEE Transactions on Computers
Minimal Order Loop-Free Routing Strategy

IEEE Transactions on Computers
A correctness proof of a topology information maintenance protocol for a distributed computer network

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

The loops resulting from either component failures or load changes in a computercommunication network degrade the performance and the adaptability of conventionaldistributed adaptive routing strategies, such as ARPANET's previous routing strategy(APRS). The authors develop distributed loop-free routing strategy by adding only oneadditional piece of information-the total number of minimum-delay paths-to the commonly used routing messages and tables. The proposed routing strategy requires only easily obtainable information, yet removes loops completely. It is far more efficient in both time and space than its conventional counterparts, especially for sparse computer networks. The authors prove the correctness of the proposed strategy, and give several illustrative examples. The performance of this strategy is shown to be better than, or at least as good as, that of APRS and any multiorder routing strategies, in which the order of a routing strategy is determined by the amount of routing information carried in eachrouting message.