Simple Product-Form Bounds for Queueing Networks with Finite Clusters

Authors: van Dijk N.M.; van der Sluis E.

Source: Annals of Operations Research, Volume 113, Numbers 1-4, July 2002 , pp. 175-195(21)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

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 can be extended to networks with finite clusters. 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.

Language: English

Document Type: Research article

Affiliations: 1: Faculty of Economics and Econometrics, University of Amsterdam, The Netherlands

Publication date: 2002-07-01