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

Busy period analysis forM/PH/1 queues with

โœ Scribed by Liqiang Liu; Vidyadhar G. Kulkarni

Publisher
Springer US
Year
2008
Tongue
English
Weight
401 KB
Volume
59
Category
Article
ISSN
0257-0130

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the busy period of the M/G/1 retrial
On the busy period of the M/G/1 retrial queue
โœ 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

Analysis of the MAP/PH/1/K queue with se
Analysis of the MAP/PH/1/K queue with service control
โœ Chakravarthy, S. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 638 KB

We consider a finite capacity queue with Markovian amvals, in which the service rates are controlled by two pre-determined thresholds, M and N . The service rate is increased when the buffer size exceeds N and then brought back to normal service rate when the buffer size drops to M. The normal and f