A graphical investigation of error bounds for moment-based queueing approximations
From MaRDI portal
Publication:809486
DOI10.1007/BF02412257zbMATH Open0733.60107OpenAlexW1995332859MaRDI QIDQ809486FDOQ809486
Authors: Mary A. Johnson, Michael R. Taaffe 
Publication date: 1991
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02412257
Recommendations
- Bounds and error bounds for queueing networks
- Error bounds on a practical approximation for finite tandem queues
- An error bound for a continuous time approximation of a time-sharing queue
- Error Bounds for Perturbing Nonexponential Queues
- Behaviour of queueing approximations based on sample moments
- Analytic error bounds for approximations of queueing networks with an application to alternate routing
- Error bounds and comparison results: the Markov reward approach for queueing networks
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- On Approximations for Queues, I: Extremal Distributions
- On Approximations for Queues, III: Mixtures of Exponential Distributions
- Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
- Matching moments to phase distributions: Mixtures of erlang distributions of common order
- Matching moments to phase distributions: nonlinear programming approaches
- Matching moments to phase distributions: density function shapes
- An investigation of phase-distribution moment-matching algorithms for use in queueing models
- On Approximations for Queues, II: Shape Constraints
- Moment Inequalities For A Class Of Single Server Queues
Cited In (8)
- Tchebycheff Systems for Probabilistic Analysis
- Higher order approximations for tandem queueing networks
- Analyzing service blueprints using phase distributions
- An investigation of phase-distribution moment-matching algorithms for use in queueing models
- An error bound for a continuous time approximation of a time-sharing queue
- Behaviour of queueing approximations based on sample moments
- Phase-type distributions and representations: Some results and open problems for system theory
- Higher order approximations for the single server queue with splitting, merging and feedback
This page was built for publication: A graphical investigation of error bounds for moment-based queueing approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809486)
