Simple Product-Form Bounds for Queueing Networks with Finite Clusters

Nico M. van Dijk () and Erik van der Sluis
Additional contact information
Nico M. van Dijk: University of Amsterdam
Erik van der Sluis: University of Amsterdam

No 01-107/4, Tinbergen Institute Discussion Papers from Tinbergen Institute

Abstract: This discussion paper resulted in a publication in 'Annals of Operations Research' .

Queueing networks are studied with finite capacity constraints forclusters of stations. First, by an instructive tandemcluster example it is shown how a product-form modification methodfor networks with finite stations can be extended tonetworks with finite clusters. Next, a general result is establishedby which networks with finite clusters can be studied atcluster level by merely keeping track of the total number of jobs atthese clusters, that is, by regarding these clusters asaggregate stations. This result is of practical interest to concludesimple performance bounds at global network level. Anumber of illustrative examples with numerical support are provided.

Date: 2001-11-20
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://papers.tinbergen.nl/01107.pdf (application/pdf)

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:tin:wpaper:20010107

Access Statistics for this paper

More papers in Tinbergen Institute Discussion Papers from Tinbergen Institute Contact information at EDIRC.
Bibliographic data for series maintained by Tinbergen Office +31 (0)10-4088900 ().