Title :
Distributed routing algorithm for loop detection and resolution
Author :
Park, Sung-Woo ; Tsai, Wei K.
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA
Abstract :
After a brief discussion of the distributed Bellman-Ford algorithm and the associated looping problems, a routing algorithm for loop detection and resolution is proposed. The proposed algorithm detects and resolves all kinds of loops within a finite time depending on the number of nodes in a loop, while requiring a small computation and memory overhead. No extra control messages are generated and communicated over the network. The proposed algorithm does not allow any serious looping effects and maintains the simplicity of the distributed Bellman-Ford algorithm
Keywords :
distributed processing; switching networks; distributed Bellman-Ford algorithm; distributed routing algorithm; loop detection; loop resolution; memory overhead; ARPANET; Broadcasting; Computer networks; Degradation; Delay; Network topology; Protocols; Robustness; Routing;
Conference_Titel :
Military Communications Conference, 1991. MILCOM '91, Conference Record, Military Communications in a Changing World., IEEE
Conference_Location :
McLean, VA
Print_ISBN :
0-87942-691-8
DOI :
10.1109/MILCOM.1991.258191
