Constant-Space Self-Stabilizing Token Distribution in Trees
Structural Information and Communication Complexity
First page number:
Last page number:
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.
Numerical Analysis and Scientific Computing
Datta, A. K.,
Larmore, L. L.,
Constant-Space Self-Stabilizing Token Distribution in Trees.
Structural Information and Communication Complexity, 2018