Load balancing via random local search in closed and open systems
From MaRDI portal
Publication:383274
DOI10.1007/s11134-012-9315-9zbMath1275.60077arXiv1002.4314OpenAlexW2077117009MaRDI QIDQ383274
Sarah Lilienthal, Florian Simatos, Alexandre Proutiere, D. Manjunath, Ayalvadi J. Ganesh
Publication date: 25 November 2013
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.4314
Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (5)
Endogenous queue number determination in \(G/m/s\) systems ⋮ Computing absorbing times via fluid approximations ⋮ The Supermarket Game ⋮ The hydrodynamic limit of a randomized load balancing network ⋮ Two-choice regulation in heterogeneous closed networks
Cites Work
- Unnamed Item
- Unnamed Item
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- A particle system in interaction with a rapidly varying environment: mean field limits and applications
- Spatial homogenization in a stochastic network with mobility
- Task assignment with unknown duration
- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks
- Stability of Load Balancing Algorithms in Dynamic Adversarial Systems
- Convergence time to Nash equilibrium in load balancing
- Distributed selfish load balancing
- The Natural Work-Stealing Algorithm is Stable
- Chaoticity on path space for a queueing network with selection of the shortest queue among several
- Algorithmic Game Theory
- Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
This page was built for publication: Load balancing via random local search in closed and open systems
