On the inapproximability of M/G/K: why two moments of job size distribution are not enough

@article{Gupta2010OnTI,
  title={On the inapproximability of M/G/K: why two moments of job size distribution are not enough},
  author={Varun Gupta and Mor Harchol-Balter and J. G. Dai and Bert Zwart},
  journal={Queueing Syst.},
  year={2010},
  volume={64},
  pages={5-48}
}
The M/G/K queueing system is one of the oldest models for multiserver systems and has been the topic of performance papers for almost half a century. However, even now, only coarse approximations exist for its mean waiting time. All the closed-form (nonnumerical) approximations in the literature are based on (at most) the first two moments of the job size distribution. In this paper we prove that no approximation based on only the first two moments can be accurate for all job size distributions… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS
23 Citations
48 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 48 references

Some results for the mean waiting-time and workload in GI/GI/k queues

  • D. J. Daley
  • Dshalalow, J.H. (ed.) Frontiers in Queueing…
  • 1997
Highly Influential
10 Excerpts

Conditional PASTA

  • E. A. van Doorn, J. K. Regterschot
  • Oper. Res. Lett. 7, 229–232
  • 1988
Highly Influential
5 Excerpts

Queueing process associated with airline passenger check-in

  • A. M. Lee, P. A. Longton
  • Oper. Res. Q. 10, 56–71
  • 1959
Highly Influential
3 Excerpts

Heavy traffic theory for queues with several servers

  • J. Köllerström
  • I. J. Appl. Probab. 11, 544–552 (1974) 48…
  • 2010
3 Excerpts

Similar Papers

Loading similar papers…