On the inapproximability of M/G/K: why two moments of job size distribution are not enough
- First Online:
- Cite this article as:
- Gupta, V., Harchol-Balter, M., Dai, J.G. et al. Queueing Syst (2010) 64: 5. doi:10.1007/s11134-009-9133-x
- 270 Downloads
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, and we provide a lower bound on the inapproximability ratio, which we refer to as “the gap.” This is the first such result in the literature to address “the gap.” The proof technique behind this result is novel as well and combines mean value analysis, sample path techniques, scheduling, regenerative arguments, and asymptotic estimates. Finally, our work provides insight into the effect of higher moments of the job size distribution on the mean waiting time.