Election in unidirectional rings with homonyms

Abstract We study leader election in unidirectional rings of homonyms that have no a priori knowledge of the number of processes. In this context, we show that there exists no algorithm that solves the process-terminating leader election problem for the class of asymmetrically labeled unidirectional rings. More precisely, we prove that there is no process-terminating leader election algorithm even for the subclass of unidirectional rings where at least one label is unique. Message-terminating leader election is also impossible for the class of unidirectional rings where only a bound on multiplicity is known. However, we show that the process-terminating leader election is possible for two particular subclasses of asymmetrically labeled unidirectional rings where the multiplicity is bounded. We propose three efficient algorithms and analyze their complexities. We also give some non-trivial lower bounds.

[1]  Sebastiano Vigna,et al.  An Effective Characterization of Computability in Anonymous Networks , 2001, DISC.

[2]  Carole Delporte-Gallet,et al.  Uniform Consensus with Homonyms and Omission Failures , 2013, ICDCN.

[3]  Victor K.-W. Wei,et al.  Short Linkable Ring Signatures for E-Voting, E-Cash and Attestation , 2005, ISPEC.

[4]  Douglas S. Reeves,et al.  Self-stabilizing structured ring topology P2P systems , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[5]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[6]  Louise E. Moser,et al.  Byzantine Fault Detectors for Solving Consensus , 2003, Comput. J..

[7]  Carole Delporte-Gallet,et al.  Byzantine agreement with homonyms in synchronous systems , 2013, Theor. Comput. Sci..

[8]  Yves Métivier,et al.  Election in partially anonymous networks with arbitrary knowledge in message passing systems , 2012, Distributed Computing.

[9]  Andrzej Pelc,et al.  Topology recognition and leader election in colored networks , 2016, Theor. Comput. Sci..

[10]  Andrzej Pelc,et al.  Leader Election in Rings with Nonunique Labels , 2004, Fundam. Informaticae.

[11]  Alessandro Panconesi,et al.  On the importance of having an identity or, is consensus really universal? , 2005, Distributed Computing.

[12]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[13]  R. Lyndon.  On Burnside’s problem , 1954 .

[14]  David Chaum,et al.  Group Signatures , 1991, EUROCRYPT.

[15]  Franz J. Hauck,et al.  A Flexible Network Approach to Privacy of Blockchain Transactions , 2018, 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS).

[16]  Carlo Mastroianni,et al.  Description of the Self-Chord P2P Application , 2011, WOA.

[17]  Pradip K. Srimani,et al.  Self-stabilizing anonymous leader election in a tree , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[18]  Nirwan Ansari,et al.  RE-NOTE: An E-voting scheme based on ring signature and clash attack protection , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[19]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[20]  Yishay Mansour,et al.  Fair Leader Election for Rational Agents in Asynchronous Rings and Networks , 2018, PODC.

[21]  Yael Tauman Kalai,et al.  How to Leak a Secret: Theory and Applications of Ring Signatures , 2001, Essays in Memory of Shimon Even.

[22]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[23]  Rachid Guerraoui,et al.  Byzantine agreement with homonyms , 2011, PODC '11.

[24]  Hagit Attiya,et al.  Computing in Totally Anonymous Asynchronous Shared Memory Systems , 1998, Inf. Comput..

[25]  Paola Flocchini,et al.  Sorting and election in anonymous asynchronous rings , 2004, J. Parallel Distributed Comput..

[26]  Gary L. Peterson,et al.  An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem , 1982, TOPL.

[27]  Sung-Hoon Park.  About the Relationship between Election Problem and Failure Detector in Asynchronous Distributed Systems , 2003, International Conference on Computational Science.

[28]  Pratyay Kuila,et al.  A novel leader election algorithm based on resources for ring networks , 2018, Int. J. Commun. Syst..