Skip to main content
SpringerLink
Log in

Leader Election in Rings with Homonyms

  • Conference paper
  • First Online:
Networked Systems (NETYS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 8593))

Included in the following conference series:

Abstract

Considering the case of homonyms processes (some processes may share the same identifier) on a ring, we give here a necessary and sufficient condition on the number of identifiers to enable leader election. We prove that if \(l\) is the number of identifiers then message-terminating election is possible if and only if \(l\) is greater than the greatest proper divisor of the ring size even if the processes do not know the ring size. If the ring size is known, we propose a process-terminating algorithm exchanging \(O(n \log (n))\) messages that is optimal.

This work is supported by the ANR DISPLEXITY.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abrahamson, K., Adler, A., Gelbart, R., Higham, L., Kirkpatrick, D.: The bit complexity of randomized leader election on a ring. SIAM J. Comput. 18(1), 12–29 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  2. Angluin, D.: Local and global properties in networks of processors (extended abstract). In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, STOC ’80, pp. 82–93. ACM, New York (1980)

    Google Scholar 

  3. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006)

    Article  MATH  Google Scholar 

  4. Arévalo, S., Anta, A.F., Imbs, D., Jiménez, E., Raynal, M.: Failure detectors in homonymous distributed systems (with an application to consensus). In: ICDCS, pp. 275–284 (2012)

    Google Scholar 

  5. Boldi, P., Shammah, S., Vigna, S., Codenotti, B., Gemmell, P., Simon, J.: Symmetry breaking in anonymous networks: characterizations. In: ISTCS, pp. 16–26 (1996)

    Google Scholar 

  6. Burns, J.E., Pachl, J.K.: Uniform self-stabilizing rings. ACM Trans. Program. Lang. Syst. 11(2), 330–344 (1989)

    Article  Google Scholar 

  7. Chalopin, J., Godard, E., Métivier, Y.: Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distrib. Comput. 25(4), 297–311 (2012)

    Article  MATH  Google Scholar 

  8. Chalopin, J., Métivier, Y., Morsellino, T.: Enumeration and leader election in partially anonymous and multi-hop broadcast networks. Fundam. Inform. 120(1), 1–27 (2012)

    MATH  Google Scholar 

  9. Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257–265. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  10. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.-M., Ruppert, E., Tran-The, H.: Byzantine agreement with homonyms. In: PODC, pp. 21–30. ACM (2011)

    Google Scholar 

  11. Delporte-Gallet, C., Fauconnier, H., Tran-The, H.: Byzantine agreement with homonyms in synchronous systems. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds.) ICDCN 2012. LNCS, vol. 7129, pp. 76–90. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. Delporte-Gallet, C., Fauconnier, H., Tran-The, H.: Homonyms with forgeable identifiers. In: Even, G., Halldórsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 171–182. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)

    Article  MATH  Google Scholar 

  14. Dobrev, S., Pelc, A.: Leader election in rings with nonunique labels. Fundam. Inform. 59(4), 333–347 (2004)

    MATH  MathSciNet  Google Scholar 

  15. Franklin, R.: On an improved algorithm for decentralized extrema finding in circular configurations of processors. Commun. ACM 25(5), 336–337 (1982)

    Article  MathSciNet  Google Scholar 

  16. Huang, S.-T.: Leader election in uniform rings. ACM Trans. Program. Lang. Syst. 15(3), 563–573 (1993)

    Article  Google Scholar 

  17. Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: Sublinear bounds for randomized leader election. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol. 7730, pp. 348–362. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  18. Mavronicolas, M., Michael, L., Spirakis, P.G.: Computing on a partially eponymous ring. Theor. Comput. Sci. 410(6–7), 595–613 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  19. Pachl, J.K., Korach, E., Rotem, D.: Lower bounds for distributed maximum-finding algorithms. J. ACM 31(4), 905–918 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  20. Peterson, G.L.: An o(nlog n) unidirectional algorithm for the circular extrema problem. ACM Trans. Program. Lang. Syst. 4(4), 758–762 (1982)

    Article  MATH  Google Scholar 

  21. Xu, Z., Srimani, P.K.: Self-stabilizing anonymous leader election in a tree. In: IPDPS. IEEE Computer Society (2005)

    Google Scholar 

  22. Yamashita, M., Kameda, T.: Leader election problem on networks in which processor identity numbers are not distinct. IEEE Trans. Parallel Distrib. Syst. 10(9), 878–887 (1999)

    Article  Google Scholar 

  23. Yamashita, M., Kameda, T.: Modeling k-coteries by well-covered graphs. Networks 34(3), 221–228 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA- Université Paris-Diderot, Paris, France

    Carole Delporte-Gallet, Hugues Fauconnier & Hung Tran-The

Authors
  1. Carole Delporte-Gallet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hugues Fauconnier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hung Tran-The
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carole Delporte-Gallet .

Editor information

Editors and Affiliations

  1. Northeastern University, Boston, Massachusetts, USA

    Guevara Noubir

  2. Université de Rennes 1, Rennes Cedex, France

    Michel Raynal

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Delporte-Gallet, C., Fauconnier, H., Tran-The, H. (2014). Leader Election in Rings with Homonyms. In: Noubir, G., Raynal, M. (eds) Networked Systems. NETYS 2014. Lecture Notes in Computer Science(), vol 8593. Springer, Cham. https://doi.org/10.1007/978-3-319-09581-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09581-3_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09580-6

  • Online ISBN: 978-3-319-09581-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation