Closed queueing networks under congestion: non-bottleneck independence and bottleneck convergence
AbstractWe analyze the behavior of closed 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 non-bottleneck queues converges weakly to the stationary distribution of an ergodic, open product-form queueing network. This open network is obtained by replacing bottleneck queues with per-route Poissonian sources whose rates are determined by the solution of a strictly concave optimization problem. 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Universidad Carlos III, Departamento de Estadística y Econometría in its series Statistics and Econometrics Working Papers with number ws121711.
Date of creation: Jun 2012
Date of revision:
Contact details of provider:
Postal: C/ Madrid, 126 - 28903 GETAFE (MADRID)
Web page: http://www.uc3m.es/uc3m/dpto/DEE/departamento.html
More information through EDIRC
Closed queueing networks; Product-form; Asymptotic independence; Fluid limit; Large population;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2012-07-01 (All new papers)
- NEP-NET-2012-07-01 (Network Economics)
- NEP-TRE-2012-07-01 (Transport Economics)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
If references are entirely missing, you can add them using this form.