Skip to main content
SpringerLink
Log in

Compact Deterministic Self-stabilizing Leader Election

The Exponential Advantage of Being Talkative

  • Conference paper
Distributed Computing (DISC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8205))

Included in the following conference series:

Abstract

This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. When the protocol is required to be silent (i.e., when communication content remains fixed from some point in time during any execution), there exists a lower bound of Ω(logn) bits of memory per node participating to the leader election (where n denotes the number of nodes in the system). This lower bound holds even in rings. We present a new deterministic (non-silent) self-stabilizing protocol for n-node rings that uses only O(loglogn) memory bits per node, and stabilizes in O(nlog2 n) time. Our protocol has several attractive features that make it suitable for practical purposes. First, the communication model matches the one that is expected by existing compilers for real networks. Second, the size of the ring (or any upper bound for this size) needs not to be known by any node. Third, the node identifiers can be of various sizes. Finally, no synchrony assumption besides a weak fair scheduler is assumed. Therefore, our result shows that, perhaps surprisingly, trading silence for exponential improvement in term of memory space does not come at a high cost regarding stabilization time, neither it does regarding minimal assumptions about the framework for our algorithm.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamek, J., Nesterenko, M., Tixeuil, S.: Evaluating practical tolerance properties of stabilizing programs through simulation: The case of propagation of information with feedback. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 126–132. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Afek, Y., Bremler-Barr, A.: Self-stabilizing unidirectional network algorithms by power supply. Chicago J. Theor. Comput. Sci. (1998)

    Google Scholar 

  3. Arora, A., Gouda, M.G.: Distributed reset. IEEE Trans. Computers 43(9), 1026–1038 (1994)

    Article  MATH  Google Scholar 

  4. Arumugam, M., Kulkarni, S.S.: Prose: A programming tool for rapid prototyping of sensor networks. In: S-CUBE, pp. 158–173 (2009)

    Google Scholar 

  5. Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: A time-optimal self-stabilizing synchronizer using a phase clock. IEEE Trans. Dependable Sec. Comput. 4(3), 180–190 (2007)

    Article  Google Scholar 

  6. Awerbuch, B., Ostrovsky, R.: Memory-efficient and self-stabilizing network reset. In: PODC, pp. 254–263. ACM (1994)

    Google Scholar 

  7. Beauquier, J., Delaët, S., Dolev, S., Tixeuil, S.: Transient fault detectors. Distributed Computing 20(1), 39–51 (2007)

    Article  MATH  Google Scholar 

  8. Beauquier, J., Gradinariu, M., Johnen, C.: Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Distributed Computing 20(1), 75–93 (2007)

    Article  MATH  Google Scholar 

  9. Choi, Y., Gouda, M.G.: A state-based model of sensor protocols. Theor. Comput. Sci. 458, 61–75 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Dalton, A.R., McCartney, W.P., Ghosh Dastidar, K., Hallstrom, J.O., Sridhar, N., Herman, T., Leal, W., Arora, A., Gouda, M.G.: Desal alpha: An implementation of the dynamic embedded sensor-actuator language. In: ICCCN, pp. 541–547. IEEE (2008)

    Google Scholar 

  11. Kumar Datta, A., Larmore, L.L., Vemula, P.: Self-stabilizing leader election in optimal space under an arbitrary scheduler. TCS 412(40), 5541–5561 (2011)

    Article  Google Scholar 

  12. Devismes, S., Masuzawa, T., Tixeuil, S.: Communication efficiency in self-stabilizing silent protocols. In: ICDCS 2009, pp. 474–481. IEEE Press (2009)

    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. Dolev, S.: Self-stabilization. MIT Press (March 2000)

    Google Scholar 

  15. Dolev, S., Gouda, M.G., Schneider, M.: Memory requirements for silent stabilization. Acta Inf. 36(6), 447–462 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci. (1997)

    Google Scholar 

  17. Dolev, S., Israeli, A., Moran, S.: Resource bounds for self-stabilizing message-driven protocols. SIAM J. Comput. 26(1), 273–290 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  18. Dubois, S., Tixeuil, S.: A taxonomy of daemons in self-stabilization. Technical Report 1110.0334, ArXiv eprint (October 2011)

    Google Scholar 

  19. Fich, F.E., Johnen, C.: A space optimal, deterministic, self-stabilizing, leader election algorithm for unidirectional rings. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 224–239. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  20. Gouda, M.G., Cobb, J.A., Huang, C.-T.: Fault masking in tri-redundant systems. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 304–313. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  21. Herman, T., Pemmaraju, S.V.: Error-detecting codes and fault-containing self-stabilization. Inf. Process. Lett. 73(1-2), 41–46 (2000)

    Article  MathSciNet  Google Scholar 

  22. Hoepman, J.: Self-stabilizing ring-orientation using constant space. Inf. Comput. 144(1), 18–39 (1998)

    Article  MathSciNet  Google Scholar 

  23. Israeli, A., Jalfon, M.: Uniform self-stabilizing ring orientation. Inf. Comput. 104(2), 175–196 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  24. Itkis, G., Levin, L.A.: Fast and lean self-stabilizing asynchronous protocols. In: FOCS, pp. 226–239. IEEE Computer Society (1994)

    Google Scholar 

  25. Itkis, G., Lin, C., Simon, J.: Deterministic, constant space, self-stabilizing leader election on uniform rings. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972, pp. 288–302. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  26. Masuzawa, T., Tixeuil, S.: On bootstrapping topology knowledge in anonymous networks. ACM Transactions on Adaptive and Autonomous Systems 4(1) (2009)

    Google Scholar 

  27. Mayer, A.J., Ofek, Y., Ostrovsky, R.l., Yung, M.: Self-stabilizing symmetry breaking in constant-space (extended abstract). In: STOC, pp. 667–678 (1992)

    Google Scholar 

  28. McGuire, T.M., Gouda, M.G.: The Austin Protocol Compiler. Advances in Information Security, vol. 13. Springer (2005)

    Google Scholar 

  29. Tixeuil, S.: Algorithms and Theory of Computation Handbook, pp. 26.1–26.45. CRC Press, Taylor & Francis Group (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université d’Evry Val d’Essonne, France

    Lélia Blin

  2. UPMC Sorbonne Universités, France, Institut Universitaire de France, France

    Sébastien Tixeuil

  3. LIP6-CNRS UMR 7606, France

    Lélia Blin & Sébastien Tixeuil

Authors
  1. Lélia Blin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sébastien Tixeuil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Blavatnik School of Computer Sciences, Tel Aviv University, Ramat Aviv, Tel-Aviv, Israel

    Yehuda Afek

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blin, L., Tixeuil, S. (2013). Compact Deterministic Self-stabilizing Leader Election. In: Afek, Y. (eds) Distributed Computing. DISC 2013. Lecture Notes in Computer Science, vol 8205. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41527-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41527-2_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41526-5

  • Online ISBN: 978-3-642-41527-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation