Skip to main content
SpringerLink
Log in

Balancing Queues by Mean Field Interaction

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Consider a queueing network with N nodes in which queue lengths are balanced through mean-field interaction. When N is large, we study the performance of such a network in terms of limiting results as N goes to infinity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Adjih, P. Jacquet and N. Vvedenskaya, Performance evalution of a single queue under multi-user TCP/IP connection, INRIA Research report, #4141 (2001).

  2. G.L. Arsenišvili, Single-channel queuing systems with varying intensities, Trudy Tbiliss. Univ. 189, (1977) 65–79.

    Google Scholar 

  3. F. Baccelli, R.D. McDonald, and J. Reynier, A mean field model for multiple TCP connections through a buffer implementing RED. INRIA Research report #4449 (2002).

  4. M.F. Chen, Existence theorems for interacting particle systems with non-compact state space. Sci Sinica. A 30 (1987) 148–156.

    Google Scholar 

  5. D.A. Dawson, Critical dynamics and fluctuations for a mean-field model of cooperative behavior. Journal of Statistical Physics, 31(1) (1983) 29–85.

    Article  Google Scholar 

  6. D.A. Dawson and J. Gärtner, Long-time behavior of interaction diffusions. Stochastic calculus in application, in Proceedings of the Cambridge Symposium, eds. J.R. Norris, Pitman Research Notes in Mathematics Series 197, (John Wiley & Sons, New York 1988).

  7. D.A. Dawson and X. Zheng, Law of large numbers and a central limit theorem for unbounded jump mean field models, Adv. Appl. Math. 12(3) (1991) 293–326.

    Article  Google Scholar 

  8. N. Duffield, Local mean-field Markov processes: An application to message-switching networks. Probab. Theory Related Fields 93(4) (1992) 485–505.

    Article  Google Scholar 

  9. W. Feller, On the integro-differential equations of purely discontinuous Markoff processes, Trans. Amer. Math. Soc. 48 (1940) 488–515.

    Google Scholar 

  10. S. Feng and X. Zheng, Solutions of a class of nonlinear master equations, Stochastic Processes and their Applications 43 (1992) 65–84.

    Article  Google Scholar 

  11. S. Feng, Large deviations for unbounded jump type Markov processes with mean field interaction, Technical Report Series of the Laboratory for Research in Statistics and Probability, Carleton University. No. 182, (1991).

  12. S. Feng, Nonlinear master equation of multitype particle systems, Stochastic Processes and their Applications 57 (1995) 247–271.

    Article  Google Scholar 

  13. R.D. Foley and D.R. McDonald, Join the shortest queue: Stability and exact asymptotics, Ann. Appl. Probab. 11(3) (2001) 569–607.

    Google Scholar 

  14. T. Fujisawa, On a queuing process with queue-length dependent service, Yokohama Math. J. 10 (1962) 53–72.

    Google Scholar 

  15. T. Funaki, A certain class of diffusion processes associated with nonlinear parabolic equations, Zeitschrift fur Wahr. 67 (1984) 331–348.

    Google Scholar 

  16. H.C. Gromoll, A.L. Puha and R.J. Williams. The fluid limit of a heavily loaded processor sharing queue. Preprint (2001).

  17. N. Hadidi, A queueing model with variable arrival rates, Period. Math. Hungar. 6 (1975) 39–47.

    Google Scholar 

  18. F.A. Haight, Two queues in parallel, Biometrika 45 (1958) 401–410.

    Google Scholar 

  19. K. Hepp and E.H. Lieb, On the superradiant phase transition for molecules in a quantized radiation field: The Dicke Maser model, Ann. Physics 76 (1973) 360–404.

    Article  CAS  Google Scholar 

  20. L.L. Hoffman, Characterizing linear birth and death processes, J. Amer. Statist. Assoc. 87 (420) (1992) 1183–1187.

    Google Scholar 

  21. C. Knessl, B.J. Matkowsky, Z. Schuss and C. Tier, Distribution of the maximum buffer content during a busy period for state-dependent M/G/l queues, Comm. Statist. Stochastic Models 3(2) (1987) 191–226.

    Google Scholar 

  22. A. Mandelbaum and G. Pats, State-dependent queues: Approximations and applications. Stochastic Networks, IMA Vol. Math. Appl. 71, 239–282, (Springer, New York) (1995).

    Google Scholar 

  23. J.B. Martin and Y.M. Suhov, Fast Jackson networks, Annals of Applied Probability 9(3) (1999) 854–870.

    Article  Google Scholar 

  24. S.P. Meyn, Sequencing and routing in multiclass queueing networks, I. Feedback regulation, SIAM J. Control Optim. 40(3) (2001) 741–776 (electronic).

    Article  Google Scholar 

  25. M. Mitzenmather, The power of two choices in randomized load balancing. Ph.D. thesis, University of Carlifornia, Berkeley (1996).

  26. M. Mitzenmacher and B. Voecking, Selecting the shortest of two, improved. Analytic Methods in applied probability, Amer. Math. Soc. Transl. Ser. 2 207, (2002). 165–176, (Amer. Math. Soc., Providence, R1).

  27. J.A. Morrison, Diffusion approximation for head-of-the-line processor sharing for two parallel queues. SIAM J. Appl. Math. 53(2) (1993) 471–490.

    Article  Google Scholar 

  28. B. Natvig, On a queuing model where potential customers are discouraged by queue length, Scand. J. Statist. 2(1) (1975) 34–42.

    Google Scholar 

  29. G. Nicolis and I. Prigogine, Self-Organization in Nonequilibrium System (John Wiley & Sons, New York, 1977).

    Google Scholar 

  30. V.I. Oseledets and D.V. Khmelev, Global stability of infinite systems of nonlinear differential equations, and nonhomogeneous countable Markov chains, Problemy Peredachi Informatsii 36(1) (2000) 60–76; translation in Probl. Inf. Transm. 36(1) 54–70.

  31. V.I. Oseledets and D.V. Khmelev, Stochastic Transportation Networks and Stability of Dynamical Systems, Theory of Probability and Its Applications 46(1) (2002) 154–161.

    Article  Google Scholar 

  32. P. Tinnakornsrisuphap and A. M. Makowski, TCP traffic modeling via limit theorems. Technical research Report, http://www.isr.umd.edu/TechReports/ISR/2002/TR_2002–23/TR_2002-23.phtml (2002).

  33. N.D. Vvedenskaya, R.L. Dobrushin and F.I. Karpelevich, Queueing system with selection of the shortest of two queues: An asymptotic approach, Problems of Information Transmission 32(1) (1996) 15–27.

    Google Scholar 

  34. N. D. Vvedenskaya and Yu. M. Suhov, Dobrushin’s mean-field approximation for a queue with dynamic routing. Markov Processes and Related Fields 3 (1997) 493–526.

    Google Scholar 

  35. N.D. Vvedenskaya and M.Y. Suhov, Fast Jackson networks with dynamic routing, Problems of Information Transmission 38(2) (2002) 136–153.

    Article  Google Scholar 

  36. W. Winston, Optimality of the shortest line discipline, J. Appl. Probability 14(1) (1977) 181–189.

    Google Scholar 

  37. S. Yan and Z. Li, The stochastic models for non-equilibrium system and formulation of master equations, Acta Phys. Sinica 29 (1980).

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Carleton University, Ottawa, Ontario, Canada, K1S 5B6

    Donald A. Dawson, Jiashan Tang & Yiqiang Q. Zhao

  2. Department of Applied Mathematics and Physics, Nanjing University of Posts and Telecommunications, Nanjing, Jiangsu, 210003, P. R. China

    Jiashan Tang

Authors
  1. Donald A. Dawson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiashan Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yiqiang Q. Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

AMS subject classification: 60K25, 60K35, 60J27, 60F05

This project is supported by the Natural Sciences and Engineering Research Council of Canada through research grants.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dawson, D.A., Tang, J. & Zhao, Y.Q. Balancing Queues by Mean Field Interaction. Queueing Syst 49, 335–361 (2005). https://doi.org/10.1007/s11134-005-6971-z

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-005-6971-z

Keywords

Search

Navigation