The mean-field computation in a supermarket model with server multiple vacations

While vacation processes are considered to be ordinary behavior for servers, the study of queueing networks with server vacations is limited, interesting, and challenging. In this paper, we provide a unified and effective method of functional analysis for the study of a supermarket model with server multiple vacations. Firstly, we analyze a supermarket model of N identical servers with server multiple vacations, and set up an infinite-dimensional system of differential (or mean-field) equations, which is satisfied by the expected fraction vector, in terms of a technique of tailed equations. Secondly, as N→ ∞ we use the operator semigroup to provide a mean-field limit for the sequence of Markov processes, which asymptotically approaches a single trajectory identified by the unique and global solution to the infinite-dimensional system of limiting differential equations. Thirdly, we provide an effective algorithm for computing the fixed point of the infinite-dimensional system of limiting differential equations, and use the fixed point to give performance analysis of this supermarket model, including the mean of stationary queue length in any server and the expected sojourn time that any arriving customer spends in this system. Finally, we use some numerical examples to analyze how the performance measures depend on some crucial factors of this supermarket model. Note that the method of this paper will be useful and effective for performance analysis of complicated supermarket models with respect to resource management in practical areas such as computer networks, manufacturing systems and transportation networks.

[1]  Carl Graham,et al.  Kinetic Limits for Large Communication Networks , 2000 .

[2]  Quan-Lin Li.  Constructive Computation in Stochastic Models with Applications: The RG-Factorizations , 2010 .

[3]  John N. Tsitsiklis,et al.  On the Power of (Even a Little) Resource Pooling , 2012 .

[4]  Serguei Foss,et al.  On the stability of a partially accessible multi‐station queue with state‐dependent routing , 1998, Queueing Syst. Theory Appl..

[5]  N. Tian,et al.  Conditional Stochastic Decompositions in the M/M/c Queue with Server Vacations , 1999 .

[6]  Yi Lu,et al.  Randomized load balancing with general service time distributions , 2010, SIGMETRICS '10.

[7]  Alexandre Proutière,et al.  A particle system in interaction with a rapidly varying environment: Mean field limits and applications , 2010, Networks Heterog. Media.

[8]  M. Benaïm,et al.  A class of mean field interaction models for computer and communication systems , 2008, 2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops.

[9]  James B. Martin.  Point processes in fast Jackson networks , 2001 .

[10]  Yuri M. Suhov,et al.  Fast Jackson Networks with Dynamic Routing , 2002, Probl. Inf. Transm..

[11]  Quan-Lin Li,et al.  Super-Exponential Solution in Markovian Supermarket Models: Framework and Challenge , 2011, ArXiv.

[12]  Ramesh K. Sitaraman,et al.  The power of two random choices: a survey of tech-niques and results , 2001 .

[13]  Quan-Lin Li,et al.  Constructive Computation in Stochastic Models with Applications , 2010 .

[14]  Michael Mitzenmacher,et al.  On the Analysis of Randomized Load Balancing Schemes , 1997, SPAA '97.

[15]  D. Bharat.  Generalizations of the stochastic decomposition results for single server queues with vacations , 1990 .

[16]  T. Kurtz.  Approximation of Population Processes , 1987 .

[17]  Bruno Gaujal,et al.  A Mean Field Approach for Optimization in Particles Systems and Applications , 2009 .

[18]  Jewgeni H. Dshalalow,et al.  Frontiers in Queueing: Models and Applications in Science and Engineering , 1997 .

[19]  J. Dshalalow.  Advances in Queueing Theory, Methods, and Open Problems , 1995 .

[20]  Michael Taylor,et al.  Partial Differential Equations I: Basic Theory , 1996 .

[21]  Yi Lu,et al.  Asymptotic independence of queues under randomized load balancing , 2012, Queueing Syst. Theory Appl..

[22]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[23]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[24]  Yu. M. Suhov,et al.  Fast Jackson networks , 1999 .

[25]  Colin McDiarmid,et al.  Asymptotic distributions and chaos for the supermarket model , 2007, 0712.2091.

[26]  Jean-Yves Le Boudec,et al.  A Generic Mean Field Convergence Result for Systems of Interacting Objects , 2007, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007).

[27]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[28]  M. Bramson.  PR ] 8 O ct 2 01 0 Submitted to the Annals of Applied Probability STABILITY OF JOIN THE SHORTEST QUEUE NETWORKS By , 2010 .

[29]  David Frankel,et al.  brief review: Queueing Analysis: A Foundation of Performance Evaluation. Volume 1: Vacation and Priority Systems, Part 1 by H. Takagi (North-Holland, 1991) , 1991, PERV.

[30]  J. Hale,et al.  Ordinary Differential Equations , 2019, Fundamentals of Numerical Mathematics for Physicists and Engineers.

[31]  Bruno Gaujal,et al.  A mean field approach for optimization in particle systems and applications , 2009, VALUETOOLS.

[32]  N. Vvedenskaya,et al.  Dobrushin's Mean-Field Approximation for a Queue With Dynamic Routing , 1997 .

[33]  James Norris,et al.  Strong approximation for the supermarket model , 2004 .

[34]  Philippe Jacquet,et al.  ON/OFF Sources in an Interconnection Network: Performance Analysis when Packets are Routed to the Shortest Queue of two Randomly Selected Nodes , 1998 .

[35]  W. Fleming.  Functions of Several Variables , 1965 .

[36]  Bara Kim,et al.  Stability of join-the-shortest-queue networks , 2007, Queueing Syst. Theory Appl..

[37]  A. Sznitman.  Topics in propagation of chaos , 1991 .

[38]  Bruno Gaujal,et al.  Mean Field for Markov Decision Processes: From Discrete to Continuous Optimization , 2010, IEEE Transactions on Automatic Control.

[39]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[40]  Yutaka Takahashi,et al.  Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8 , 1993 .

[41]  S. Turner,et al.  The Effect of Increasing Routing Choice on Resource Pooling , 1998, Probability in the Engineering and Informational Sciences.

[42]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[43]  Yi Lu,et al.  Decay of Tails at Equilibrium for FIFO Join the Shortest Queue Networks , 2011, ArXiv.

[44]  Naishuo Tian,et al.  Vacation Queueing Models Theory and Applications , 2006 .

[45]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[46]  John C. S. Lui,et al.  A Matrix-Analytic Solution for Randomized Load Balancing Models with PH Service Times , 2010, PERFORM.

[47]  Philippe Jacquet,et al.  Dynamic Routing in the Mean-Field Approximation , 1999 .

[48]  C. Graham.  Chaoticity on path space for a queueing network with selection of the shortest queue among several , 2000, Journal of Applied Probability.

[49]  R. L. Dobrushin,et al.  Queueing system with selection of the shortest of two queues: an assymptotic approach , 1996 .

[50]  Quan-Lin Li,et al.  Doubly Exponential Solution for Randomized Load Balancing Models with Markovian Arrival Processes and PH Service Times , 2010, ArXiv.

[51]  D. Down,et al.  Stability of Queueing Networks , 1994 .

[52]  Naishuo Tian,et al.  Vacation Queueing Models: Theory and Applications (International Series in Operations Research & Management Science) , 2006 .

[53]  Colin McDiarmid,et al.  On the maximum queue length in the supermarket model , 2004 .

[54]  Attahiru Sule Alfa,et al.  Vacation models in discrete time , 2003, Queueing Syst. Theory Appl..

[55]  B. T. Doshi,et al.  Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..