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

[1]  Simonetta Balsamo,et al.  Aggregation and Disaggregation in Queueing Networks: The Principle of Product-Form Synthesis , 1983, Computer Performance and Reliability.

[2]  Masakiyo Miyazawa,et al.  Comparison of two approximations for the loss probability in finite-buffer queues , 1993 .

[3]  Jan van der Wal,et al.  Simple bounds and monotonicity results for finite multi-server exponential tandem queues , 1989, Queueing Syst. Theory Appl..

[4]  Demetres D. Kouvatsos,et al.  Queueing networks with blocking , 2003, Perform. Evaluation.

[5]  R. Srikant,et al.  Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints , 1998, Queueing Syst. Theory Appl..

[6]  Winfried K. Grassmann,et al.  The Product form Tool for Queueing Networks , 2000 .

[7]  Peter G. Taylor,et al.  Strong Stochastic Bounds for the Stationary Distribution of a Class of Multicomponent Performability Models , 1998, Oper. Res..

[8]  Nico M. van Dijk,et al.  Simple Bounds for Queueing Systems with Breakdowns , 1988, Perform. Evaluation.

[9]  R. Boucherie,et al.  A generalization of Norton's theorem , 1991 .

[10]  Nico M. van Dijk,et al.  Bounds and error bounds for queueing networks , 1998, Ann. Oper. Res..

[11]  Harry G. Perros.  Queueing networks with blocking , 1994 .

[12]  Richard J. Boucherie,et al.  A generalization of Norton's theorem for queueing networks , 1993, Queueing Syst. Theory Appl..

[13]  Tayfur Altiok,et al.  Aggregate Modelling of Tandem Queues with Blocking , 1987, Computer Performance and Reliability.

[14]  Nico M. van Dijk.  A formal proof for the insensitivity of simple bounds for finite multi-server non-exponential tandem queues based on monotonicity results , 1987 .

[15]  N. M. van Dijk,et al.  A Note on Bounds and Error Bounds for nonexponential Batch Arrival Systems. , 1996 .

[16]  Simonetta Balsamo,et al.  Bounded Aggregation in Markovian Networks , 1987, Computer Performance and Reliability.

[17]  Simonetta Balsamo,et al.  Bound Performance Models of Heterogeneous Parallel Processing Systems , 1998, IEEE Trans. Parallel Distributed Syst..

[18]  Richard J. Boucherie,et al.  Norton's Equivalent for Queueing Networks Comprised of Quasireversible Components Linked by State-Dependent Routing , 1998, Perform. Evaluation.

[19]  Maria Simonetta Balsamo.  Approximate Analysis of Queueing Networks with Blocking , 1998 .