A self-stabilizing algorithm for the shortest path problem assuming the distributed demon

Huang, Tetz C.

doi:10.1016/j.camwa.2005.05.002

Cited by 14 publications

(6 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [8,9], self-stabilizing algorithms for the single-destination shortest-path problem are presented; both protocols require a central daemon, that is only one process can be executed at each instant. In [10], Huang proves that the algorithms in [8,9] also work under the unfair daemon, which is the most general daemon. However, no upper bounds on the time (rounds or number of execution steps) are given.…”

Section: Related Workmentioning

confidence: 99%

Disconnected components detection and rooted shortest-path tree maintenance in networks

Glacet

Hanusse

Ilcinkas

et al. 2019

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Many articles deal with the problem of maintaining a rooted shortest-path tree. However, after some edge deletions, some nodes can be disconnected from the connected component V r of some distinguished node r. In this case, an additional objective is to ensure the detection of the disconnection by the nodes that no longer belong to V r. We present a detailed analysis of a silent self-stabilizing algorithm. We prove that it solves this more demanding task in anonymous weighted networks with the following additional strong properties: it runs without any knowledge on the network and under the unfair daemon, that is without any assumption on the asynchronous model. Moreover, it terminates in less than 2n + D rounds for a network of n nodes and hop-diameter D.

show abstract

Section: Related Workmentioning

confidence: 99%

Disconnected components detection and rooted shortest-path tree maintenance in networks

Glacet

Hanusse

Ilcinkas

et al. 2019

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Lemmas 2 and 3 in [15]). Consequently, finding shortest paths becomes an easy task in the legitimate state (see Concluding Remarks in [19]).…”

Section: The Algorithmmentioning

confidence: 99%

“…Lemmas 2 and 3 in [15], and Lemmas 1 and 2 in [19] ). One can also see that in the legitimate state, not only is the d-value of each node i of the system equal to the distance d(i, r ) between i and r , but also the p-value and c-value of each node i of the system can reveal information about the d-values of i's neighbors.…”

Section: Our Fault-containing Algorithmmentioning

confidence: 99%

“…Basically, we believe that if two self-stabilizing algorithms operate under two different computational models, then they are not really comparable to each other unless one computational model is more general than the other (for instance, the distributed demon model is more general than the central demon model (cf. [15])). Under the synchronous model, the algorithms in [1,3] are capable of containing multiple faults.…”

mentioning

confidence: 91%

“…Inspired also by [18], Huang and Lin [19], using the bounded function technique, proved that the algorithm in [4] is self-stabilizing under the central demon model. In [15,20], Huang et al generalized the results in [4,19] and showed that the algorithm in [4,19] is actually self-stabilizing under the distributed demon model. In [16], Huang re-examined the Dolev model and proposed a self-stabilizing algorithm for the shortest path problem that generalizes the BFS tree-finding algorithm in [8].…”

mentioning

confidence: 94%

See 2 more Smart Citations

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

Huang

2006

Distrib. Comput.

Self Cite

View full text Add to dashboard Cite

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 improvement made by the proposed algorithm in stabilization times for single-fault situations can demonstrate the desirability of an efficient fault-containing self-stabilizing algorithm. For single-fault situations, the worst-case stabilization time of the proposed algorithm is O( ), where is the maximum node degree in the system, and the contamination number of the proposed algorithm is 1.

show abstract

Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks

Glacet

Hanusse

Ilcinkas

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Many articles deal with the problem of maintaining a rooted shortest-path tree. However, after some edge deletions, some nodes can be disconnected from the connected component Vr of some distinguished node r. In this case, an additional objective is to ensure the detection of the disconnection by the nodes that no longer belong to Vr. Without any assumption on the asynchronous model (unfair daemon), with no knowledge of the network and within an anonymous network, we present a silent self-stabilizing algorithm solving this more demanding task and running in less than 2n + D rounds for a network of n nodes and hopdiameter D.

show abstract

A self-stabilizing algorithm for the shortest path problem assuming the distributed demon

Cited by 14 publications

References 12 publications

Disconnected components detection and rooted shortest-path tree maintenance in networks

Disconnected components detection and rooted shortest-path tree maintenance in networks

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

Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks

Contact Info

Product

Resources

About