Simple product-form bounds for queueing networks with finite clusters

Simple product-form bounds for queueing networks with finite clusters

0.00 Avg rating0 Votes
Article ID: iaor20032095
Country: Netherlands
Volume: 113
Issue: 1
Start Page Number: 175
End Page Number: 195
Publication Date: Jul 2002
Journal: Annals of Operations Research
Authors: ,
Keywords: queueing networks
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.

Reviews

Required fields are marked *. Your email address will not be published.