Mean-field analysis for load balancing on spatial graphs

DOI10.1214/24-AAP2090MaRDI QIDQ7034159zbMATH OpenFDO

Authors Debankur Mukherjee

Publication date 31 January 2025

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/24-AAP2090

zbMATH Keywords

data localityload balancingmany-server asymptoticsmean-field approximationqueueing theoryspatial graphsstochastic coupling

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Continuous-time Markov processes on discrete state spaces (60J27) Applications of continuous-time Markov processes on discrete state spaces (60J28) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Cites work

• A central limit theorem for Markov processes that move by small steps
• Asymptotic independence of queues under randomized load balancing
• Comparing load balancing algorithms for distributed queueing networks
• Decay of tails at equilibrium for FIFO join the shortest queue networks
• Exponential and uniform ergodicity of Markov processes
• Flexible queueing architectures
• Generalized Max-Weight Policies in Stochastic Matching
• scientific article; zbMATH DE number 3725427 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3238721 (Why is no real title available?)
• Job assignment in large-scale service systems with affinity relations
• Limit theorems for sequences of jump Markov processes approximating ordinary differential processes
• Load Balancing Under Strict Compatibility Constraints
• Markov processes and learning models
• On the maximum queue length in the supermarket model
• On the Stability of Redundancy Models
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Random Geometric Graphs
• Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
• Solutions of ordinary differential equations as limits of pure jump markov processes
• Stability of join the shortest queue networks
• Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes
• Strong approximation theorems for density dependent Markov chains
• Supermarket model on graphs
• The hydrodynamic limit of a randomized load balancing network

Cited in

(3)

• Fluid limits for interacting queues in sparse dynamic graphs
• Geometric lower bounds for the steady-state occupancy of processing networks with limited connectivity
• Mean-field analysis of large-scale bipartite queueing models for threshold-based and stochastic offloading multi-access edge computing

This page was built for publication: Mean-field analysis for load balancing on spatial graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034159)