129 search results - page 6 / 26 » Randomized leader election |
SAC
2009
ACM
14 years 3 days ago
2009
ACM
Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the problem ...
JPDC
2010
13 years 5 months ago
2010
This article deals with stabilization and fault-tolerance. We consider two types of stabilization: the self- and the pseudo- stabilization. Our goal is to implement the self- and/...
STACS
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
WDAG
1998
Springer
13 years 11 months ago
1998
Springer
The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader El...
WDAG
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...