Title :
A distributed network connectivity algorithm
Author :
Duarte, Elias Procópio, Jr. ; Weber, Andréa
Author_Institution :
Dept. Informatics, Univ. Fed. do Parana, Curitiba, Brazil
Abstract :
The distributed network connectivity algorithm allows every node in a general topology network to determine which portions of the network are reachable and unreachable. The algorithm consists of three phases: test, dissemination, and connectivity computation. During the testing phase each link is tested by one of the adjacent nodes at alternating testing intervals. Upon the detection of a new unresponsive link; the tester starts the dissemination phase, in which a distributed breadth-first tree is employed to inform the other connected nodes about the event. At any time, any working node may run the third phase, in which a graph connectivity algorithm shows the network connectivity. We prove bounds on the worst case latency of the algorithm. Simulation results of the dissemination of one event are presented for a number of network topologies, and compared to other algorithms.
Keywords :
computer network management; distributed algorithms; testing; tree searching; connectivity computation; dissemination; distributed breadth-first tree; distributed network connectivity algorithm; general topology network; graph connectivity algorithm; simulation; test; unresponsive link; worst case latency; Delay; Electronic mail; Event detection; Fault diagnosis; Informatics; Monitoring; Network topology; Phase detection; Tree graphs; Vehicle crash testing;
Conference_Titel :
Autonomous Decentralized Systems, 2003. ISADS 2003. The Sixth International Symposium on
Print_ISBN :
0-7695-1876-1
DOI :
10.1109/ISADS.2003.1193959