Asymptotic expansions for waiting time probabilities in an M/G/1 queue with long-tailed service time
Queueing Systems: Theory and Applications
The Fourier-series method for inverting transforms of probability distributions
Queueing Systems: Theory and Applications - Numerical computations in queues
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
The M/G/1 queue with heavy-tailed service time distribution
IEEE Journal on Selected Areas in Communications
Sojourn time asymptotics in the M/G/1 processor sharing queue
Queueing Systems: Theory and Applications
An overview of Brownian and non-Brownian FCLTs for the single-server queue
Queueing Systems: Theory and Applications
ACM SIGMETRICS Performance Evaluation Review - Special issue on the 31st international symposium on computer performance, modeling, measurements and evaluation (IFIPWG 7.3 Performance 2013)
Hi-index | 0.00 |
O.J. Boxma and J.W. Cohen recently obtained an explicit expression for the M/G/1 steady-state waiting-time distribution for a class of service-time distributions with power tails. We extend their explicit representation from a one-parameter family of service-time distributions to a two-parameter family. The complementary cumulative distribution function (ccdf's) of the service times all have the asymptotic form F^c(t)~@at^-^3^/^2 as t-~, so that the associated waiting-time ccdf's have asymptotic form W^c(t)~@bt^-^1^/^2 as t-~. Thus the second moment of the service time and the mean of the waiting time are infinite. Our result here also extends our own earlier explicit expression for the M/G/1 steady-state waiting-time distribution when the service-time distribution is an exponential mixture of inverse Gaussian distributions (EMIG). The EMIG distributions form a two-parameter family with ccdf having the asymptotic form F^c(t)~@at^-^3^/^2e^-^@h^t as t-~. We now show that a variant of our previous argument applies when the service-time ccdf is an undamped EMIG, i.e., with ccdf G^c(t)=e^@h^tF^c(t) for F^c(t) above, which has the power tail G^c(t)~@at^-^3^/^2 as t-~. The Boxma-Cohen long-tail service-time distribution is a special case of an undamped EMIG.