Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
Journal
IEEE Transactions on Computers
Journal Volume
C-36
Journal Issue
2
Pages
129-137
Date Issued
1987
Author(s)
Shin, K.G.
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. We also extend our analytical results to routing strategies which are free of loops with more than two nodes. (Such a loop is called a multinode loop.) Finally, numerical examples are presented to demonstrate the utility of our results. Copyright © 1987 by The Institute of Electrical and Electronics Engineers, Inc.
Subjects
ARPANET; distributed adaptive routing strategy; high-order routing strategy; local and global information; multinode loops; network delay table; ping-pong-type loops
Other Subjects
CONTROL SYSTEMS, ADAPTIVE; DATA TRANSMISSION - Packet Switching; ARPANET; MULTINODE LOOPS; PING-PONG-TYPE LOOPS; COMPUTER NETWORKS
Type
journal article