Sciweavers

Share
ANOR
2002

Simple Product-Form Bounds for Queueing Networks with Finite Clusters

10 years 4 months ago
Simple Product-Form Bounds for Queueing Networks with Finite Clusters
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.
Nico M. van Dijk, Erik van der Sluis
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2002
Where ANOR
Authors Nico M. van Dijk, Erik van der Sluis
Comments (0)
books