arXiv (Cornell University) · 2015 · 15 citations · 16 references
BusinessComputer ScienceComputer SystemsComputer NetworksQueuing TheoryStochastic ProcessesLoad BalancingQueueing AnalysisQueueing NetworksQueueing ProcessesQueueing SystemsQueueing TheoryLarge-scale Queueing NetworksMean Field AnalysisMean-field ApproximationMean-field DynamicsMean-field ModelsMean-field TheoryPoisson ArrivalsQueues
We introduce a general framework for the mean-field analysis of large-scale load-balancing networks with general service distributions. Specifically, we consider a parallel server network that consists of N queues and operates under the $SQ(d)$ load balancing policy, wherein jobs have independent and identical service requirements and each incoming job is routed on arrival to the shortest of $d$ queues that are sampled uniformly at random from $N$ queues. We introduce a novel state representation and, for a large class of arrival processes, including renewal and time-inhomogeneous Poisson arrivals, and mild assumptions on the service distribution, show that the mean-field limit, as $N \rightarrow \infty$, of the state can be characterized as the unique solution of a sequence of coupled partial integro-differential equations, which we refer to as the hydrodynamic PDE. We use a numerical scheme to solve the PDE to obtain approximations to the dynamics of large networks and demonstrate the efficacy of these approximations using Monte Carlo simulations. We also illustrate how the PDE can be used to gain insight into network performance.
16
Statistical Analysis of a Telephone Call Center
Lawrence Brown, Noah Gans, Avishai Mandelbaum et al. · Journal of the American Statistical Association · 2005 · 834 citations
Yossi Azar, Andrei Broder, Anna R. Karlin et al. · SIAM Journal on Computing · 1999 · 754 citations