Constant-Space Self-stabilizing Token Distribution in Trees
The token distribution problem was originally defined by Peleg and Upfal in their seminal paper . 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.
- 2.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)Google Scholar
- 3.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)Google Scholar