Abstract
Multiserver queues with setup time have been extensively studied because they have application in modelling of power-saving data centers. Although the infinite buffer models are extensively investigated, less attention has been paid to finite buffer models. This paper considers an M/M/\(c\)/\(K\) queue with setup time for which we suggest a simple and numerically stable recursion for the stationary distribution of the system state. Numerical experiments show various insights into the performance of the system such as performance-energy tradeoff as well as the effect of the capacity on the blocking probability and the mean queue length.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barroso, L.A., Holzle, U.: The case for energy-proportional computing. Computer 40(12), 33–37 (2007)
Kuehn, P.J., Mashaly, M.E.: Automatic energy efficiency management of data center resources by load-dependent server activation and sleep modes. Ad Hoc Networks 25, 497–504 (2015)
Gandhi, A., Harchol-Balter, M., Adan, I.: Server farms with setup costs. Performance Evaluation 67, 1123–1138 (2010)
Gandhi, A., Doroudi, S., Harchol-Balter, M., Scheller-Wolf, A.: Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward. In: Proceedings of the ACM SIGMETRICS, pp. 153–166. ACM (2013)
Gandhi, A., Doroudi, S., Harchol-Balter, M., Scheller-Wolf, A.: Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward. Queueing Systems 77(2), 177–209 (2014)
Slegers, J., Thomas, N., Mitrani, I.: Dynamic server allocation for power and performance. In: Kounev, S., Gorton, I., Sachs, K. (eds.) SIPEW 2008. LNCS, vol. 5119, pp. 247–261. Springer, Heidelberg (2008)
Mitrani, I.: Managing performance and power consumption in a server farm. Annals of Operations Research 202(1), 121–134 (2013)
Phung-Duc, T., Masuyama, H., Kasahara, S., Takahashi, Y.: A simple algorithm for the rate matrices of level-dependent QBD processes. In: Proceedings of the 5th International Conference on Queueing Theory and Network Applications (QTNA2010), Beijing, China, pp. 46–52. ACM, New York (2010)
Phung-Duc, T.: Impatient customers in power-saving data centers. In: Sericola, B., Telek, M., Horváth, G. (eds.) ASMTA 2014. LNCS, vol. 8499, pp. 185–199. Springer, Heidelberg (2014)
Phung-Duc, T.: Server farms with batch arrival and staggered setup. In: Proceedings of the Fifth Symposium on Information and Communication Technology, pp. 240–247. ACM (2014)
Phung-Duc, T.: Exact solution for M/M/\(c\)/Setup queue (2014). http://arxiv.org/abs/1406.3084
Tian, N., Li, Q.L., Gao, J.: Conditional stochastic decompositions in the M/M/\(c\) queue with server vacations. Stochastic Models 15, 367–377 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Phung-Duc, T. (2015). Multiserver Queues with Finite Capacity and Setup Time. In: Gribaudo, M., Manini, D., Remke, A. (eds) Analytical and Stochastic Modelling Techniques and Applications. ASMTA 2015. Lecture Notes in Computer Science(), vol 9081. Springer, Cham. https://doi.org/10.1007/978-3-319-18579-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-18579-8_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18578-1
Online ISBN: 978-3-319-18579-8
eBook Packages: Computer ScienceComputer Science (R0)