Author:
Van Hoorn M. H.,Seelen L. P.
Abstract
In this paper, we give good-quality approximations for multiserver queues with general service-time distributions. For the interarrival-time distribution we consider hyperexponential distributions and mixtures of Erlang distributions with the same scale parameters. We give an algorithm to compute various operating characteristics such as the delay probability and the mean queue length.The approximations are obtained by making assumptions regarding the residual service times of services in progress at service completion epochs, whereas the arrival process is modelled exactly. As the operating characteristics are far more sensitive to changes in the parameters of the arrival process, the latter is very important.The quality of the approximations is extensively tested by using the exact results of more than 2000 cases. In heavy traffic the average relative error is up to 1% and in moderate traffic about 4%.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Predicting the performance of queues–A data analytic approach;Computers & Operations Research;2016-12
2. The G/G/s Queue;Wiley Encyclopedia of Operations Research and Management Science;2011-02-15
3. NOTE ON APPROXIMATIONS FOR THE MULTISERVER QUEUE WITH FINITE BUFFER AND DETERMINISTIC SERVICES;Probability in the Engineering and Informational Sciences;2008-09-25
4. Analysis of Traffic Distribution and Blocking Probability in Future Wireless Networks;International Journal of Wireless Information Networks;2006-12-27
5. NEGATIVE PROBABILITIES AT WORK IN THE
M/D/1 QUEUE;Probability in the Engineering and Informational Sciences;2006-12-15