Sciweavers

129 search results - page 3 / 26
» Randomized leader election
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Towards Secure and Scalable Computation in Peer-to-Peer Networks
We consider the problems of Byzantine Agreement and Leader Election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary. The first problem...
Valerie King, Jared Saia, Vishal Sanwalani, Erik V...
DSN
2008
IEEE
14 years 1 months ago
A robust and lightweight stable leader election service for dynamic systems
We describe the implementation and experimental evaluation of a fault-tolerant leader election service for dynamic systems. Intuitively, distributed applications can use this serv...
Nicolas Schiper, Sam Toueg
TCS
2008
13 years 7 months ago
Election and rendezvous with incomparable labels
In "Can we elect if we cannot compare" (SPAA'03), Barri`ere, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the label...
Jérémie Chalopin
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 7 months ago
Modified Bully Algorithm using Election Commission
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
Muhammad Mahbubur Rahman, Afroza Nahar
IAJIT
2010
88views more  IAJIT 2010»
13 years 6 months ago
Leader Election Algorithm in 2D Torus Networks with the Presence of One Link Failure
: 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...
Mohammed Refai, Ahmad Sharieh, Fahad Alshammari