Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
- 1 February 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (2) , 129-137
- https://doi.org/10.1109/tc.1987.1676875
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Routing and Flow Control in TYMNETIEEE Transactions on Communications, 1981
- An overview of the new routing algorithm for the ARPANETPublished by Association for Computing Machinery (ACM) ,1979
- The ARPA network design decisionsComputer Networks (1976), 1977
- A Routing Procedure for the TIDAS Message-Switching NetworkIEEE Transactions on Communications, 1975
- Adaptive Routing Techniques for Distributed Communications SystemsIEEE Transactions on Communications, 1969