This Article 
 Bibliographic References 
 Add to: 
A Simple Distributed Loop-Free Routing Strategy for Computer Communication Networks
December 1993 (vol. 4 no. 12)
pp. 1308-1319

The loops resulting from either component failures or load changes in a computercommunication network degrade the performance and the adaptability of conventionaldistributed adaptive routing strategies, such as ARPANET's previous routing strategy(APRS). The authors develop distributed loop-free routing strategy by adding only oneadditional piece of information-the total number of minimum-delay paths-to the commonly used routing messages and tables. The proposed routing strategy requires only easily obtainable information, yet removes loops completely. It is far more efficient in both time and space than its conventional counterparts, especially for sparse computer networks. The authors prove the correctness of the proposed strategy, and give several illustrative examples. The performance of this strategy is shown to be better than, or at least as good as, that of APRS and any multiorder routing strategies, in which the order of a routing strategy is determined by the amount of routing information carried in eachrouting message.

[1] D. Bersekas and R. Gallager,Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.
[2] B. W. Boehm and R. L. Mobley, "Adaptive routing techniques for distributed communications systems,"IEEE Trans. Commun. Technol., vol. COM-17, pp. 340-349, June 1969.
[3] T. Cegrell, "A routing procedure for the TIDAS message-switching network,"IEEE Trans. Commun., vol. COM-23, no. 6, pp. 575-585, June 1975.
[4] C. C. Cheng, S. P. R. Kumar, and J. J. Garcia-Luna-Aceves, "A distributed loop-free rooting algorithm suitable for arbitrary link weights," Tech. Rep. CSS-89-05, Dep. Elec. Eng. Comput. Sci., Northwestern Univ., Sept. 1989.
[5] J. M. Jaffe and F. H. Moss, "A responsive distributed routing algorithm for computer networks,"IEEE Trans. Commun., vol. COM- 30, no. 7, pp. 1758-1762, July 1982.
[6] M. J. Johnson, "Updating routing tables after resource failure in a distributed computer network,"Networks, vol. 14, pp, 379-391, 1984.
[7] L. Kleinrock and H. Opderbeck, "Throughput in the ARPANET-protocols and measurement,"IEEE Trans. Commun., vol. COM-25, no. 1, pp. 367-376, Jan. 1977.
[8] J. M. McQuillan, I. Richer, and E. C. Rosen, "The new routing algorithm for the ARPANET,"IEEE Trans. Commun., vol. COM- 28, no. 5, pp. 711-719, May 1980.
[9] P. M. Merlin and A. Segall, "A failsafe distributed routing protocol,"IEEE Trans. Commun., vol. COM-27, no. 9, pp. 1280-1287, Sept. 1979.
[10] D. J. Nelson, K. Sayood, and H. Chang, "An extended least-hop distributed routing algorithm,"IEEE Trans. Commun., vol. 38, pp. 520-528, Apr. 1990.
[11] K. Ramamritham, J. A. Stankovic, and W. Zhou, "Distributed scheduling of tasks with deadlines and resource requirements,"IEEE Trans. Comput., vol. 38, pp. 1110-1122, Aug. 1989.
[12] K. G. Shin and M.-S. Chen, "Performance analysis of distributed routing strategies free of ping-pong-type looping,"IEEE Trans. Comput., vol. C-36, no. 2, pp. 129-137, Feb. 1987.
[13] K. G. Shin and M.-S. Chen, "Minimal order loop-free routing strategy,"IEEE Trans. Comput., vol. 39, pp. 870-888, July 1990.
[14] W. D. Tajibnapis, "A correctness proof of a topology information maintenance protocol for distributed computer networks,"Commun. ACM, vol. 20, pp. 477-485, 1977.
[15] A. Tanenbaum,Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1988.

Index Terms:
Index Termsloop-free; routing strategy; computer communication networks; component failures; loadchanges; distributed adaptive routing; ARPANET; computer networks; correctness;distributed loop-free routing; fault-tolerant routing; network delay tables; routingmessages; computer networks; fault tolerant computing; network routing
K.G. Shin, C.C. Chou, "A Simple Distributed Loop-Free Routing Strategy for Computer Communication Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 12, pp. 1308-1319, Dec. 1993, doi:10.1109/71.250113
Usage of this product signifies your acceptance of the Terms of Use.