# Load balancing via random local search in closed and open systems

@article{Ganesh2010LoadBV, title={Load balancing via random local search in closed and open systems}, author={Ayalvadi J. Ganesh and Sarah Lilienthal and D. Manjunath and Alexandre Prouti{\`e}re and Florian Simatos}, journal={ArXiv}, year={2010}, volume={abs/1002.4314} }

In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may switch servers independently at random instants of time in an attempt to improve their service rate. This approach to load balancing contrasts with traditional approaches where clients make smart server selections upon arrival (e.g., Join-the-Shortest-Queue policy and variants thereof). Load resampling is particularly…

## 24 Citations

Distributed load balancing in heterogenous systems

- Computer Science2014 48th Annual Conference on Information Sciences and Systems (CISS)
- 2014

It is proved that when the user population grows large, pure NEs get closer to a Proportionally Fair (PF) allocation of users to servers, and the gap between equilibriums and this ideal allocation depending on user population is characterized.

Distributed Proportional Fair Load Balancing in Heterogenous Systems

- Computer ScienceSIGMETRICS
- 2015

In open systems, where users randomly enter the system and leave upon service completion, it is established that the RLS algorithm stabilizes the system whenever this it at all possible under centralized load balancing schemes, i.e., it is throughput-optimal.

FCD: Fast-concurrent-distributed load balancing under switching costs and imperfect observations

- Computer Science2013 Proceedings IEEE INFOCOM
- 2013

It is shown that the system reaches an c-Nash equilibrium in expected time O, which implies that the convergence rate is robust with large scale system(large user population), and is not affected by imperfect measurements of the server load.

Random Walk Based Sampling for Load Balancing in Multi-Server Systems

- Computer ScienceAbstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems
- 2019

This paper analyzes a variant of the power-of-d choices algorithm, where d servers are sampled through d independent non-backtracking random walks on a k-regular graph, and the stationary distribution of the system converges to the stationary solution of the ODE.

Derandomized Load Balancing using Random Walks on Expander Graphs

- Mathematics, Computer ScienceArXiv
- 2019

Under this scheme, the dynamics of the queuing system converges to the same deterministic ordinary differential equation (ODE) for the power-of-d choices scheme, and the stationary distribution of the system converging to the fixed point of the ODE.

Energy-aware capacity scaling in virtualized environments with performance guarantees

- Computer SciencePerform. Evaluation
- 2011

On the Asymptotic Insensitivity of the Supermarket Model in Processor Sharing Systems

- MathematicsProc. ACM Meas. Anal. Comput. Syst.
- 2021

This paper demonstrates that for this class of hyperexponential distributions of order 2 global attraction of the unique fixed point can still be established using monotonicity by picking a suitable state space and partial order and can be leveraged to prove asymptotic insensitivity within thisclass of distributions for other load balancing systems.

Randomized Work Stealing versus Sharing in Large-scale Systems with Non-exponential Job Sizes

- Computer ScienceIEEE/ACM Trans. Netw.
- 2019

The main insight is that work stealing benefits significantly from having more variable job sizes and work sharing may become inferior to work stealing for loads as small as $1/2 + \epsilon$ for any $\epssilon > 0$.

Heavy-Traffic Limits for a Many-Server Queueing Network with Switchover

- MathematicsAdvances in Applied Probability
- 2013

We study a multiclass Markovian queueing network with switchover across a set of many-server stations. New arrivals to each station follow a nonstationary Poisson process. Each job waiting in queue…

Tight Load Balancing Via Randomized Local Search

- Computer Science2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
- 2017

This analysis is based on the crucial observation that performing destructive moves (reversals of RLS moves) cannot decrease the balancing time, which allows us to simplify problem instances and to ignore “inconvenient moves” in the analysis.

## References

SHOWING 1-10 OF 27 REFERENCES

The Power of Two Choices in Randomized Load Balancing

- Computer ScienceIEEE Trans. Parallel Distributed Syst.
- 2001

This work uses a limiting, deterministic model representing the behavior as n/spl rarr//spl infin/ to approximate the behavior of finite systems and provides simulations that demonstrate that the method accurately predicts system behavior, even for relatively small systems.

Stability of load balancing algorithms in dynamic adversarial systems

- Computer ScienceSTOC '02
- 2002

The proof techniques are very different from the ones used by Muthukrishnan and Rajaraman, and yield a simpler proof and tighter bounds on the difference in loads, and apply to the problem of routing packets in adversarial systems.

Convergence time to Nash equilibrium in load balancing

- EconomicsTALG
- 2007

We study the number of steps required to reach a pure Nash equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will minimize its cost.…

Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game

- Computer Science, EconomicsPODC '04
- 2004

Randomized Local Search is shown to show that it can be realised by a simple distributed network of users that act selfishly, have no central control and only interact via the effect they have on the cost functions of resources.

Task assignment with unknown duration

- Computer Science, BusinessJACM
- 2002

It is found that under heavy-tailed workloads, TAGS can outperform all task assignment policies known to us by several orders of magnitude with respect to both mean response time and mean slowdown, provided the system load is not too high.

Distributed selfish load balancing

- Computer ScienceSODA '06
- 2006

A natural protocol for the agents is discussed which can be implemented in a strongly distributed setting, uses no central control, and has good convergence properties and a lower bound of Ω (max{log log m, n}) for the convergence time is given.

Path Selection and Multipath Congestion Control

- EconomicsIEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
- 2007

This paper investigates the potential benefits of coordinated congestion control for multipath data transfers, and shows that with RTT bias (as in TCP Reno), uncoordinated control can lead to inefficient equilibria, and introduces the notion of a Nash equilibrium.

Capacity of Wireless Data Networks with Intra- and Inter-Cell Mobility

- Computer ScienceProceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
- 2006

This paper analyzes networks with several interacting base stations, and specifically examines the capacity impact of intraand inter-cell mobility, showing that mobility tends to increase the capacity, not only in case of globally optimal scheduling, but also when each of the base stations operates according to a fair sharing policy.

The natural work-stealing algorithm is stable

- Computer ScienceProceedings 2001 IEEE International Conference on Cluster Computing
- 2001

It is shown that the system is stable for any constant generation rate /spl lambda/<1 and for a wide class of functions f, and a quantitative description of the functions f which lead to stable systems is given.

Nashification and the Coordination Ratio for a Selfish Routing Game

- Computer ScienceICALP
- 2003

The first result is an O(nm2) time algorithm for Nashification, which can be used in combination with any approximation algorithm for the routing problem to compute a Nash equilibrium of the same quality and yields a PTAS for the computation of a best Nash equilibrium.