Symbolic Computation of Moments in Priority Queues

References

• Abate J., Choudhury G. L., Lucantoni D. M., Whitt W. Asymptotic analysis of tail probabilities based on the computation of moments. Annals of Applied Probability (1995) 5:983–1007Crossref, Google Scholar
• Abate J., Whitt W. Solving probability transform functional equations for numerical inversion. Operations Research Letters (1992) 12:275–281Crossref, Google Scholar
• Abate J., Whitt W. Asymptotics for M/G/1 low-priority waiting-time tail probabilities. Queueing Systems (1997) 25:173–233Crossref, Google Scholar
• Abramowitz M., Stegun I. A.Handbook of Mathematical Functions With Formulas, Graphs, and Mathematical Tables (1972) (National Bureau of Standards, Washington, D.C) Google Scholar
• Andrews D. F., Stafford J. E. Tools for the symbolic computation of asymptotic expansions. J. R. Statist. Soc. B (1993) 55:613–627Google Scholar
• Andrews D. F., Stafford J. E.Symbolic Computation for Statistical Inference (2000) (Oxford University Press, Oxford, U.K) Crossref, Google Scholar
• Cho Y. Z., Un C. K. Analysis of the M/G/1 queue under a combined preemptive/nonpreemptive priority discipline. IEEE Transactions on Communications (1993) 41:132–141Crossref, Google Scholar
• Choudhury G. L., Lucantoni D. M. Numerical computation of the moments of a probability distribution from its transform. Operations Research (1996) 44:368–381Link, Google Scholar
• Choudhury G. L., Whitt W. Computing distributions and moments in polling models by numerical transform inversion. Performance Evaluation (1996) 25:267–292Crossref, Google Scholar
• Conway R. W., Maxwell W., Miller L.Theory of Scheduling (1967) (Addison-Wesley, Reading, MA) Google Scholar
• Drekic S. A preemptive resume queue with an expiry time for retained service. (2001) . Working Paper, Department of Statistics and Actuarial Science, University of Waterloo, Waterloo, Ontario, CanadaGoogle Scholar
• Drekic S., Stanford D. A. Threshold-based interventions to optimize performance in preemptive priority queues. Queueing Systems (2000) 35:289–315Crossref, Google Scholar
• Drekic S., Stanford D. A. Reducing delay in preemptive repeat priority queues. Operations Research (2001) 49:145–156Link, Google Scholar
• Harris C. M., Marchal W. G. Distribution estimation using Laplace transforms. INFORMS Journal on Computing (1998) 10:448–458Link, Google Scholar
• Heller B.Macsyma for Statisticians (1991) (John Wiley & Sons, New York) Google Scholar
• Hong S. J., Takagi H. Analysis of transmission delay for a structured-priority packet-switching system. Computer Networks and ISDN Systems (1997) 29:701–715Crossref, Google Scholar
• Jaiswal N. K.Priority Queues (1968) (Academic Press, New York) Google Scholar
• Keilson J., Servi L. D. The distributional form of Little's law and the Fuhrmann-Cooper decomposition. Operations Research Letters (1990) 9:239–247Crossref, Google Scholar
• Kella O., Yechiali U. Priorities in M/G/1 queue with server vacations. Naval Research Logistics (1988) 35:23–34Crossref, Google Scholar
• Kendall W. S. Computer algebra in probability and statistics. Statistica Neerlandica (1993) 47:9–25Crossref, Google Scholar
• Kendall W. S., Armitage P., Colton T. Computer algebra. Encyclopaedia of Biostatistics (1998) (John Wiley & Sons, New York) Google Scholar
• Kleinrock L.Queueing Systems, Volume I: Theory (1975) (John Wiley & Sons, New York) Google Scholar
• Lucantoni D. M., Choudhury G. L., Whitt W. The transient BMAP/G/1 queue. Stochastic Models (1994) 10:145–182Crossref, Google Scholar
• McCullagh P.Tensor Methods in Statistics (1987) (Chapman and Hall, New York) Google Scholar
• Paterok M., Ettl A. Sojourn time and waiting time distributions for M/G/1 queues with preemption-distance priorities. Operations Research (1994) 45:725–735Google Scholar
• Silverman B. W., Young A. E. The bootstrap: To smooth or not to smooth? Biometrika (1987) 74:469–479Crossref, Google Scholar
• Stafford J. E., Andrews D. F. A symbolic algorithm for studying adjustments to the profile likelihood. Biometrika (1993) 80:715–730Crossref, Google Scholar
• Stuart A., Ord J. K.Kendall's Advanced Theory of Statistics, Volume 1: Distribution Theory (1994) (John Wiley & Sons, New York) Google Scholar
• Takács L. A single-server queue with Poisson input. Operations Research (1962) 10:388–394Link, Google Scholar
• Takács L. Delay distributions for one line with Poisson input, general holding times, and various orders of service. The Bell System Technical Journal (1963) 42:487–503Crossref, Google Scholar
• Takagi H. Priority queues with setup times. Operations Research (1990) 38:667–677Link, Google Scholar
• Takagi H.Queueing Analysis: A Foundation of Performance Evaluation, Volume 1: Vacation and Priority Systems, Part 1 (1991) (North-Holland, Amsterdam, The Netherlands) Google Scholar
• Takagi H., Kodera Y. Analysis of preemptive loss priority queues with preemption distance. Queueing Systems (1996) 22:367–381Crossref, Google Scholar
• Takagi H., Sakamaki K. Symbolic moment calculation for an M/G/1 queue. (1994) . Discussion Paper No. 596, Institute of SocioEconomic Planning, University of Tsukuba, Tsukuba, Ibaraki 305, JapanGoogle Scholar
• Takagi H., Sakamaki K. Moments for M/G/1 queues. The Mathematica Journal (1996) 6:75–80Google Scholar
• Takagi H., Sakamaki K. Symbolic moment calculation for the sojourn time in M/G/1 queues with Bernoulli feedback. Journal of the Operations Research Society of Japan (1999) 42:78–87Crossref, Google Scholar
• Wolfram S.The Mathematica Book (1999) 4th ed.(Cambridge University Press, New York) Google Scholar
• Young A. E., Daniels H. E. Bootstrap bias. Biometrika (1990) 77:179–185Crossref, Google Scholar