Distributed council election

Authors:
Danny Raz;Yuval Shavitt;Lixia Zhang
Affiliations:
Computer Science Faculty, Technion--I.I.T., Haifa, Israel;Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv 69978, Israel;Computer Science Department, University of California, Los Angeles
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2004

Citing 10
Cited 2

Multiple access protocols: performance and analysis

Multiple access protocols: performance and analysis
Elections in anonymous networks

Information and Computation
Scalable feedback control for multicast video distribution in the Internet

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A reliable multicast framework for light-weight sessions and application level framing

IEEE/ACM Transactions on Networking (TON)
Balanced Allocations

SIAM Journal on Computing
IDMaps: a global internet host distance estimation service

IEEE/ACM Transactions on Networking (TON)
Distributed Algorithms

Distributed Algorithms
Control Message Aggregation in Group Communication Protocols

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback

IEEE Transactions on Information Theory
Optimal deterministic timeouts for reliable scalable multicast

IEEE Journal on Selected Areas in Communications

Trivial solution for a non-trivial problem in MANETs

ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
A leader election protocol for timed asynchronous distributed systems

ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the problem of electing a small number of representatives (council) out of a (possible large) group of anonymous candidates. The problem arises in scenarios such as multicast where, to avoid feedback implosion, a small subset of the receivers is chosen to provide feedback on network conditions.We present several algorithms for this problem and analyze the expected number of messages and rounds required for their convergence. In particular, we present an algorithm that almost always converges in one round using a small number of messages (for typical council size) when the number of hosts is known. In the case where the number of hosts is unknown (and too large to be polled), our algorithms converge in a small number of rounds that improves previous results by Bolot et al. (1994).