Balanced Allocation with Random Walk Based Sampling

10/05/2018
by   Dengwang Tang, et al.
0

In the standard ball-in-bins experiment, a well-known scheme is to sample d bins independently and uniformly at random and put the ball into the least loaded bin. It can be shown that this scheme yields a maximum load of n/ d+O(1) with high probability. Subsequent work analyzed the model when at each time, d bins are sampled through some correlated or non-uniform way. However, the case when the sampling for different balls are correlated are rarely investigated. In this paper we propose three schemes for the ball-in-bins allocation problem. We assume that there is an underlying k-regular graph connecting the bins. The three schemes are variants of power-of-d choices, except that the sampling of d bins at each time are based on the locations of d independently moving non-backtracking random walkers, with the positions of the random walkers being reset when certain events occurs. We show that under some conditions for the underlying graph that can be summarized as the graph having large enough girth, all three schemes can perform as well as power-of-d, so that the maximum load is bounded by n/ d+O(1) with high probability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/03/2018

The power of thinning in balanced allocation

Balls are sequentially allocated into n bins as follows: for each ball, ...
research
06/12/2023

On the Validity of Conformal Prediction for Network Data Under Non-Uniform Sampling

We study the properties of conformal prediction for network data under v...
research
05/27/2018

Preferential Attachment When Stable

We study an urn process with two urns, initialized with a ball each. Bal...
research
10/11/2021

Long-term balanced allocation via thinning

We study the long-term behavior of the two-thinning variant of the class...
research
06/13/2020

Balanced Allocation on Dynamic Hypergraphs

The balls-into-bins model randomly allocates n sequential balls into n b...
research
01/18/2019

Derandomized Load Balancing using Random Walks on Expander Graphs

In a computing center with a huge amount of machines, when a job arrives...
research
05/13/2022

Balanced Allocations: The Heavily Loaded Case with Deletions

In the 2-choice allocation problem, m balls are placed into n bins, and ...

Please sign up or login with your details

Forgot password? Click here to reset