Title

Constant-Space Self-Stabilizing Token Distribution in Trees

Document Type

Conference Proceeding

Publication Date

10-31-2018

Publication Title

Structural Information and Communication Complexity

Volume

2018

First page number:

25

Last page number:

29

Abstract

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.

Disciplines

Numerical Analysis and Scientific Computing

Language

English

UNLV article access

Share

COinS