28
Views
0
CrossRef citations to date
0
Altmetric
Articles

Delay Moment Bounds for Multiserver Queues with Infinite Variance Service Times

&
Pages 161-174 | Received 01 Sep 2013, Accepted 01 Jul 2014, Published online: 16 Jun 2016

References

  • Asmussen S.Applied Probability and Queues, 2003, New YorkSpringer Verlag
  • Daley D. J., Inequalities for moments of tails of random variables, with queueing applications, Z. Wahrsch, 1977, 41:139–143
  • Daley D. J., Kreinin A. Y., Trengrove C. D., Bhat U.V., Basawa I.V., Inequalities concerning the waiting-time in single-server queues: A survey, Queueing and Related Models, 1992, New York, Oxford Univ. Press177–233
  • Foss S. G., Chernova N. I., On backwards induction and pathise optimality of FCFS and LCFS disciplines in multiserver queues, Siberian Math. J., 2001, 42(2):372–385
  • Foss S., Korshunov D., Heavy tails in multi-server queue, Queueing Systems, 2006, 52:31–48
  • Gross D., Shortle J. F., Thompson J. M., Harris C. M.Fundamentals of Queueing Theory, 2008Hoboken, New Jersey, John Wiley & Sons
  • Harchol-Balter M., The effect of heavy-tailed job size distributions on computer system design, Proceedings of ASA-IMS Conference on Applications of Heavy Tailed Distributions in Economics, Engineering and Statistics, 1999, Washington, DC June 1999
  • Harchol-Balter M., Task assignment with unknown duration, J. Assoc. Comput. Mach., 2002, 49(2):260–288
  • Kiefer J., Wolfowitz J., On the theory of queues with many servers, Trans. Amer. Math. Soc., 1955, 78:1–18
  • Kiefer J., Wolfowitz J., On the characteristics of the general queueing process with applications to random walk, Ann. Math. Statist., 1956, 27:147–161
  • Kingman J. F. C., Inequalities in the theory of queues, J. Roy. Statist. Soc. B, 1970, 32:102–110
  • Lemoine A. J., On random walks and stable queues, Math. of Op. Research, 1976, 1(2):159–164
  • Mitrinović D. S., Analytic Inequalities, 1970BerlinSpringer Verlag
  • Scheller-Wolf A., Sigman K., Delay moments for FIFO queues, Queueing Systems, 1997a, 25:77–95
  • Scheller-Wolf A., Sigman K., New bounds for expected delay in FIFO queues, Queueing Systems, 1997b, 26:169–186
  • Scheller-Wolf A., Further delay moment results for FIFO multiserver queues, Queueing Systems, 2000, 34:387–400
  • Scheller-Wolf A., Necessary and sufficient conditions for delay moments in FIFO multiserver queues: Why slow servers are better than one fast server for heavy-tailed systems, Operations Research, 2003, 51:748–758
  • Scheller-Wolf A., Vesilo R., Structural interpretation and derivation of necessary and sufficient conditions for delay moments in FIFO multiserver queues, Queueing Systems, 2006, 54:221–232
  • Scheller-Wolf A., Vesilo R., Sink or swim together: Necessary and sufficient conditions for finite moments of workload components in FIFO multiserver queues, Queueing Systems, 2011, 67(1):47–61
  • Stoyan D.Qualitativ Eigenschaften Abschätzungen und Stochastischer Modelle, 1977, Berlin, Academie-Verlag
  • Stoyan D.Comparison Methods for Queues and other Stochastic Models, 1983 (Translation and Revision of Stoyan (1977), ed. D. J. Daley)
  • Whitt W., The impact of a heavy-tailed service-time distribution upon the waiting-time distribution, Queueing Systems, 2000, 36:71–87
  • Wolff R., An upper bound for multi-channel queues, J. Appl. Probab., 1977, 14:884–888
  • Wolff R.Stochastic Modeling and the Theory of Queues, 1989, New Jersey, Prentice-Hall

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.