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
✦ LIBER ✦
On the longest service time in a busy period of the M⧸G⧸1 queue
✍ Scribed by O.J. Boxma
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 714 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0304-4149
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On the busy period of the M/G/1 retrial
✍
J.R. Artalejo; M.J Lopez-Herrero
📂
Article
📅
2000
🏛
John Wiley and Sons
🌐
English
⚖ 150 KB
👁 1 views
The queue G/M/m/N: Busy period and cycle
✍
Stig I. Rosenlund
📂
Article
📅
1978
🏛
John Wiley and Sons
🌐
English
⚖ 565 KB
## 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
On the behavior of the batch arrival que
✍
Wolfgang Stadje
📂
Article
📅
1994
🏛
John Wiley and Sons
🌐
English
⚖ 578 KB
Joint distribution of sojourn time and q
✍
O.J. Boxma
📂
Article
📅
1984
🏛
Elsevier Science
🌐
English
⚖ 441 KB
Approximation for the variance of the wa
✍
Vasanthakumar N. Bhat
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 247 KB
Waiting time analysis of the M/G/1 queue
✍
Jesus R. Artalejo; A. Gómez-Corral
📂
Article
📅
2007
🏛
John Wiley and Sons
🌐
English
⚖ 149 KB