An investigation of phase-distribution moment-matching algorithms for use in queueing models

DOI10.1007/BF02412246zbMath0733.60106OpenAlexW2088259383MaRDI QIDQ809485

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/bf02412246

zbMATH Keywords

error boundsapproximationsmoment matchingphase distributionsqueueing approximations

Mathematics Subject Classification ID

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

Related Items

An \(M/PH/k\) retrial queue with finite number of sources, Time-dependent queueing network approximations as simulation external control variates, SET-VALUED PERFORMANCE APPROXIMATIONS FOR THE QUEUE GIVEN PARTIAL INFORMATION, The generalized two-sided power distribution, Tchebycheff Systems for Probabilistic Analysis, Value of capacity pooling in supply chains with heterogeneous customers, Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues, A Laplace transform method for order statistics from nonidentical random variables and its application in phase-type distribution, Worst-case large-deviation asymptotics with application to queueing and information theory, BAYESIAN ESTIMATION OF RUIN PROBABILITIES WITH A HETEROGENEOUS AND HEAVY‐TAILED INSURANCE CLAIM‐SIZE DISTRIBUTION, Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems, Simulating Coxian phase-type distributions for patient survival, Higher order approximations for the single server queue with splitting, merging and feedback, Higher order approximations for tandem queueing networks, A graphical investigation of error bounds for moment-based queueing approximations

Cites Work

• A graphical investigation of error bounds for moment-based queueing approximations
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Matching moments to phase distributions: density function shapes
• On Approximations for Queues, I: Extremal Distributions
• On Approximations for Queues, III: Mixtures of Exponential Distributions
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• Approximate Analysis of Central Server Models
• Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
• Matching moments to phase distributions: Mixtures of erlang distributions of common order