Abstract
The token distribution problem was originally defined by Peleg and Upfal in their seminal paper [4]. Consider a network of n processes and n tokens. Initially, the tokens are arbitrarily distributed among processes but with up to a maximum of l tokens in any process. The problem is to uniformly distribute the tokens such that every process ends up with exactly one token.
This work was partially supported by Japan Science and Technology Agency (JST) SICORP.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilization and PIF in tree networks. Distrib. Comput. 20(1), 3–19 (2007)
Datta, A.K., Larmore, L.L., Masuzawa, T., Sudo, Y.: A self-stabilizing minimal k-grouping algorithm. In: Proceedings of the 18th International Conference on Distributed Computing and Networking, pp. 3:1–3:10. ACM (2017)
Datta, A.K., Larmore, L.L., Masuzawa, T.: Constant space self-stabilizing center finding in anonymous tree networks. In: Proceedings of the International Conference on Distributed Computing and Networking, pp. 38:1–38:10 (2015)
Peleg, D., Upfal, E.: The token distribution problem. SIAM J. Comput. 18(2), 229–243 (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Sudo, Y., Datta, A.K., Larmore, L.L., Masuzawa, T. (2018). Constant-Space Self-stabilizing Token Distribution in Trees. In: Lotker, Z., Patt-Shamir, B. (eds) Structural Information and Communication Complexity. SIROCCO 2018. Lecture Notes in Computer Science(), vol 11085. Springer, Cham. https://doi.org/10.1007/978-3-030-01325-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-01325-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01324-0
Online ISBN: 978-3-030-01325-7
eBook Packages: Computer ScienceComputer Science (R0)