This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
February 1987 (vol. 36 no. 2)
pp. 129-137
K.G. Shin, Department of Electrical Engineering and Computer Science, University of Michigan
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.
Index Terms:
ping-pong-type loops, ARPANET, distributed adaptive routing strategy, high-order routing strategy, local and global information, multinode loops, network delay table
Citation:
K.G. Shin, null Ming-Syan Chen, "Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping," IEEE Transactions on Computers, vol. 36, no. 2, pp. 129-137, Feb. 1987, doi:10.1109/TC.1987.1676875
Usage of this product signifies your acceptance of the Terms of Use.