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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Afek, Y., Bremler-Barr, A.: Self-stabilizing unidirectional network algorithms by power supply. Chicago J. Theor. Comput. Sci. (1998)
Arora, A., Gouda, M.G.: Distributed reset. IEEE Trans. Computers 43(9), 1026–1038 (1994)
Arumugam, M., Kulkarni, S.S.: Prose: A programming tool for rapid prototyping of sensor networks. In: S-CUBE, pp. 158–173 (2009)
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)
Awerbuch, B., Ostrovsky, R.: Memory-efficient and self-stabilizing network reset. In: PODC, pp. 254–263. ACM (1994)
Beauquier, J., Delaët, S., Dolev, S., Tixeuil, S.: Transient fault detectors. Distributed Computing 20(1), 39–51 (2007)
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)
Choi, Y., Gouda, M.G.: A state-based model of sensor protocols. Theor. Comput. Sci. 458, 61–75 (2012)
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)
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)
Devismes, S., Masuzawa, T., Tixeuil, S.: Communication efficiency in self-stabilizing silent protocols. In: ICDCS 2009, pp. 474–481. IEEE Press (2009)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)
Dolev, S.: Self-stabilization. MIT Press (March 2000)
Dolev, S., Gouda, M.G., Schneider, M.: Memory requirements for silent stabilization. Acta Inf. 36(6), 447–462 (1999)
Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci. (1997)
Dolev, S., Israeli, A., Moran, S.: Resource bounds for self-stabilizing message-driven protocols. SIAM J. Comput. 26(1), 273–290 (1997)
Dubois, S., Tixeuil, S.: A taxonomy of daemons in self-stabilization. Technical Report 1110.0334, ArXiv eprint (October 2011)
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)
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)
Herman, T., Pemmaraju, S.V.: Error-detecting codes and fault-containing self-stabilization. Inf. Process. Lett. 73(1-2), 41–46 (2000)
Hoepman, J.: Self-stabilizing ring-orientation using constant space. Inf. Comput. 144(1), 18–39 (1998)
Israeli, A., Jalfon, M.: Uniform self-stabilizing ring orientation. Inf. Comput. 104(2), 175–196 (1993)
Itkis, G., Levin, L.A.: Fast and lean self-stabilizing asynchronous protocols. In: FOCS, pp. 226–239. IEEE Computer Society (1994)
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)
Masuzawa, T., Tixeuil, S.: On bootstrapping topology knowledge in anonymous networks. ACM Transactions on Adaptive and Autonomous Systems 4(1) (2009)
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)
McGuire, T.M., Gouda, M.G.: The Austin Protocol Compiler. Advances in Information Security, vol. 13. Springer (2005)
Tixeuil, S.: Algorithms and Theory of Computation Handbook, pp. 26.1–26.45. CRC Press, Taylor & Francis Group (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)