Simple Product-Form Bounds for Queueing Networks with Finite Clusters

Nico van Dijk and Erik van der Sluis

Annals of Operations Research, 2002, vol. 113, issue 1, 175-195

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. Copyright Kluwer Academic Publishers 2002

Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1020922315539 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:113:y:2002:i:1:p:175-195:10.1023/a:1020922315539

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1020922315539

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().