A Single-Server Queue with Markov Modulated Service Times
We study an M/MMPP/1 queuing system, where the arrival process is Poisson and service requirements are Markov modulated. When the Markov Chain modulating service times has two states, we show that the distribution of the number-in-system is a superposition of two matrix-geometric series and provide a simple algorithm for computing the rate and coefficient matrices. These results hold for both finite and infinite waiting space systems and extend results obtained in Neuts  and Naoumov . Numerical comparisons between the performance of the M/MMPP/1 system and its M/G/1 analogue lead us to make the conjecture that the M/MMPP/1 system performs better if and only if the total switching probabilities between the two states satisfy a simple condition. We give an intuitive argument to support this conjecture.
|Date of creation:||Oct 1999|
|Date of revision:|
|Contact details of provider:|| Postal: 3301 Steinberg Hall-Dietrich Hall, 3620 Locust Walk, Philadelphia, PA 19104.6367|
Web page: http://fic.wharton.upenn.edu/fic/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:wop:pennin:99-40. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.