Improved Analysis of Deterministic Load-Balancing Schemes

Abstract

We consider the problem of deterministic load balancing of tokens in the discrete model. A set of n processors is connected into a d-regular undirected network. In every time step, each processor exchanges some of its tokens with each of its neighbors in the network. The goal is to minimize the discrepancy between the number of tokens on the most-loaded and the least-loaded processor as quickly as possible. Rabani et al. (1998) present a general technique for the analysis of a wide class of discrete load balancing algorithms. Their approach is to characterize the deviation between the actual loads of a discrete balancing algorithm with the distribution generated by a related Markov chain. The Markov chain can also be regarded as the underlying model of a continuous diffusion algorithm. Rabani et al. showed that after time T = O(log(Kn)/µ), any algorithm of their class achieves a discrepancy of O(d log n/µ), where µ is the spectral gap of the transition matrix of the graph, and K is the initial load discrepancy in the system.In this work we identify some natural additional conditions on deterministic balancing algorithms, resulting in a class of algorithms reaching a smaller discrepancy. This class contains well-known algorithms, e.g., the ROTOR-ROUTER. Specifically, we introduce the notion of cumulatively fair loadbalancing algorithms where in any interval of consecutive time steps, the total number of tokens sent out over an edge by a node is the same (up to constants) for all adjacent edges. We prove that algorithms which are cumulatively fair and where every node retains a sufficient part of its load in each step, achieve a discrepancy of O(min{d log n/µ, d √ n}) in time O(T ). We also show that in general neither of these assumptions may be omitted without increasing discrepancy. We then show by a combinatorial potential reduction argument that any cumulatively fair scheme satisfying some additional assumptions achieves a discrepancy of O(d) almost as quickly as the continuous diffusion process. This positive result applies to some of the simplest and most natural discrete load balancing schemes.

Reversible random walks on dynamic graphs

“…Hassin and Peleg [26] showed t coal ≤ t meet log n, while t meet ≤ t coal is trivial. Recent works on the meeting and coalescing times consider the lazy simple random walk on a connected graph G [8,17,31,40]. For example, Kanade, Mallmann-Trenn, and Sauerwald [31] showed…”

“…Berenbrink, Giakkoupis, Kermarrec, and Mallmann-trenn [8] studied the pull voting according to (P LS (G t )) t≥1 for a sequence (G t ) t≥1 of graphs constructed by an adaptive adversary. That is, for every t, the graph G t can depend on the history of opinion configurations.…”

A survey of size counting in population protocols

“…Stabilization can take Θ(n) time in the worst case, but it takes only O(log n) time for all agents to hold three consecutive values (two of which are ⌊m/n⌋ or ⌈m/n⌉) [25,29]. The discrete averaging technique has been crucial in a number of polylogarithmic-time protocols for problems such as population size counting [22,23] and majority related problems [13,17,28,29] and its time complexity has been tightly analyzed [17,25,26,30].…”

“…tightly analyzed in [17,23,25,26,30], that has since been widely deployed in other protocols to solve the counting problem [17,22,23,29] and the exact majority problem [18,28,29]. (See Protocols 2 and 5.…”