Distributing tokens on a hypercube without error accumulation

The problem of load balancing on the hypercube is considered. A number of tokens are placed at the nodes and the goal is to redistribute them evenly throughout the network. Initially, each of the p nodes stores up to m tokens. A simple algorithm is presented, operating in /spl Oscr/(log p+m/spl middot/log log p) time on average.