๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithmic approximations for the busy period distribution of the M/M/c retrial queue

โœ Scribed by J.R. Artalejo; A. Economou; M.J. Lopez-Herrero


Book ID
108118045
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
261 KB
Volume
176
Category
Article
ISSN
0377-2217

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 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