# Dynamic Averaging Load Balancing on Cycles

Sabour Amirmojtaba

ICALP, 2020.

EI

Abstract:

We consider the following dynamic load-balancing process: given an underlying graph $G$ with $n$ nodes, in each step $t\geq 0$, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in ...More

Code:

Data: