An overview of the new routing algorithm for the ARPANET
SIGCOMM '79 Proceedings of the sixth symposium on Data communications
A unified approach to loop-free routing using distance vectors or link states
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A new responsive distributed shortest-path rounting algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Distributed multicasting algorithm in a wide area network
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Dynamics of distributed shortest-path routing algorithms
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Minimal Order Loop-Free Routing Strategy
IEEE Transactions on Computers
Scalable inter-domain routing architecture
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
A Simple Distributed Loop-Free Routing Strategy for Computer Communication Networks
IEEE Transactions on Parallel and Distributed Systems
The Request Reply Family of Group Routing Protocols
IEEE Transactions on Computers
Avoiding Counting to Infinity in Distance Vector Routing
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Design and performance of a loop free routing algorithm
ICCC '02 Proceedings of the 15th international conference on Computer communication
Lans: Simulation of congestion avoidance and routing in packet switching networks
Computer Communications
Group routing without group routing tables: an exercise in protocol design
Computer Communications
A depth-first search routing algorithm for star graphs and its performance evaluation
Mathematical and Computer Modelling: An International Journal
| Hi-index | 14.99 |
This paper deals with a distributed adaptive routing strategy which is very simple and effective, and is free of a ping-pong-type looping in the presence of network failures. Using the number of time intervals required for a node to recover from a network failure as the measure of network's adaptability, performance of this strategy and the ARPANET's previous routing strategy (APRS) is comparatively analyzed without resorting to simulation. Formulas of the exact number of time intervals required for failure recovery under both strategies are also derived. We show that i)the performance of the strategy is always better than, or at least as good as, that of APRS, and ii) network topology has significant effects on the performance of both strategies.