Abstract
A new class of models of queueing networks with load-balanced dynamic routing is considered. We propose a sufficient condition for positive recurrence of the arising Markov process and a limiting mean-field approximation where the process becomes deterministic and is described by a system of nonlinear ordinary differential equations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Fayolle, G., Iasnogorodski, R., and Malyshev, V., Random Walks in the Quarter-Plane, Berlin: Springer, 1999.
Kelly, F.P., Loss Networks, Ann. Appl. Probab., 1991, vol. 1, no. 2, pp. 319–378.
Vvedenskaya, N.D., Dobrushin, R.L., and Karpelevich, F.I., Queueing System with Selection of the Shortest of Two Queues: An Asymptotic Approach, Probl. Peredachi Inf., 1996, vol. 32, no. 1, pp. 20–34 [Probl. Inf. Trans. (Engl. Transl.), 1996, vol. 32, no. 1, pp. 15-27].
Mitzenmacher, M., The Power of Two Choices in Randomized Load Balancing, PhD Thesis, Berkley: Univ. of California, 1996.
Vvedenskaya, N.D. and Suhov, Yu.M., Dobrushin's Mean-Field Approximation for a Queue with Dynamic Routing, Markov Proc. Rel. Fields, 1997, vol. 3, no. 4, pp. 493–526.
Turner, S.R.E., The Effect of Increasing Routing Choice on Resource Pooling, Probab. Eng. Inf. Sci., 1998, vol. 12, no. 1, pp. 109–124.
Adan, I.J.B.F., Wessels, J., and Zijm, W.H.M., Analysis of the Asymmetric Shortest Queue Problem, Queueing Syst., 1991, vol. 8, no. 1, pp. 1–58.
Mitzenmacher, M. and Voecking, B., The Asymptotics of Selecting the Shortest of Two Queues, Improved, Tech. Report of Harvard Univ., 1999.
Martin, J.B. and Suhov, Yu.M., Fast Jackson Networks, Ann. Appl. Probab., 1999, vol. 9, no. 3, pp. 854–870.
Karpelevich, F.I., Pechersky, E.A., and Suhov, Yu.M., Dobrushin's Approach to Queueing Network Theory, J. Appl. Math. Stoch. Analysis, 1996, vol. 9, pp. 373–398.
Foss, S. and Chernova, N., On the Stability of a Partially Accessible Multi-Station Queue with State-Dependent Routing, Queueing Syst., 1998, vol. 29, no. 1, pp. 55–73.
Foley, R. and McDonald, D., Join the Shortest Queue: Stability and Exact Asymptotics, Preprint of Georgia Inst. of Technology and Univ. of Ottawa, 1999.
Kurkova, I., A Load-Balanced Network with Two Servers, Tech. Report of University of Eindhoven, 1999, EURANDOM.
Fayolle, G., Malyshev, V.A., and Menshikov, M.V., Topics in the Constructive Theory of Countable Markov Chains, Cambridge: Cambridge Univ. Press, 1995.
Vvedenskaya, N.D. and Suhov, Yu.M., Differential Equations Arising in Queueing Theory, Func. Diff. Eqs., 2001, vol. 8, no. 3-4, pp. 447–457.
Stoyan, D., Comparison Methods for Queues and Other Stochastic Models, New York: Wiley, 1983.
Ethier, S.N. and Kurtz, T.G., Markov Processes: Characterization and Convergence, New York: Wiley, 1986.
Dobrushin, R.L., Switching Networks, Gibbsian Fields?Interconnections, in Proc. 1st World Congress of the Bernoulli Society, Tashkent, 1986, Utrecht: VN Sci. Press, 1987, pp. 377–393.
Rights and permissions
About this article
Cite this article
Suhov, Y.M., Vvedenskaya, N.D. Fast Jackson Networks with Dynamic Routing. Problems of Information Transmission 38, 136–153 (2002). https://doi.org/10.1023/A:1020010710507
Issue Date:
DOI: https://doi.org/10.1023/A:1020010710507