Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing 2004
DOI: 10.1145/1011767.1011790
|View full text |Cite
|
Sign up to set email alerts
|
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
75
0
9

Year Published

2005
2005
2019
2019

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 61 publications
(84 citation statements)
references
References 13 publications
0
75
0
9
Order By: Relevance
“…Graph theoretic optimization problems are useful for such dynamic networks; fault tolerant distributed protocols for such problems provide the key resources for designing wireless, sensor and ad hoc networks and they offer new insight into the fundamental role of discrete distributed algorithms in developing these real life applications [15].…”
Section: Resultsmentioning
confidence: 99%
“…Graph theoretic optimization problems are useful for such dynamic networks; fault tolerant distributed protocols for such problems provide the key resources for designing wireless, sensor and ad hoc networks and they offer new insight into the fundamental role of discrete distributed algorithms in developing these real life applications [15].…”
Section: Resultsmentioning
confidence: 99%
“…These results assume that U is the algorithm of Boulinier et al in [5] The authors show that 2n − 1 states per process (actually the range of the phase clock) are sufficient to make U work in any topology (the worst case being the cycle topology). Moreover, using 2n − 1 states, the stabilization time of U is in O(n) rounds [4] and O(Dn 3 ) steps [14], respectively.…”
Section: Theorem 10mentioning
confidence: 99%
“…An algorithm that matches all these requirements can be found in [5]. The local program of each process p in A t is obtained as follows:…”
mentioning
confidence: 99%
“…In [2], the authors propose a self-stabilizing asynchronous unison distributed protocol in any anonymous distributed system under the unfair distributed daemon. The main idea of this protocol is to reset the clock value of each vertex that detects any local clock inconsistence (that is, whenever some neighbor that has a not locally comparable clock value).…”
Section: An Execution E Satisfies Specau If Every Configuration Of E mentioning
confidence: 99%
“…The key to addressing both challenges was a "reduction" to clock synchronization: more specifically, leveraging the self-stabilizing asynchronous unison protocol of [2] within mutual exclusion. We show that it is sufficient to choose correctly the clock size and to grant the access to critical section upon some clock values to ensure (i) the self-stabilization of the protocol for any asynchronous execution as well as (ii) the optimality of its stabilization time for synchronous ones.…”
Section: Introductionmentioning
confidence: 99%