Minimal Order Loop-Free Routing Strategy

Authors:
Kang G. Shin;Ming-Syan Chen
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1990

Citing 3
Cited 2

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

IEEE Transactions on Computers
On the Number of Acceptable Task Assignments in Distributed Computing Systems

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

Communications of the ACM

Adaptive Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Computers
A Simple Distributed Loop-Free Routing Strategy for Computer Communication Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

A multiorder routing strategy is developed which is loop-free even in the presence of link/node failures. Unlike most conventional methods in which the same routing strategy is applied indiscriminately to all nodes in the network, nodes under this proposal may adopt different routing strategies according to the network structure. Formulas are developed to determine the minimal order of routing strategy for each node to eliminate looping completely. A systematic procedure for striking a compromise between the operational overhead and network adaptability is proposed. Several illustrative examples are presented.