The Fourier-series method for inverting transforms of probability distributions
Queueing Systems: Theory and Applications - Numerical computations in queues
Solving probability transform functional equations for numerical inversion
Operations Research Letters
Numerical inversion of probability generating functions
Operations Research Letters
Priority queueing systems: from probability generating functions to tail probabilities
Queueing Systems: Theory and Applications
Using singularity analysis to approximate transient characteristics in queueing systems
Probability in the Engineering and Informational Sciences
Hi-index | 0.00 |
Many quantities of interest in queueing theory can be determined in the form of transforms. Methods for numerically inverting those transforms are well developed. However, some transforms such as that of the busy period distribution can only be characterized implicitly via functional equations. Algorithms for inversion require the evaluation of transforms at many complex arguments. Although this is possible it may be computationally quite involved. In this paper, we show that the original contour integral with the implicitly determined transform as part of the integrand can be replaced by alternative contour integrals with only known transforms as part of the integrand via simple substitutions. The alternative contour integrals can be evaluated by the same techniques as the original ones.