Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2005
2005
2014
2014

Publication Types

Select...
5
1
1

Relationship

3
4

Authors

Journals

citations
Cited by 17 publications
(19 citation statements)
references
References 8 publications
0
19
0
Order By: Relevance
“…It is easy to see that each process (N ) designates each of its neighbors at most once ( actions) before definitively sets Succ p to done (one action). We already proposed in Cournier et al [2004] and Cournier et al [2005] two snap-stabilizing DFTC protocols working under a distributed unfair daemon. The code of DFS is simpler than the code of these solutions as well as any self-stabilizing DFTC.…”
Section: Depth-first Token Circulationmentioning
confidence: 98%
See 2 more Smart Citations
“…It is easy to see that each process (N ) designates each of its neighbors at most once ( actions) before definitively sets Succ p to done (one action). We already proposed in Cournier et al [2004] and Cournier et al [2005] two snap-stabilizing DFTC protocols working under a distributed unfair daemon. The code of DFS is simpler than the code of these solutions as well as any self-stabilizing DFTC.…”
Section: Depth-first Token Circulationmentioning
confidence: 98%
“…The main drawback of the solution in Cournier et al [2004] is its memory requirement: O(N × log N ) bits per process. In Cournier et al [2005], we solve this drawback by proposing a protocol using O(log N ) bits per process. Here, the memory requirement of DFS is in O(log ) bits per process and the one of Reset(B) is in O(log N ) bits per process.…”
Section: Complexity Analysis Of Ssbb(dfs)mentioning
confidence: 99%
See 1 more Smart Citation
“…To obtain such a token circulation, one can compose a selfstabilizing leader election algorithm (e.g., in [1], [13], [15]) with one of the self-stabilizing token circulation algorithms in [9], [10], [12], [17] for arbitrary rooted networks. The composition only consists of two algorithms running concurrently with the following rule: if a process decides that it is the leader, it executes the root code of the token circulation.…”
Section: Propertymentioning
confidence: 99%
“…In particular propagation of information with feedback (PIF) is a popular problem to address [11,10,12,20,14,9,19]. Several studies present snap-stabilizing token circulation protocols [30,16,18]. There also exists snap-stabilizing protocols for neighborhood synchronization [28], binary search tree construction [8] and cut-set detection [17].…”
Section: Introductionmentioning
confidence: 99%