Please use this identifier to cite or link to this item:
|Title:||Stability of multi-class queueing networks with infinite virtual queues||Authors:||Guo, Y.
Infinite virtual queues
Multi-class queueing networks
|Issue Date:||Mar-2014||Citation:||Guo, Y., Lefeber, E., Nazarathy, Y., Weiss, G., Zhang, H. (2014-03). Stability of multi-class queueing networks with infinite virtual queues. Queueing Systems 76 (3) : 309-342. ScholarBank@NUS Repository. https://doi.org/10.1007/s11134-013-9362-x||Abstract:||We generalize the standard multi-class queueing network model by allowing both standard queues and infinite virtual queues which have an infinite supply of work. We pose the general problem of finding policies which allow some of the nodes of the network to work with full utilization, and yet keep all the standard queues in the system stable. Toward this end we show that re-entrant lines, systems of two re-entrant lines through two service stations, and rings of service stations can be stabilized with priority policies under certain parameter restrictions. The analysis throughout the paper depends on model and policy and illustrates the difficulty in solving the general problem. © 2013 Springer Science+Business Media New York.||Source Title:||Queueing Systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/115944||ISSN:||02570130||DOI:||10.1007/s11134-013-9362-x|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 15, 2019
WEB OF SCIENCETM
checked on Apr 9, 2019
checked on May 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.