Parallel Architectures, Algorithms, and Networks, International Symposium on (1999)
June 23, 1999 to June 25, 1999
Sajal K. Das , University of North Texas
Ajoy K. Datta , University of Nevada at Las Vegas
Sebastien Tixeuil , Universite de Paris Sud
This paper describes a parameterized protocol applicable to directed acyclic graph (DAG) topologies. The function parameter of the protocol is instantiated twice to design two protocols: (i) The topological sorting of the successor list at every node, and (ii) A shortest path routing table construction. Both protocols are self-stabilizing and thus they are resilient to transient failures and guarantee system recovery in a finite time linear in the network diameter. From the fact that a DAG topology can be imposed on a more general topology through graph labeling protocols, the solutions presented in this paper are expected to be quite useful for a large class of distributed systems, where an optimal routing along with the robustness and fault tolerance are key factors.
Distributed systems, self-stabilization, directed acyclic graphs, fault-tolerance
A. K. Datta, S. K. Das and S. Tixeuil, "Self-Stabilizing Algorithms in DAG Structured Networks," Parallel Architectures, Algorithms, and Networks, International Symposium on(ISPAN), Fremantle, Australia, 1999, pp. 190.