Download:
|
by Danny Raz, Yuval Shavitt, Lixia Zhang
http://www.eng.tau.ac.il/~shavitt/pub/RSZ03.ps
Add To MetaCart
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 [BTW94]. I.
Citations
|
1099
|
Distributed Algorithms
– Lynch
- 1996
|
|
983
|
A reliable multicast framework for light-weight sessions and application level framing
– Floyd, Jacobson, et al.
- 1995
|
|
278
|
Scalable feedback control for multicast video distribution in the internet
– Bolot, Turletti, et al.
- 1994
|
|
191
|
IDMaps: A global Internet host distance estimation service
– Francis, Jamin, et al.
- 2001
|
|
177
|
Balanced allocations
– Azar, Broder, et al.
- 1994
|
|
78
|
Multiple Access Protocols: Performance and Analysis
– Rom, Sidi
- 1990
|
|
57
|
Optimal Multicast Feedback
– Nonnenmacher, Biersack
- 1998
|
|
52
|
Multicast transport protocols for high speed networks
– Paul, Sabnani, et al.
- 1994
|
|
37
|
Optimal Deterministic Timeouts for Reliable Scalable Multicast
– Grossglauser
- 1996
|
|
13
|
A collision resolution protocol for random access channels with energy detectors
– Georgiadis, Papantoni-Kazakos
- 1982
|
|
11
|
Bounds on the performance of protocols for a multiple access broadcast channel
– Pippenger
- 1981
|
|
8
|
Elections in anonymous networks
– Afek, Matias
- 1994
|
|
5
|
Resolution of a conflict of known multiplicity
– Tsybakov
- 1980
|
|
3
|
Bounds for packet transmission rate in a random-multiple-access system
– Tsybakov, Mikhailov, et al.
- 1983
|
|
2
|
How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback
– Roszinko, Vanroose
- 1997
|
|
2
|
Control message aggregation in group communication protocols
– Khanna, Naor, et al.
- 2002
|
|
2
|
Random access algorithms with multiple reception capability and N-ary feedback channel
– Likhanov, Plotnik, et al.
- 1993
|
