A graphical investigation of error bounds for moment-based queueing approximations

DOI10.1007/BF02412257zbMath0733.60107OpenAlexW1995332859MaRDI QIDQ809486

Michael R. Taaffe, Mary A. Johnson

Publication date: 1991

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02412257

zbMATH Keywords

error boundsmoment matchingqueueing approximations

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (6)

Tchebycheff Systems for Probabilistic Analysis ⋮ Phase-type distributions and representations: Some results and open problems for system theory ⋮ Analyzing service blueprints using phase distributions ⋮ Higher order approximations for the single server queue with splitting, merging and feedback ⋮ Higher order approximations for tandem queueing networks ⋮ An investigation of phase-distribution moment-matching algorithms for use in queueing models

Cites Work

• An investigation of phase-distribution moment-matching algorithms for use in queueing models
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Matching moments to phase distributions: nonlinear programming approaches
• Matching moments to phase distributions: density function shapes
• On Approximations for Queues, I: Extremal Distributions
• On Approximations for Queues, II: Shape Constraints
• On Approximations for Queues, III: Mixtures of Exponential Distributions
• Moment Inequalities For A Class Of Single Server Queues
• Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
• Matching moments to phase distributions: Mixtures of erlang distributions of common order

This page was built for publication: A graphical investigation of error bounds for moment-based queueing approximations