Abstract
We give a weak leader election algorithm, which elects a leader or two neighboring co-leaders of an anonymous tree network, as well as give distributed algorithms for finding centers and medians of anonymous tree networks. All algorithms are in the comparison model, are self-stabilizing and silent under the unfair daemon. Each of the three problems is solved in O(Diam) rounds with step complexity O(n·Diam). The per process space complexity is O(1) for weak leader election, O(logDiam) for finding centers, and O(logn) for finding medians. These are the minimum possible space complexities for self-stabilizing silent algorithms. The main innovation is the introduction of the constant space implementation of parent pointers using the finite Abelian group ℤ5.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Antonoiu, G., Srimani, P.K.: A self-stabilizing leader election algorithm for tree graphs. J. Parallel Distrib. Comput. 34(2), 227–232 (1996)
Antonoiu, G., Srimani, P.K.: A self-stabilizing distributed algorithm to find the center of a tree graph. Parallel Algorithms Appl. 10(3-4), 237–248 (2007)
Antonoiu, G., Srimani, P.K.: A self-stabilizing distributed algorithm to find the median of a tree graph. Journal of Computer and System Sciences 58(1), 215–221 (1999)
Xu, Z., Srimani, P.K.: Self-stabilizing anonymous leader election in a tree. Int. J. Found. Comput. Sci. 17(2), 323–336 (2006)
Blair, J.R., Manne, F.: Efficient self-stabilizing algorithms for tree networks. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 20–26. IEEE (2003)
Bruell, S.C., Ghosh, S., Karaata, M.H., Pemmaraju, S.V.: Self-stabilizing algorithms for finding centers and medians of trees. SIAM J. Comput. 29(2), 600–614 (1999)
Lynch, N.: Distributed Algorithms. Morgan Kaufmann (1996)
Boulinier, C., Petit, F., Villain, V.: When graph theory helps self-stabilization. In: Proceedings of the Twenty-third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, pp. 150–159 (2004)
Chepoi, V., Fevat, T., Godard, E., Vaxès, Y.: A Self-stabilizing algorithm for the median problem in partial rectangular grids and Their relatives. Algorithmica 62(1-2), 146–168 (2012)
Dijkstra, E.: Self stabilizing systems in spite of distributed control. Communications of the Association of Computing Machinery 17, 643–644 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Datta, A.K., Larmore, L.L. (2013). Leader Election and Centers and Medians in Tree Networks. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2013. Lecture Notes in Computer Science, vol 8255. Springer, Cham. https://doi.org/10.1007/978-3-319-03089-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-03089-0_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03088-3
Online ISBN: 978-3-319-03089-0
eBook Packages: Computer ScienceComputer Science (R0)