Abstract
In this paper, we consider a queue whose service speed changes according to an external environment that is governed by a Markov process. It is possible that the server changes its service speed many times while serving a customer. We derive first and second moments of the service time of customers in system using first step analysis to obtain an insight on the service process. In fact, we obtain an intriguing result in that the moments of service time actually depend on the arrival process! We also show that the mean service rate is not the reciprocal of the mean service time.
Further, since it is not possible to obtain a closed form expression for the queue length distribution, we use matrix geometric methods to compute performance measures such as average queue length and waiting time. We apply the method of large deviations to obtain tail distributions of the workload in the queue using the concept of effective bandwidth. We present two applications in computer systems: (1) Web server with multi-class requests and (2) CPU with multiple processes. We illustrate the analysis and various methods discussed with the help of numerical examples for the above two applications.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I.J.B.F. Adan and V.G. Kulkarni, Single server queue with markov dependent interarrival and service times, Queueing Systems 45(2) (2003) 113–134.
S. Ahn and J. Jeon, Large deviation results for queues with continuous time markov modulated arrivals, Engineering Simulation 18(1) (2000) 67–74.
M. Baykal-Gursoy and W. Xiao, Stochastic decomposition in M/M/∞ queues with Markov modulated service rates, Queueing Systems 48 (2004) 75–88.
T. Bonald and A. Proutiere, Insensitive bandwidth sharing in data networks, Queueing Systems 44 (2003) 69–100.
O.J. Boxma and I.A. Kurkova, The M/G/1 queue with two service speeds, Adv. Applied Probability 33 (2001) 520–540.
I. Cidon, R. Gu'erin, A. Khamisy, and M. Sidi, On queues with inter-arrival times proportional to service times, Technion, EE PUB (1991) (811).
T. Collings and C. Stoneman, The M/M/∞ queue with varying arrival and service rates, Operations Research 24 (1976) 760–773.
C. Courcoubetis and R. Weber, Effective bandwidths for stationary sources, Prob. Eng. Inf. Sci. 9 (1995) 285–296.
K. Dorman, karindorman.stat.iastate.edu/stat432/2003-09-12.pdf.
A.I. Elwalid and D. Mitra, Effective bandwidth of general Markovian traffic sources and admission control of high speed networks, IEEE/ACM Transactions on Networking 1(3) (1993) 329–343.
N. Gautam, V.G. Kulkarni, T. Rolski, and Z. Palmowski, Bounds for fluid models driven by semi-Markov inputs, Probability in Engineering and Informational Sciences 13(4) (1999) 429–475.
J.S. Kaufman, Blocking in shared resource environment, IEEE Transactions on Communications 29(10) (1981) 1494–1481.
F.P. Kelly, Notes on Effective Bandwidth, Stochastic Networks: Theory and Applications, (Oxford University Press, 1996).
G. Kesidis, J. Walrand, and C-S. Chang, Effective bandwidths for multiclass Markov fluids and other ATM sources, IEEE/ACM Transactions on Networking 1(3) (1993) 424–428.
V.G. Kulkarni, Modeling and Analysis of Stochastic Systems. Chapman and Hall texts in Statistical series, CRC press, (1995).
V.G. Kulkarni, Effective bandwidths for Markov regenerative sources, Queueing Systems 24 (1997) 137–153.
G. Latouche, C. Pierce, and P. Taylor, Invariant measures for quasi-birth and death processes, Stochastic Models (1997).
W. Massey, The analysis of queues with time-varying rates for telecommunication models, Telecommunication Systems 21(2–4) (2002) 173–204.
M.F. Neuts, Matrix geometric Solutions in Stochastic models: An algorithmic Approach, (Johns Hopkins University Press, Baltimore, 1981).
R. Núñez-Queija, Steady state analysis of a queue with varying service rate, Technical Report PNA-R9712, CWI (1997).
V. Ramaswami, Algorithmic analysis of stochastic models: The changing face of mathematics, Ramanujam Endowment Lecture at Anna University, Chennai, India (2000).
A. Riska and E. Smirni, Mamsolver: A matrix analytical method tool, in the Proceedings of the 12th International Conference on Modeling Techniques and Tools for Computer and Communication Systems Performance Evaluation, LNCS 2324 (2002) 205–211.
J.W. Roberts, A Service system with heterogeneous user requirements, Performance of Data Communication Systems and their Applications (1981) 423–431.
K.W. Ross, Multiservice Loss Models for Broadband Telecommunication Networks (New York: Springer-Verlag, 1995).
V. Sharma, Queues with service rate controlled by a delayed feedback, Queueing Systems 39(4) (2001) 303–315.
H. Takahashi and L. Wang, Approximate analysis of a queueing system with Markov modulated arrivals, Electronics and Communications in Japan, Part 1 73(11) (1990) 12–21.
J.R. Thorne, Modeling complex queuing situations with markov processes, URL: charyb-dis.mit.csu.edu.au/mantolov/CD/ICITA2002/papers/077–1.pdf.
Z. Yong-Pin and G. Noah, A single-server queue with Markov modulated service times, (October 1999), URL: http://fic.wharton.upenn.edu/fic/papers/99/9940.pdf.
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS subject classification: 90B22, 68M20
Rights and permissions
About this article
Cite this article
Mahabhashyam, S.R., Gautam, N. On Queues with Markov Modulated Service Rates. Queueing Syst 51, 89–113 (2005). https://doi.org/10.1007/s11134-005-2158-x
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11134-005-2158-x