An efficient fault-containing self-stabilizing algorithm for the shortest path problem

Abstract

Shortest path finding has a variety of applications in transportation and communication. In this paper, we propose a fault-containing self-stabilizing algorithm for the shortest path problem in a distributed system. The proposed algorithm has made a considerable improve- ment in the worst-case stabilization time for single-fault situations, which clearly demonstrates the desirability of a well-designed fault-containing self-stabilizing algo- rithm. For single-fault situations, the worst-case sta- bilization time of the proposed algorithm is only O, where is the maximum node degree in the system, and the contamination number of the proposed algorithm is 1.