Author： van Dijk N.M. van der Sluis E.
Publisher： Springer Publishing Company
ISSN： 0254-5330
Source： Annals of Operations Research, Vol.113, Iss.1-4, 2002-07, pp. : 175-195
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Queueing networks are studied with finite capacities for clusters of stations, rather than for individual stations. First, an instructive tandem cluster example is studied to show that a product-form modification method for networks with finite stations</i> can be extended to networks with finite clusters</i>. Next, general results are established by which finite clusters can be regarded as finite aggregate stations. By these results product-form modifications for finite stations can be extended to product-form modifications for finite clusters by just considering a network at cluster level. This may lead to simple performance bounds. A number of illustrative examples with numerical support are provided.
Related content
Access to resources
Recommend
MVA for product-form cyclic queueing networks with blocking
Annals of Operations Research, Vol. 79, Iss. 1, 1998-01 ,pp. :
Bounds and error bounds for queueing networks
Annals of Operations Research, Vol. 79, Iss. 1, 1998-01 ,pp. :
New Product Theorems for Queueing Networks
By Tsitsiashvili G. Osipova M.
Problems of Information Transmission, Vol. 41, Iss. 2, 2005-04 ,pp. :