Probabilistic priorities in the M/G/1 queue
โ Scribed by D. E. Matthews
- Publisher
- John Wiley and Sons
- Year
- 1977
- Tongue
- English
- Weight
- 330 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of t
In teletraffic applications of retrial queues only the service zone is observable. Another part of a retrial queue, the orbit, which represents the delay before repeated attempts to get service, cannot be observed. Thus, it is very important to get general results about behavior of the orbit. We inv