Bounds and error bounds for queueing networks
Nico van Dijk
Annals of Operations Research, 1998, vol. 79, issue 0, 295-319
Abstract:
Queueing networks are an important means to model and evaluate a variety of practical systems. Unfortunately, analytic results are often not available. Numerical computation may then have to be employed. Or, system modifications might be suggested to obtain simple bounds or computationally easy approximations. Formal analytic support for the accuaracy or nature of such modifications or approximations then becomes of interest. To this end, the Markov reward approach is surveyed and illustrated as a technique to conclude a priori error bounds as well as to formally prove bounds when comparing two related systems. More precisely, the technique can be applied to: perturbations, finite truncations, infinite approximations, system modifications, or system simplifications (bounds). A general comparison and error bound theorem are provided. The conditions and technical steps are illustrated in detail for a non-product form queueing network subject to breakdowns. This illustration highlights the technical difference with and extension of the stochastic comparison approach. In addition, some practical applications are given which illustrate the various types of applications. Copyright Kluwer Academic Publishers 1998
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (5)
Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018978823209 (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:79:y:1998:i:0:p:295-319:10.1023/a:1018978823209
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1023/A:1018978823209
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 ().