Waiting time distribution for the M∕M∕m queue
- 1 January 2003
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings - Communications
- Vol. 150 (3) , 159-162
- https://doi.org/10.1049/ip-com:20030274
Abstract
A novel method is presented for the calculation of the waiting time distribution function for the M/M/m queue. It is shown that the conditional waiting time obeys an Erlang distribution with rate mμ, where μ is the service rate of a server. An explicit closed form solution is obtained by means of the probability density function of the Erlang distribution. The derivation of the result proved to be very simple. The significance of Khintchine's method and its close relation to the proposed method is pointed out. It is also shown that the waiting time distribution can be obtained from Takacs's waiting time distribution for the G/M/m queue as a special case. This reveals some insight into the significance of Takacs's more general, but rather complex, result.Keywords
This publication has 5 references indexed in Scilit:
- Modeling wireless local loop with general call holding times and finite number of subscribersIEEE Transactions on Computers, 2002
- Queueing theoryPublished by Association for Computing Machinery (ACM) ,1981
- On the many server queue with exponential service timesAdvances in Applied Probability, 1973
- Some general results for many server queuesAdvances in Applied Probability, 1973
- On Waiting Time for Many-Server Queueing SystemsTheory of Probability and Its Applications, 1965