92 search results - page 1 / 19 » Separation Results Via Leader Election Problems |
FMCO
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We compare the expressive power of process calculi by studying the problem of electing a leader in a symmetric network of processes. We consider the π-calculus with mixe...
IAJIT
2010
13 years 3 months ago
2010
: Leader election algorithms solve the instability problem in the network which is caused by leader failure .In this paper, we propose a new leader election algorithm in two dimens...
SSS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. In this paper, we mix two well-known approaches of the fault-tolerance: robustness and stabilization. Robustness is the aptitude of an algorithm to withstand permanent fa...
WDAG
1998
Springer
13 years 9 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 8 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...