The waiting time in the random order service G / M / m queue is studied. For the Laplace transform we obtain a simpler representation than previously available. For the moments, an explicit recursive algorithm is given and carried out numerically for some cases. This gives rise to the conjecture tha
โฆ LIBER โฆ
The queue G/M/m/N: Busy period and cycle, waiting time under reverse and random order service
โ Scribed by Stig I. Rosenlund
- Publisher
- John Wiley and Sons
- Year
- 1978
- Tongue
- English
- Weight
- 565 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
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.
๐ SIMILAR VOLUMES
The random order service G/M/m queue
โ
Stig I. Rosenlund
๐
Article
๐
1980
๐
John Wiley and Sons
๐
English
โ 358 KB
Calculating the M/G/1 busy-period densit
โ
Joseph Abate; Gagan L. Choudhury; Ward Whitt
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 455 KB