Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence
Open Access
- 1 August 2013
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 38 (3) , 469-491
Abstract
We analyze the behavior of closed multiclass product-form queueing networks when the number of customers grows to infinity and remains proportionate on each route (or class). First, we focus on the stationary behavior and prove the conjecture that the stationary distribution at nonbottleneck queues converges weakly to the stationary distribution of an ergodic, open product-form queueing network, which is geometric. This open network is obtained by replacing bottleneck queues with per-route Poissonian sources whose rates are uniquely determined by the solution of a strictly concave optimization problem. We strengthen such results by also proving convergence of the first moment of the queue lengths of nonbottleneck stations. Then we focus on the transient behavior of the network and use fluid limits to prove that the amount of fluid, or customers, on each route eventually concentrates on the bottleneck queues only and that the long-term proportions of fluid in each route and in each queue solve the dual of the concave optimization problem that determines the throughputs of the previous open network.Keywords
All Related Versions
This publication has 39 references indexed in Scilit:
- A survey of bottleneck analysis in closed networks of queues2005
- Charging and rate control for elastic trafficEuropean Transactions on Telecommunications, 1997
- Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networksQueueing Systems, 1996
- Asymptotic expansions for large closed queueing networks with multiple job classesIEEE Transactions on Computers, 1992
- Approximate mean value analysis algorithms for queuing networksJournal of the ACM, 1990
- Asymptotic expansion for large closed queuing networksJournal of the ACM, 1990
- Asymptotic expansions for closed Markovian networks with state-dependent service ratesJournal of the ACM, 1986
- On the asymptotic behavior of time-sharing systemsCommunications of the ACM, 1982
- Some distributional approximations in Markovian queueing networksAdvances in Applied Probability, 1982
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975