The queue G/M/m/N: Busy period and cycle, waiting time under reverse and random order service
暂无分享,去创建一个
The busy period, busy cycle, and the numbers of customers served and lost therein, of the G/M/m queue with balking is studied via the embedded Markov chain approach. It is shown that the expectations of the two discrete variables give the loss probability. For the special case G/M/1/N a closed expression in terms of contour integrals is obtained for the Laplace transform of these four variables. This yields as a byproduct the LIFO waiting time distribution for the G/M/m/N queue. The waiting time under random order service for this queue is also studied.
[1] De Smit,et al. On the many server queue with exponential service times , 1973 .
[2] Vincent Hodgson,et al. The Single Server Queue. , 1972 .
[3] P. D. Finch. Balking in the queueing system GI/M/1 , 1959 .
[4] L. Takács. On the generalization of Erlang's formula , 1956 .
[5] U. N. Bhat. The queue gi/m/2 with service rate depending on the number of busy servers , 1966 .