Abstract

Many distributed protocols arising in applications in online load balancing and dynamic resource allocation can be modeled by dynamic allocation processes related to the “balls into bin” problems. Traditionally the main focus of the research on dynamic allocation processes is on verifying whether a given process is stable, and if so, on analyzing its behavior in the limit (i.e., after sufficiently many steps). Once we know that the process is stable and we know its behavior in the limit, it is natural to analyze its recovery time, which is the time needed by the process to recover from any arbitrarily bad situation and to arrive very closely to a stable (i.e., a typical) state. This investigation is important to provide assurance that even if at some stage the process has reached a highly undesirable state, we can predict with high confidence its behavior after the estimated recovery time. In this paper we present a genera / framework to study the recovery time of discrete-time dynamic allocation processes. We model allocation processes by suitably chosen ergodic Markov chains. For a given Markov chain we apply path coupling arguments to bound its convergence rates to the stationary distribution, which directly yields the estimation of the recovery time of the corresponding allocation process. Our coupling approach provides in a relatively simple way an accurate prediction of the recovery time. In particular, we show that our method can be applied to significantly improve estimations of the recovery time for various allocation processes related to allocations of balls into bins, and for the edge orientation problem studied before by Ajtai et al.

Citations

246	Group representations in Probability and Statistics - Diaconis - 1988
210	Balanced allocations - Azar, Broder, et al. - 1994
203	The Markov chain Monte Carlo method: An approach to approximate counting and integration - Jerrum, Sinclair - 1996
200	Random walk on finite groups and rapidly mixing Markov chains - Aldous - 1983
130	Path coupling: A technique for proving rapid mixing in markov chains - Bubley, Dyer - 1997
72	How useful is old information - Mitzenmacher - 1997
65	Urn models and their applications: An approach to modern discrete probability theory - NL, Kotz - 1977
53	Faster random generation of linear extensions - Bubley, Dyer - 1998
51	Parallel randomized load balancing - Adler, Chakrabarti, et al. - 1998
48	On the analysis of randomized load balancing schemes - Mitzenmacher - 1999
42	Load balancing and density dependent jump Markov processes - Mitzenmacher - 1996
32	Randomized allocation processes - Czumaj, Stemann - 2001
17	Studying balanced allocations with differential equations - Mitzenmacher - 1999
12	Allocating weighted jobs in parallel - Berenbrink, Heide, et al.
10	A Fair Carpool Scheduling Algorithm - Fagin, Williams - 1983
7	walls: analysis of a combinatorial game - Disks - 1989
7	Lectures on the Coupling Method, Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics. A Wiley-Interscience Publication - Lindvall - 1992
1	Beating the 2A bound for approximately counting colourings: A computer-assisted proof of rapid mixing - Bubley, Dyer, et al.
1	Delayed path coupling and its applications to analysing distributed stochastic processes for generating random permutations - Czumaj, Kanarek, et al. - 1998