TY - JOUR
T1 - Distributed council election
AU - Raz, Danny
AU - Shavitt, Yuval
AU - Zhang, Lixia
N1 - Funding Information:
Manuscript received November 26, 2001; revised April 18, 2003; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor S. Paul. The work of Y. Shavitt was supported in part by the Israel Science Foundation. D. Raz is with the Computer Science Faculty, Technion—I.I.T., Haifa, Israel (e-mail: [email protected]). Y. Shavitt is with the Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv 69978, Israel (e-mail: [email protected]). L. Zhang is with the Computer Science Department, University of California, Los Angeles 90095-1596 USA (e-mail: [email protected]). Digital Object Identifier 10.1109/TNET.2004.828945
PY - 2004/6
Y1 - 2004/6
N2 - 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).
AB - 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).
UR - http://www.scopus.com/inward/record.url?scp=4344634796&partnerID=8YFLogxK
U2 - 10.1109/TNET.2004.828945
DO - 10.1109/TNET.2004.828945
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:4344634796
SN - 1063-6692
VL - 12
SP - 483
EP - 492
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 3
ER -