Transient M/M/1 queue variance computation using generalized Q functions

A generalized Q function representation for the transient M/M/1 queue variance is developed. The expression is highly accurate and computationally efficient, and an upper bound on the error is easily calculated. For a Q function relative error of 2*10-/sup 12/ using Parl's method, the relative...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 1988-06, Vol.36 (6), p.756-758
Main Authors: Cantrell, P.E., Beall, G.R.
Format: Article
Language:English
Subjects:
Applied sciences
Differential quadrature phase shift keying
Digital communication
Error probability
Exact sciences and technology
Fading
Nearest neighbor searches
Phase shift keying
Quadrature phase shift keying
Queueing analysis
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Transient analysis
Upper bound
Valuation and optimization of characteristics. Simulation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A generalized Q function representation for the transient M/M/1 queue variance is developed. The expression is highly accurate and computationally efficient, and an upper bound on the error is easily calculated. For a Q function relative error of 2*10-/sup 12/ using Parl's method, the relative error of the variance is generally less than 10/sup -9/. Average execution time is of the order of 70 ms per point on a VAX 11/750, but faster execution times can be obtained by using larger Q function relative errors.< >
ISSN:0090-6778
1558-0857
DOI:10.1109/26.2798