2000
DOI: 10.1007/pl00008919
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: We present a deterministic distributed depth-first token passing protocol on a rooted network. This protocol uses neither the processor identifiers nor the size of the network, but assumes the existence of a distinguished processor, called the root of the network. The protocol is self-stabilizing, meaning that starting from an arbitrary state (in response to an arbitrary perturbation modifying the memory state), it is guaranteed to reach a state with no more than one token in the network. Our protocol implemen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
19
0

Year Published

2003
2003
2011
2011

Publication Types

Select...
6
2
1

Relationship

5
4

Authors

Journals

citations
Cited by 43 publications
(20 citation statements)
references
References 17 publications
1
19
0
Order By: Relevance
“…Actually, Theorems 11 and 12 show that our transformer (SSBB) allows not only to snap-stabilize some self-stabilizing protocols but also, in some case, it enhances the fairness and the time complexity of the protocols. We conjecture that we can obtain the same results with the self-stabilizing protocols in [12,13].…”
Section: Theorem 12 Starting From Any Configuration a Requested Df supporting
confidence: 71%
“…Actually, Theorems 11 and 12 show that our transformer (SSBB) allows not only to snap-stabilize some self-stabilizing protocols but also, in some case, it enhances the fairness and the time complexity of the protocols. We conjecture that we can obtain the same results with the self-stabilizing protocols in [12,13].…”
Section: Theorem 12 Starting From Any Configuration a Requested Df supporting
confidence: 71%
“…Algorithm CCRC can be combined with any self-stabilizing DF S wave protocol (e.g. [14,15]) in order to improve the memory requirement. Of course, in this case, the resulting protocol will be self-stabilizing only.…”
Section: Resultsmentioning
confidence: 99%
“…Wave algorithms have been extensively proposed in the area of self-stabilization, e.g., [9,21,16,19,23,27] for the TC problem, and [20,31] for the PIF problem. Although the algorithm proposed in [25] did not discuss the problem of PIF, this algorithm can also be considered as a self-stabilizing solution to the PIF in tree networks.…”
Section: Related Workmentioning
confidence: 99%