DocumentCode
2926445
Title
The approximation of density functions for use in queueing theory
Author
Yang, Haiping ; Lipsky, Lester
Author_Institution
Connecticut Univ., Storrs, CT, USA
fYear
1989
fDate
14-17 Nov 1989
Firstpage
612
Abstract
A procedure is developed for testing the accuracy of approximations to probability density functions (PDF) in queueing theory. The approximation can be constructed from the derivatives and moments of a given PDF, if they exist. Four subjects are considered which can be used as criteria to judge the goodness of approximations over the entire range of values of the traffic intensity parameter, ρ. A detailed example is presented to discuss the effect which different derivatives/moments matching combinations have on the accuracy of the approximations. The exponential factor is used as an optimizing parameter
Keywords
probability; queueing theory; approximation; derivatives/moments matching; exponential factor; optimizing parameter; probability density functions; queueing theory; Application software; Computer applications; Computer science; Fault tolerance; Polynomials; Probability density function; Queueing analysis; Steady-state; Testing; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 1989. Conference Proceedings., IEEE International Conference on
Conference_Location
Cambridge, MA
Type
conf
DOI
10.1109/ICSMC.1989.71370
Filename
71370
Link To Document