Document Open Access Logo

Communication Efficient Self-Stabilizing Leader Election

Authors Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, Yasumasa Tamura

PDF
Thumbnail PDF

File

LIPIcs.DISC.2020.11.pdf
  • Filesize: 0.53 MB
  • 19 pages

Document Identifiers

Author Details

Xavier Défago
  • Tokyo Institute of Technology, Japan
Yuval Emek
  • Technion - Israel Institute of Technology, Haifa, Israel
Shay Kutten
  • Technion - Israel Institute of Technology, Haifa, Israel
Toshimitsu Masuzawa
  • Osaka University, Japan
Yasumasa Tamura
  • Tokyo Institute of Technology, Japan

Funding

The work of X. Défago, T. Masuzawa, and Y. Tamura was supported by JST SICORP Grant Number JPMJSC1606. The work of Y. Emek and S. Kutten was supported by the Israeli Ministry of Science and Technology (MOST) grant number 3-13565 and by the Technion Hiroshi Fujiwara Cyber Security Research Center and the Israel National Cyber Directorate.
  • Masuzawa, Toshimitsu: The work of T. Masuzawa was supported by JSPS KAKENHI Grant Number 19H04085.

Acknowledgements

We are grateful to Valerie King for helpful discussions.

Cite AsGet BibTex

Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, and Yasumasa Tamura. Communication Efficient Self-Stabilizing Leader Election. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 11:1-11:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.DISC.2020.11

Abstract

This paper presents a randomized self-stabilizing algorithm that elects a leader r in a general n-node undirected graph and constructs a spanning tree T rooted at r. The algorithm works under the synchronous message passing network model, assuming that the nodes know a linear upper bound on n and that each edge has a unique ID known to both its endpoints (or, alternatively, assuming the KT₁ model). The highlight of this algorithm is its superior communication efficiency: It is guaranteed to send a total of Õ (n) messages, each of constant size, till stabilization, while stabilizing in Õ (n) rounds, in expectation and with high probability. After stabilization, the algorithm sends at most one constant size message per round while communicating only over the (n - 1) edges of T. In all these aspects, the communication overhead of the new algorithm is far smaller than that of the existing (mostly deterministic) self-stabilizing leader election algorithms. The algorithm is relatively simple and relies mostly on known modules that are common in the fault free leader election literature; these modules are enhanced in various subtle ways in order to assemble them into a communication efficient self-stabilizing algorithm.

Subject Classification

ACM Subject Classification
  • Computer systems organization → Fault-tolerant network topologies
Keywords
  • self-stabilization
  • leader election
  • communication overhead

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

  • A full version that contains all missing proofs as well as additional discussions is available at http://arxiv.org/abs/2008.04252 [Xavier Défago et al., 2020].

