Constant-Space Self-stabilizing Token Distribution in Trees

  • Yuichi SudoEmail author
  • Ajoy K. Datta
  • Lawrence L. Larmore
  • Toshimitsu Masuzawa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11085)


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.


  1. 1.
    Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilization and PIF in tree networks. Distrib. Comput. 20(1), 3–19 (2007)zbMATHGoogle Scholar
  2. 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. 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
  4. 4.
    Peleg, D., Upfal, E.: The token distribution problem. SIAM J. Comput. 18(2), 229–243 (1989)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Yuichi Sudo
    • 1
    Email author
  • Ajoy K. Datta
    • 2
  • Lawrence L. Larmore
    • 2
  • Toshimitsu Masuzawa
    • 1
  1. 1.Osaka UniversitySuita, OsakaJapan
  2. 2.University of Nevada, Las VegasLas VegasUSA

Personalised recommendations