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
Waiting time analysis of the M/G/1 queue with finite retrial group
✍ Scribed by Jesus R. Artalejo; A. Gómez-Corral
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 149 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
This article shows how to determine the stationary distribution of the virtual wait in MiGil queues with either one-at-a-time or exhaustive server vacations, depending on either service times or accrued workload. For the first type of dependence, each vacation time is a function of the immediately p
The main peculiarity of multimedia services is the presence of intermedia relationships, that is, time relationships between the various media making up the multimedia stream. These, in fact, affect the characteristics of the traffic offered to the network and therefore they have to be taken into ac