References

  1. Yehuda Afek and Anat Bremler. Self-stabilizing unidirectional network algorithms by power-supply. In SODA, volume 97, pages 111-120, 1997. Google Scholar
  2. Yehuda Afek and Geoffrey M Brown. Self-stabilization over unreliable communication media. Distributed Computing, 7(1):27-34, 1993. Google Scholar
  3. Yehuda Afek and Eli Gafni. Time and message bounds for election in synchronous and asynchronous complete networks. SIAM Journal on Computing, 20(2):376-394, 1991. Google Scholar
  4. Yehuda Afek, Shay Kutten, and Moti Yung. Memory-efficient self stabilizing protocols for general networks. In International Workshop on Distributed Algorithms, pages 15-28. Springer, 1990. Google Scholar
  5. Yehuda Afek, Shay Kutten, and Moti Yung. The local detection paradigm and its applications to self-stabilization. Theoretical Computer Science, 186(1-2):199-229, 1997. Google Scholar
  6. Marcos K Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, and Sam Toueg. Stable leader election. In International Symposium on Distributed Computing, pages 108-122. Springer, 2001. Google Scholar
  7. Thamer Alsulaiman, Andrew Berns, and Sukumar Ghosh. Low-communication self-stabilizing leader election in large networks. In Teruo Higashino, Yoshiaki Katayama, Toshimitsu Masuzawa, Maria Potop-Butucaru, and Masafumi Yamashita, editors, Stabilization, Safety, and Security of Distributed Systems, pages 348-350, 2013. Google Scholar
  8. Karine Altisen, Stéphane Devismes, Swan Dubois, and Franck Petit. Introduction to distributed self-stabilizing algorithms. Synthesis Lectures on Distributed Computing Theory, 8(1):1-165, 2019. Google Scholar
  9. Anish Arora and Mohamed Gouda. Distributed reset. In International Conference on Foundations of Software Technology and Theoretical Computer Science, pages 316-331. Springer, 1990. Google Scholar
  10. Hagit Attiya and Jennifer Welch. Distributed computing: fundamentals, simulations, and advanced topics, volume 19. John Wiley & Sons, 2004. Google Scholar
  11. Baruch Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In Proceedings of the nineteenth annual ACM symposium on Theory of computing, pages 230-240, 1987. Google Scholar
  12. Baruch Awerbuch, Israel Cidon, and Shay Kutten. Communication-optimal maintenance of replicated information. In Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pages 492-502. IEEE, 1990. Google Scholar
  13. Baruch Awerbuch, Oded Goldreich, Ronen Vainish, and David Peleg. A trade-off between information and communication in broadcast protocols. Journal of the ACM (JACM), 37(2):238-256, 1990. Google Scholar
  14. Baruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, and George Varghese. Time optimal self-stabilizing synchronization. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 652-661, 1993. Google Scholar
  15. Baruch Awerbuch, Boaz Patt-Shamir, and George Varghese. Self-stabilization by local checking and correction. In FOCS, pages 268-277, 1991. Google Scholar
  16. Baruch Awerbuch, Boaz Patt-Shamir, George Varghese, and Shlomi Dolev. Self-stabilization by local checking and global reset. In International Workshop on Distributed Algorithms, pages 326-339. Springer, 1994. Google Scholar
  17. Baruch Awerbuch and George Varghese. Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pages 258-267. IEEE, 1991. Google Scholar
  18. Joffroy Beauquier, Maria Gradinariu, and Colette Johnen. Memory space requirements for self-stabilizing leader election protocols. In Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pages 199-207, 1999. Google Scholar
  19. Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, and Sébastien Tixeuil. A new self-stabilizing minimum spanning tree construction with loop-free property. In International Symposium on Distributed Computing, pages 407-422. Springer, 2009. Google Scholar
  20. Lélia Blin and Sébastien Tixeuil. Compact self-stabilizing leader election for general networks. Journal of Parallel and Distributed Computing, 144:278-294, 2020. Google Scholar
  21. Janna Burman and Shay Kutten. Time optimal asynchronous self-stabilizing spanning tree. In International Symposium on Distributed Computing, pages 92-107. Springer, 2007. Google Scholar
  22. Mike Burrows. The chubby lock service for loosely-coupled distributed systems. In 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2006. Google Scholar
  23. Miguel Castro, Peter Druschel, A-M Kermarrec, and Antony IT Rowstron. Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in communications, 20(8):1489-1499, 2002. Google Scholar
  24. Tushar D Chandra, Robert Griesemer, and Joshua Redstone. Paxos made live: an engineering perspective. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pages 398-407, 2007. Google Scholar
  25. Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C Hsieh, Deborah A Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, and Robert E Gruber. Bigtable: A distributed storage system for structured data. ACM Transactions on Computer Systems (TOCS), 26(2):1-26, 2008. Google Scholar
  26. Johanne Cohen, Jonas Lefèvre, Khaled Maamra, George Manoussakis, and Laurence Pilard. The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs. Theoretical Computer Science, 782:54-78, 2019. Google Scholar
  27. Zeev Collin and Shlomi Dolev. Self-stabilizing depth-first search. Information Processing Letters, 49(6):297-301, 1994. Google Scholar
  28. Alain Cournier, Stéphane Rovedakis, and Vincent Villain. The first fully polynomial stabilizing algorithm for bfs tree construction. Information and Computation, 265:26-56, 2019. Google Scholar
  29. Ajoy K. Datta, Colette Johnen, Franck Petit, and Vincent Villain. Self-stabilizing depth-first token circulation in arbitrary rooted networks. Distributed Computing (DC), 13(4):207-2018, 2000. Google Scholar
  30. Ajoy K. Datta, Lawrence L. Larmore, and Toshimitsu Masuzawa. Communication efficient self-stabilizing algorithms for breadth-first search trees. In International Conference On Principles Of DIstributed Systems, pages 293-306. Springer, 2014. Google Scholar
  31. Ajoy K Datta, Lawrence L Larmore, and Priyanka Vemula. A self-stabilizing o (k)-time k-clustering algorithm. The Computer Journal, 53(3):342-350, 2010. Google Scholar
  32. B DeCleene, L Dondeti, S Griffin, T Hardjono, D Kiwior, J Kurose, D Towsley, S Vasudevan, and C Zhang. Secure group communications for wireless networks. In 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No. 01CH37277), volume 1, pages 113-117. IEEE, 2001. Google Scholar
  33. Carole Delporte-Gallet, Stéphane Devismes, and Hugues Fauconnier. Robust stabilizing leader election. In SSS'07, volume 4838, pages 219-233. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-76627-8_18.
  34. Stéphane Devismes and Colette Johnen. Silent self-stabilizing bfs tree algorithms revisited. Journal of Parallel and Distributed Computing, 97:11-23, 2016. Google Scholar
  35. Stéphane Devismes, Toshimitsu Masuzawa, and Sébastien Tixeuil. Communication efficiency in self-stabilizing silent protocols. In ICDCS'09, pages 474-481. IEEE, 2009. URL: https://doi.org/10.1109/ICDCS.2009.24.
  36. Edsger W Dijkstra. Self-stabilization in spite of distributed control. In Selected writings on computing: a personal perspective, pages 41-46. Springer, 1982. Google Scholar
  37. Danny Dolev, Maria Klawe, and Michael Rodeh. An o (n log n) unidirectional distributed algorithm for extrema finding in a circle. Journal of algorithms, 3(3):245-260, 1982. Google Scholar
  38. Shlomi Dolev. Self-stabilization. MIT Press, Cambridge, MA, USA, 2000. Google Scholar
  39. Shlomi Dolev, Mohamed G Gouda, and Marco Schneider. Memory requirements for silent stabilization. Acta Informatica, 36(6):447-462, 1999. Google Scholar
  40. Shlomi Dolev and Ted Herman. Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci., 1997, 1997. Google Scholar
  41. Shlomi Dolev, Amos Israeli, and Shlomo Moran. Resource bounds for self stabilizing message driven protocols. In Proceedings of the tenth annual ACM symposium on Principles of distributed computing, pages 281-293, 1991. Google Scholar
  42. Shlomi Dolev, Amos Israeli, and Shlomo Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7(1):3-16, 1993. Google Scholar
  43. Anaïs Durand and Shay Kutten. Reducing the number of messages in self-stabilizing protocols. In International Symposium on Stabilizing, Safety, and Security of Distributed Systems, pages 133-148. Springer, 2019. Google Scholar
  44. Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, and Yasumasa Tamura. Communication efficient self-stabilizing leader election (full version), 2020. URL: http://arxiv.org/abs/2008.04252.
  45. Michael Elkin. A simple deterministic distributed mst algorithm with near-optimal time and message complexities. Journal of the ACM (JACM), 67(2):1-15, 2020. Google Scholar
  46. Greg N Frederickson and Nancy A Lynch. Electing a leader in a synchronous ring. Journal of the ACM (JACM), 34(1):98-115, 1987. Google Scholar
  47. R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst., 5(1):66-77, January 1983. Google Scholar
  48. Mohsen Ghaffari and Fabian Kuhn. Distributed mst and broadcast with fewer messages, and faster gossiping. In 32nd International Symposium on Distributed Computing (DISC 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018. Google Scholar
  49. Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung. The google file system. In Proceedings of the nineteenth ACM symposium on Operating systems principles, pages 29-43, 2003. Google Scholar
  50. Robert Gmyr and Gopal Pandurangan. Time-message trade-offs in distributed algorithms. arXiv preprint arXiv:1810.03513, 2018. Google Scholar
  51. Kostas P Hatzis, George P Pentaris, Paul G Spirakis, Vasilis T Tampakas, and Richard B Tan. Fundamental control algorithms in mobile networks. In Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, pages 251-260, 1999. Google Scholar
  52. Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan. Energy-efficient communication protocol for wireless microsensor networks. In Proceedings of the 33rd annual Hawaii international conference on system sciences, pages 10-pp. IEEE, 2000. Google Scholar
  53. Lisa Higham and Zhiying Liang. Self-stabilizing minimum spanning tree construction on message-passing networks. In International Symposium on Distributed Computing, pages 194-208. Springer, 2001. Google Scholar
  54. Shing-Tsaan Huang and Nian-Shing Chen. Self-stabilizing depth-first token circulation on networks. Distributed Computing, 7(1):61-66, 1993. Google Scholar
  55. Michael Isard. Autopilot: automatic data center management. ACM SIGOPS Operating Systems Review, 41(2):60-67, 2007. Google Scholar
  56. Colette Johnen, Gianluigi Alari, Joffroy Beauquier, and Ajoy K Datta. Self-stabilizing depth-first token passing on rooted networks. In International Workshop on Distributed Algorithms, pages 260-274. Springer, 1997. Google Scholar
  57. Colette Johnen and Joffroy Beauquier. Distributed self-stabilizing depth-first token circulation with constant memory. In 2nd Workshop on Self-Stabilizing System (WSS), pages 4-1, 1995. Google Scholar
  58. Shmuel Katz and Kenneth J Perry. Self-stabilizing extensions for meassage-passing systems. Distributed Computing, 7(1):17-26, 1993. Google Scholar
  59. Valerie King, Shay Kutten, and Mikkel Thorup. Construction and impromptu repair of an mst in a distributed network with o (m) communication. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pages 71-80, 2015. Google Scholar
  60. Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Towards secure and scalable computation in peer-to-peer networks. In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pages 87-98. IEEE, 2006. Google Scholar
  61. Ephraim Korach, Shlomo Moran, and Shmuel Zaks. Tight lower and upper bounds for some distributed algorithms for a complete network of processors. In Proceedings of the third annual ACM symposium on Principles of distributed computing, pages 199-207, 1984. Google Scholar
  62. Alex Kravchik and Shay Kutten. Time optimal synchronous self stabilizing spanning tree. In International Symposium on Distributed Computing, pages 91-105. Springer, 2013. Google Scholar
  63. Shay Kutten and Dmitry Zinenko. Low communication self-stabilization through randomization. In International Symposium on Distributed Computing, pages 465-479. Springer, 2010. Google Scholar
  64. Leslie Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2):133–169, 1998. Google Scholar
  65. Leslie Lamport et al. Paxos made simple. ACM Sigact News, 32(4):18-25, 2001. Google Scholar
  66. Butler W Lampson. How to build a highly available system using consensus. In International Workshop on Distributed Algorithms, pages 1-17. Springer, 1996. Google Scholar
  67. Gérard Le Lann. Distributed systems - towards a formal approach. In IFIP Congress, pages 155-160, 1977. Google Scholar
  68. Mikel Larrea, Antonio Fernández, and Sergio Arévalo. Optimal implementation of the weakest failure detector for solving consensus (brief announcement). In Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, page 334, 2000. Google Scholar
  69. Edward K Lee and Chandramohan A Thekkath. Petal: Distributed virtual disks. In Proceedings of the seventh international conference on Architectural support for programming languages and operating systems, pages 84-92, 1996. Google Scholar
  70. Nancy A Lynch. Distributed algorithms. Elsevier, 1996. Google Scholar
  71. Navneet Malpani, Jennifer L Welch, and Nitin Vaidya. Leader election algorithms for mobile ad hoc networks. In Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications, pages 96-103, 2000. Google Scholar
  72. Ali Mashreghi and Valerie King. Broadcast and minimum spanning tree with o (m) messages in the asynchronous congest model. arXiv preprint arXiv:1806.04328, 2018. Google Scholar
  73. Ali Mashreghi and Valerie King. Brief announcement: Faster asynchronous mst and low diameter tree construction with sublinear communication. In 33rd International Symposium on Distributed Computing (DISC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019. Google Scholar
  74. Toshimitsu Masuzawa. Silence is golden: self-stabilizing protocols communication-efficient after convergence. In Symposium on Self-Stabilizing Systems, pages 1-3. Springer, 2011. Google Scholar
  75. Toshimitsu Masuzawa, Taisuke Izumi, Yoshiaki Katayama, and Koichi Wada. Brief announcement: Communication-efficient self-stabilizing protocols for spanning-tree construction. In OPODIS'09, pages 219-224, 2009. Google Scholar
  76. Gopal Pandurangan, Peter Robinson, and Michele Scquizzato. A time-and message-optimal distributed algorithm for minimum spanning trees. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pages 743-756, 2017. Google Scholar
  77. Boaz Patt-Shamir and Mor Perry. Proof-labeling schemes: Broadcast, unicast and in between. In International Symposium on Stabilization, Safety, and Security of Distributed Systems, pages 1-17. Springer, 2017. Google Scholar
  78. Charles E Perkins and Elizabeth M Royer. Ad-hoc on-demand distance vector routing. In Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications, pages 90-100. IEEE, 1999. Google Scholar
  79. Radia Perlman. Interconnections: bridges, routers, switches, and internetworking protocols. Addison-Wesley Professional, 2000. Google Scholar
  80. Franck Petit. Fast self-stabilizing depth-first token circulation. In International Workshop on Self-Stabilizing Systems, pages 200-215. Springer, 2001. Google Scholar
  81. Sudarshan Vasudevan, Jim Kurose, and Don Towsley. Design and analysis of a leader election algorithm for mobile ad hoc networks. In Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004., pages 350-360. IEEE, 2004. Google Scholar
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact