Analysis of the MAP/PH/1/K queue with service control

✍ Scribed by Chakravarthy, S.

• Publisher: John Wiley and Sons
• Year: 1996
• Tongue: English
• Weight: 638 KB
• Volume: 12
• Category: Article
• ISSN: 8755-0024
• DOI: 10.1002/(sici)1099-0747(199609)12:3<179::aid-asm282>3.0.co;2-u

✦ Synopsis

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 fast service times are both assumed to be of phase type with representations (B, S), and (B, 0s). respectively, where 0 > 1. For this queueing model, steady state analysis is performed. The server duration in normal as well as fast periods is shown to be of phase type. The departure process is modelled as a MAP and the parameter matrices of the MAP are identified. Efficient algorithms for computing system performance measures are presented. We also discuss an optimization problem and present an efficient algorithm for arriving at an optimal solution. Some numerical examples are discussed.