Abstract
In this paper we consider an M/M/1 queue, in which the customer service rate is allowed to be increased and decreased by a fixed value at each customer service completion. These changes in service rate are controlled by probabilities depending on the actual number of customers and the actual service rate. The dependency on the number of customers follows a specific power form, while the dependency on actual service rate is general and independent of the dependency on the number of customers.
We describe how to compute the partial stationary distribution of the service rate values when the system is empty. Based on it we provide a computational procedure for computing the stationary probability vectors of the number of customers in the system. We derive also the vector probability generating function and the vector mean of the stationary number of customers.
We establish a methodology which utilizes the specific structure of the model. This methodology inherits some element from the stationary analysis of the standard QBD model and provides a first order, forward algorithm for computing the stationary probability vectors of the number of customers in the system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Phung-Duc, T.: Exact solutions for M/M/c/setup queues. Telecommun. Syst. 64(2), 309–324 (2017)
Yajima, M., Phung-Duc, T.: Batch arrival single server queue with variable service speed and setup time. Queueing Syst. 86(3–4), 241–260 (2017)
Phung-Duc, T., Rogiest, W., Wittevrongel, S.: Single server retrial queues with speed scaling: analysis and performance evaluation. J. Ind. Manage. Optim. 13(4), 1927–1943 (2017)
Kleinrock, L., Muntz, R.: Processor sharing queueing models of mixed scheduling disciplines for time shared systems. J. ACM 19, 464–482 (1972)
Saffer, Z., Telek, M.: Analysis of globally gated Markovian limited cyclic polling model and its application to uplink traffic in the IEEE 802.16 network. J. Ind. Manage. Optim. (JIMO) 7(3), 677–697 (2011)
Leung, K.K., Eisenberg, M.: A single-server queue with vacations and non-gated time-limited service. Perform. Eval. 12(2), 115–125 (1991)
Bruneel, H., Rogiest, W., Walraevens, J., Wittevrongel, S.: On queues with general service demands and constant service capacity. In: Norman, G., Sanders, W. (eds.) QEST 2014. LNCS, vol. 8657, pp. 210–225. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10696-0_17
Bruneel, H., Wittevrongel, S., Claeys, D., Walraevens, J.: Discrete-time queues with variable service capacity: a basic model and its analysis. Ann. Oper. Res. 239(2), 359–380 (2016)
De Muynck, M., Bruneel, H., Wittevrongel, S.: Delay analysis of a queue with general service demands and correlated service capacities. In: Takahashi, Y., Phung-Duc, T., Wittevrongel, S., Yue, W. (eds.) QTNA 2018. LNCS, vol. 10932, pp. 64–85. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93736-6_5
Conway, R.W., Maxwell, W.L.: A queueing model with state dependent service rate. J. Ind. Eng. 12, 132–136 (1961)
Lia, H., Yang, T.: Queues with a variable number of servers. EJOR 124(3), 615–628 (2000)
Mazalov, V., Gurtov, A.: Queuing system with on-demand number of servers. Math. Applicanda 40(2) 15/56, 1–12 (2012)
Saffer, Z., Grill, K., Yue, W.: Controllable capacity queue with synchronous constant service time and loss. In: Takahashi, Y., Phung-Duc, T., Wittevrongel, S., Yue, W. (eds.) QTNA 2018. LNCS, vol. 10932, pp. 51–63. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93736-6_4
Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The John Hopkins University Press, Baltimore (1981)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Saffer, Z., Grill, K., Yue, W. (2019). M/M/1 Queue with Controllable Service Rate. In: Phung-Duc, T., Kasahara, S., Wittevrongel, S. (eds) Queueing Theory and Network Applications. QTNA 2019. Lecture Notes in Computer Science(), vol 11688. Springer, Cham. https://doi.org/10.1007/978-3-030-27181-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-27181-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27180-0
Online ISBN: 978-3-030-27181-7
eBook Packages: Computer ScienceComputer Science (R0)