An investigation of phase-distribution moment-matching algorithms for use in queueing models
From MaRDI portal
Publication:809485
DOI10.1007/BF02412246zbMATH Open0733.60106OpenAlexW2088259383MaRDI QIDQ809485FDOQ809485
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
Recommendations
- Methods of analysis and computation for queueing systems with phase distributions
- An empirical study of queueing approximations based on phase-type distributions
- Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1
- Moment problems and their applications to the stability of queueing models
- Phase-type approximations of service-time distributions in \(M/G/1\) queues
- Behaviour of queueing approximations based on sample moments
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
- Approximate Analysis of Central Server Models
- On Approximations for Queues, III: Mixtures of Exponential Distributions
- Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- Matching moments to phase distributions: Mixtures of erlang distributions of common order
- Matching moments to phase distributions: density function shapes
- A graphical investigation of error bounds for moment-based queueing approximations
Cited In (20)
- Tchebycheff Systems for Probabilistic Analysis
- Higher order approximations for tandem queueing networks
- A Laplace transform method for order statistics from nonidentical random variables and its application in phase-type distribution
- Value of capacity pooling in supply chains with heterogeneous customers
- On Approximations for Queues, II: Shape Constraints
- Using Discrete Distributions to Approximate General Service Time Distributions in Queueing Models
- An \(M/PH/k\) retrial queue with finite number of sources
- Worst-case large-deviation asymptotics with application to queueing and information theory
- On Approximations for Queues, III: Mixtures of Exponential Distributions
- Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
- An empirical study of queueing approximations based on phase-type distributions
- Time-dependent queueing network approximations as simulation external control variates
- Behaviour of queueing approximations based on sample moments
- SET-VALUED PERFORMANCE APPROXIMATIONS FOR THE QUEUE GIVEN PARTIAL INFORMATION
- The generalized two-sided power distribution
- BAYESIAN ESTIMATION OF RUIN PROBABILITIES WITH A HETEROGENEOUS AND HEAVY‐TAILED INSURANCE CLAIM‐SIZE DISTRIBUTION
- A graphical investigation of error bounds for moment-based queueing approximations
- Higher order approximations for the single server queue with splitting, merging and feedback
- Simulating Coxian phase-type distributions for patient survival
- Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues
This page was built for publication: An investigation of phase-distribution moment-matching algorithms for use in queueing models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809485)
