Abstract
In this work, we consider the problem of finding the center, or centers, of a chain network and a tree network.
This is a preview of subscription content, log in via an institution.
References
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)
Blair, J.R.S., Manne, F.: Efficient self-stabilizing algorithms for tree networks. In: 2003 Proceedings of 23rd International Conference on Distributed Computing Systems, pp. 20–26. IEEE (2003)
Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilizing PIF in tree networks. Distrib. Comput. 20, 3–19 (2007)
Datta, A.K., Larmore, L.L., Masuzawa, T.: Constant space self-stabilizing center finding in anonymous tree networks. In: Proceedings of the 2015 International Conference on Distributed Computing and Networking ICDCN 2015, pp. 38:1–38:10 (2015)
Dijkstra, E.W.: Self stabilizing systems in spite of distributed control. Commun. Assoc. Comput. Mach. 17, 643–644 (1974)
Moore, F.R., Langdon, G.G.: A generalized firing squad problem. Inf. Control 12(3), 212–220 (1968)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Sudo, Y., Datta, A.K., Larmore, L.L., Masuzawa, T. (2017). Brief Announcement: Reduced Space Self-stabilizing Center Finding Algorithms in Chains and Trees. In: Spirakis, P., Tsigas, P. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2017. Lecture Notes in Computer Science(), vol 10616. Springer, Cham. https://doi.org/10.1007/978-3-319-69084-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-69084-1_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69083-4
Online ISBN: 978-3-319-69084-1
eBook Packages: Computer ScienceComputer Science (R0)