Elections in Anonymous Networks

Abstract We address the problem of electing a leader in an anonymous, asynchronous network of arbitrary topology. Our algorithms are considerably simpler than known algorithms and have equal or improved communication complexity.

[1]  Baruch Awerbuch,et al.  A New Distributed Depth-First-Search Algorithm , 1985, Inf. Process. Lett..

[2]  Jan K. Pachl,et al.  A Lower Bound for Probabilistic Distributed Algorithms , 1987, J. Algorithms.

[3]  David G. Kirkpatrick,et al.  The Bit Complexity of Randomized Leader Election on a Ring , 1989, SIAM J. Comput..

[4]  Michael E. Saks,et al.  Local management of a global resource in a communication network , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[5]  Yehuda Afek,et al.  Time and message bounds for election in synchronous and asynchronous complete networks , 1985, PODC '85.

[6]  Moti Yung,et al.  Memory-Efficient Self Stabilizing Protocols for General Networks , 1990, WDAG.

[7]  Alon Itai.  On the computational power needed to elect a leader , 1990 .

[8]  Hagit Attiya,et al.  Computing on an anonymous ring , 1988, JACM.

[9]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.

[10]  Baruch Schieber,et al.  Calling Names on Nameless Networks , 1994, Inf. Comput..

[11]  Richard Cole,et al.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.

[12]  Alan M. Frieze,et al.  On the connectivity of random m-orientable graphs and digraphs , 1982, Comb..

[13]  Ivan Lavallée,et al.  Spanning Tree Construction for Nameless Networks , 1990, International Workshop on Distributed Algorithms.

[14]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[15]  Nicola Santoro,et al.  Breaking Symmetry in Synchronous Networks , 1986, Aegean Workshop on Computing.

[16]  Alon Itai,et al.  Symmetry breaking in distributed networks , 1990, Inf. Comput..

[17]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[18]  Ernest Jen-Hao Chang.  Decentralized algorithms in distributed systems , 1979 .

[19]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[20]  Shmuel Zaks,et al.  Tight lower and upper bounds for some distributed algorithms for a complete network of processors , 1984, PODC '84.

[21]  Yossi Matias,et al.  Simple and Efficient Election Algorithms for Anonymous Networks , 1989, WDAG.