Access the full text.
Sign up today, get DeepDyve free for 14 days.
S.N. Ethier, T.G. Kurtz (1986)
Markov Processes: Characterization and Convergence
I. Kurkova (2001)
A Load-Balanced Network with Two ServersQueueing Systems, 37
F. Karpelevich, E. Pechersky, Y. Suhov (1996)
Dobrushin's approach to queueing network theoryJournal of Applied Mathematics and Stochastic Analysis, 9
N. Lawrie, D. Stoyan, D. Daley (1984)
Comparison Methods for Queues and Other Stochastic ModelsJournal of the Operational Research Society, 35
G. Fayolle, R. Iasnogorodski, V. Malyshev (1999)
Random Walks in the Quarter-Plane
M. Mitzenmacher (2001)
The Power of Two Choices in Randomized Load BalancingIEEE Trans. Parallel Distributed Syst., 12
N. Vvedenskaya, R. Dobrushin, F. Karpelevich (1996)
Queueing system with selection of the shortest of two queues: an assymptotic approach
R.L. Dobrushin (1987)
Proc. 1st World Congress of the Bernoulli Society, Tashkent, 1986
N. Vvedenskaya, Y. Suhov (2004)
Differential Equations Arising in Queuing TheoryFunctional differential equations, 8
Ijbf Adan, J. Wessels, W. Zijm (1990)
Analysis of the symmetric shortest queue problem, 6
F.P. Kelly (1991)
Loss NetworksAnn. Appl. Probab., 1
S. Foss, N. Chernova (1998)
On the stability of a partially accessible multi‐station queue with state‐dependent routingQueueing Systems, 29
R. Foley, D. McDonald (2001)
Join the shortest queue: stability and exact asymptoticsAnnals of Applied Probability, 11
G. Fayolle, V. Malyshev, M. Menshikov (1995)
Topics in the Constructive Theory of Countable Markov Chains
W. Whitt, D. Stoyan, D. Daley (1986)
Comparison methods for queues and other stochastic modelsJournal of the American Statistical Association, 81
G. Fayolle, V. Malyshev, M. Menshikov (1995)
Topics in the Constructive Theory of Countable Markov Chains: Ideology of induced chains
James Martin, Y. Suhov (1999)
Fast Jackson networksAnnals of Applied Probability, 9
O. Boxma (2000)
Book review: Random walks in the quarter-plane
S. Turner (1998)
The Effect of Increasing Routing Choice on Resource PoolingProbability in the Engineering and Informational Sciences, 12
(1986)
Switching Networks, Gibbsian Fields—Interconnections
N. Vvedenskaya, Y. Suhov (1997)
Dobrushin's Mean-Field Approximation for a Queue With Dynamic Routing
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.
Problems of Information Transmission – Springer Journals
Published: Oct 13, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.