A graphical investigation of error bounds for moment-based queueing approximations
type: Item
instance of: scholarly article
title: A graphical investigation of error bounds for moment-based queueing approximations
zbMATH Open document ID: 0733.60107
DOI: 10.1007/BF02412257
author: Mary A. Johnson
author: Michael R. Taaffe
published in: Queueing Systems
publication date: 1991-01-01T00:00:00Z
review text: The problems studied in this paper are basically the same as in the paper reviewed above. Here three performance measures are considered: the probability of delay of an arriving customer and the mean queue length in a G/M/1-queue in steady state, and finally for a GI/M/n/n loss system the probability that an arriving customer is blocked. As all three parameters depend monotonically on the Laplace transform of the interarrival time distribution, there are close connections in the behavior of moment-based approximations for them.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 4213183
zbMATH Keywords: error bounds
zbMATH Keywords: moment matching
zbMATH Keywords: queueing approximations
reviewed by: Helmut Wegmann
MaRDI profile type: Publication
cites work: Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
cites work: An investigation of phase-distribution moment-matching algorithms for use in queueing models
cites work: Matching moments to phase distributions: Mixtures of erlang distributions of common order
cites work: Matching moments to phase distributions: nonlinear programming approaches
cites work: Matching moments to phase distributions: density function shapes
cites work: On Approximations for Queues, II: Shape Constraints
cites work: Moment Inequalities For A Class Of Single Server Queues
cites work: A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
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/bf02412257
OpenAlex ID: W1995332859
Recommended article: Bounds and error bounds for queueing networks
Recommended article: Error bounds on a practical approximation for finite tandem queues
Recommended article: An error bound for a continuous time approximation of a time-sharing queue
Recommended article: Error Bounds for Perturbing Nonexponential Queues
Recommended article: Behaviour of queueing approximations based on sample moments
Recommended article: Analytic error bounds for approximations of queueing networks with an application to alternate routing
Recommended article: Error Bounds and Comparison Results: The Markov Reward Approach For Queueing Networks
description: scientific article; zbMATH DE number 4213183