An investigation of phase-distribution moment-matching algorithms for use in queueing models
type: Item
instance of: scholarly article
title: An investigation of phase-distribution moment-matching algorithms for use in queueing models
zbMATH Open document ID: 0733.60106
DOI: 10.1007/BF02412246
author: Mary A. Johnson
author: Michael R. Taaffe
published in: Queueing Systems
publication date: 1991-01-01T00:00:00Z
review text: A GI/M/1 queue with general interarrival time distribution A is approximated by a corresponding queue where the interarrival time distribution is of phase type with matching moments up to the k-th order, \(k=2,3\). The approximation error for the steady state mean queue length is studied as a function of the excess variation and the coefficient of skewness of A and the traffic intensity. The authors describe circumstances where three-moment-approximations are superior to two- moment-approximations and those where the opposite case is true. Most conclusions are based on empirical evidence.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 4213182
zbMATH Keywords: approximations
zbMATH Keywords: moment matching
zbMATH Keywords: queueing approximations
zbMATH Keywords: error bounds
zbMATH Keywords: phase distributions
reviewed by: Helmut Wegmann
MaRDI profile type: Publication
cites work: Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
cites work: A graphical investigation of error bounds for moment-based queueing approximations
cites work: Matching moments to phase distributions: Mixtures of erlang distributions of common order
cites work: Matching moments to phase distributions: density function shapes
cites work: Approximate Analysis of Central Server Models
cites work: A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
cites work: Approximating a Point Process by a Renewal Process, I: Two Basic Methods
cites work: On Approximations for Queues, I: Extremal Distributions
cites work: On Approximations for Queues, III: Mixtures of Exponential Distributions
full work available at URL: https://doi.org/10.1007/bf02412246
OpenAlex ID: W2088259383
Recommended article: Methods of analysis and computation for queueing systems with phase distributions
Recommended article: An empirical study of queueing approximations based on phase-type distributions
Recommended article: Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1
Recommended article: Moment problems and their applications to the stability of queueing models
Recommended article: Phase-type approximations of service-time distributions in \(M/G/1\) queues
Recommended article: Behaviour of queueing approximations based on sample moments
description: scientific article; zbMATH DE number 4213182