×
Wang, Runan; Casale, Giuliano; Filieri, Antonio

Estimating multiclass service demand distributions using Markovian arrival processes. (English) Zbl 1515.60296

ACM Trans. Model. Comput. Simul. 33, No. 1-2, Article No. 2, 26 p. (2023).

Cited in 1 Document

MSC:

60K25 Queueing theory (aspects of probability theory)
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
90B22 Queues and service in operations research

Keywords:

service demand distribution; Markovian arrival process; maximum likelihood estimation; queueing models; performance

Software:

PhFit
Cite Review PDF
Full Text: DOI

References:

[1] Bobbio, A., Horvath, A., and Telek, M.. 2005. Matching three moments with minimal acyclic phase type distributions. Stochastic Models21, 2-3 (2005), 303-326. DOI: · Zbl 1069.60013
[2] Andersen, Allan T., Neuts, Marcel F., and Nielsen, Bo Friis. 2000. Lower order moments of inter-transition times in the stationary QBD process. Methodol. Comput. Appl. Prob.2, 4 (2000), 339-357. · Zbl 0984.60084
[3] Anselmi, Jonatha, D’Auria, Bernardo, and Walton, Neil. 2013. Closed queueing networks under congestion: Nonbottleneck independence and bottleneck convergence. Math. Oper. Res.38, 3 (2013), 469-491. · Zbl 1294.60108
[4] Bramson, Maury, Lu, Yi, and Prabhakar, Balaji. 2010. Randomized load balancing with general service time distributions. ACM SIGMETRICS Perform. Eval. Rev.38, 1 (2010), 275-286. · Zbl 1275.60071
[5] Brandwajn, Alexandre and Begin, Thomas. 2019. First-come-first-served queues with multiple servers and customer classes. Perform. Eval.130 (2019), 51-63.
[6] Buchholz, Peter, Kemper, Peter, and Kriege, Jan. 2010. Multi-class Markovian arrival processes and their parameter fitting. Perform. Eval.67, 11 (2010), 1092-1106.
[7] Casale, Giuliano. 2011. Building accurate workload models using Markovian arrival processes. ACM SIGMETRICS Perform. Eval. Rev.39, 1 (2011), 357-358.
[8] Casale, Giuliano, Cremonesi, Paolo, and Turrin, Roberto. 2007. How to select significant workloads in performance models. In Proceedings of the CMG Conference Proceedings. Citeseer, 58-108.
[9] Casale, Giuliano, Cremonesi, Paolo, and Turrin, Roberto. 2008. Robust workload estimation in queueing network performance models. In Proceedings of the 16th Euromicro Conference on Parallel, Distributed, and Network-based Processing (PDP’08). IEEE, 183-187.
[10] Chakravarthy, Srinivas R.. 2019. Busy period analysis of GI/G/c and MAP/G/c queues. In Performance Prediction and Analytics of Fuzzy, Reliability and Queuing Models. Springer, 1-31.
[11] Cremonesi, Paolo, Schweitzer, Paul J., and Serazzi, Giuseppe. 2002. A unifying framework for the approximate solution of closed multiclass queuing networks. IEEE Trans. Comput.51, 12 (2002), 1423-1434. · Zbl 1391.90134
[12] Dudin, Sergei and Dudina, Olga. 2019. Retrial multi-server queuing system with PHF service time distribution as a model of a channel with unreliable transmission of information. Appl. Math. Model.65 (2019), 676-695. · Zbl 1481.90128
[13] Duggan, Martin, Mason, Karl, Duggan, Jim, Howley, Enda, and Barrett, Enda. 2017. Predicting host CPU utilization in cloud computing using recurrent neural networks. In Proceedings of the 12th International Conference for Internet Technology and Secured Transactions (ICITST’17). IEEE, 67-72.
[14] Franks, Greg, Al-Omari, Tariq, Woodside, Murray, Das, Olivia, and Derisavi, Salem. 2008. Enhanced modeling and solution of layered queueing networks. IEEE Trans. Softw. Eng.35, 2 (2008), 148-161.
[15] Garetto, Michele, Cigno, R. Lo, Meo, Michela, and Marsan, M. Ajmone. 2001. A detailed and accurate closed queueing network model of many interacting TCP flows. In Proceedings of the IEEE Conference on Computer Communications. 20th Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM’01), Vol. 3. IEEE, 1706-1715. · Zbl 1010.68839
[16] Balbo, Gianfranco, Bruell, Steven C., and Ghanta, Subbarao. 1986. The solution of homogeneous queueing networks with many job classes. J. Syst. Softw.6, 1 (1986), 41-53. · Zbl 0658.68121
[17] Grigoreva, Elena, Laurer, Maximilian, Vilgelm, Mikhail, Gehrsitz, Thomas, and Kellerer, Wolfgang. 2017. Coupled Markovian arrival process for automotive machine type communication traffic modeling. In Proceedings of the IEEE International Conference on Communications (ICC’17). IEEE, 1-6.
[18] Horváth, András and Telek, Miklós. 2002. Phfit: A general phase-type fitting tool. In Proceedings of the International Conference on Modelling Techniques and Tools for Computer Performance Evaluation. Springer, 82-91. · Zbl 1047.68528
[19] Kim, Bara, Kim, Jeongsim, and Kim, Jerim. 2010. Tail asymptotics for the queue size distribution in the MAP/G/1 retrial queue. Queue. Syst.66, 1 (2010), 79-94. · Zbl 1198.60038
[20] Klemm, Alexander, Lindemann, Christoph, and Lohmann, Marco. 2003. Modeling IP traffic using the batch Markovian arrival process. Perform. Eval.54, 2 (2003), 149-173. · Zbl 1047.68532
[21] Krishna, K. and Murty, M. Narasimha. 1999. Genetic K-means algorithm. IEEE Trans. Syst., Man, Cybernet., Part B (Cybernet.)29, 3 (1999), 433-439.
[22] Krishnamoorthy, Achyutha, Manikandan, R., and Lakshmy, B.. 2015. A revisit to queueing-inventory system with positive service time. Ann. Oper. Res.233, 1 (2015), 221-236. · Zbl 1327.90050
[23] Liao, Shasha, Zhang, Hongjie, Shu, Guansheng, and Li, Jing. 2017. Adaptive resource prediction in the cloud using linear stacking model. In Proceedings of the 5th International Conference on Advanced Cloud and Big Data (CBD’17). IEEE, 33-38.
[24] Maciel, Paulo, Matos, Rubens, Silva, Bruno, Figueiredo, Jair, Oliveira, Danilo, Fé, Iure, Maciel, Ronierison, and Dantas, Jamilson. 2017. Mercury: Performance and dependability evaluation of systems with exponential, expolynomial, and general distributions. In Proceedings of the IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC’17). 50-57.
[25] Marsan, M. Ajmone, Balbo, Gianfranco, Conte, Gianni, Donatelli, Susanna, and Franceschinis, Giuliana. 1998. Modelling with generalized stochastic Petri nets. ACM SIGMETRICS Perform. Eval. Rev.26, 2 (1998), 2.
[26] Mazkatli, Manar and Koziolek, Anne. 2018. Continuous integration of performance model. In Proceedings of the ACM/SPEC International Conference on Performance Engineering. 153-158.
[27] Moler, Cleve and Loan, Charles Van. 2003. Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM Rev.45, 1 (2003), 3-49. · Zbl 1030.65029
[28] Neuts, Marcel F.. 1992. Models based on the Markovian arrival process. IEICE Trans. Commun.75, 12 (1992), 1255-1265.
[29] Neuts, Marcel F. and Meier, Kathleen S.. 1981. On the use of phase type distributions in reliability modelling of systems with two components. Oper.-Res.-Spektr.2, 4 (1981), 227-234. · Zbl 0463.60073
[30] O’Cinneide, Colm Art. 1990. Characterization of phase-type distributions. Stochastic Models6, 1 (1990), 1-57. · Zbl 0701.62021
[31] Okamura, Hiroyuki and Dohi, Tadashi. 2009. Faster maximum likelihood estimation algorithms for Markovian arrival processes. In Proceedings of the 6th International Conference on the Quantitative Evaluation of Systems. IEEE, 73-82. · Zbl 1185.68260
[32] Osogami, Takayuki and Harchol-Balter, Mor. 2003. A closed-form solution for mapping general distributions to minimal PH distributions. In Proceedings of the International Conference on Modelling Techniques and Tools for Computer Performance Evaluation. Springer, 200-217. · Zbl 1274.60041
[33] Pan, Jian-Xin and Fang, Kai-Tai. 2002. Maximum likelihood estimation. In Growth Curve Models and Statistical Diagnostics. Springer, 77-158. · Zbl 1024.62025
[34] Parini, A. and Pattavina, Achille. 2005. Modelling voice call interarrival and holding time distributions in mobile networks. In Proceedings of the International Teletraffic Congress (ITC’05). 729-738.
[35] Pérez, Juan F. and Casale, Giuliano. 2017. Line: Evaluating software applications in unreliable environments. IEEE Trans. Reliabil.66, 3 (2017), 837-853.
[36] Pérez, JuaHon F., Pacheco-Sanchez, Sergio, and Casale, Giuliano. 2013. An offline demand estimation method for multi-threaded applications. In Proceedings of the IEEE 21st International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems. IEEE, 21-30.
[37] Reibman, Andrew and Trivedi, Kishor. 1988. Numerical transient analysis of Markov models. Comput. Oper. Res.15, 1 (1988), 19-36. · Zbl 0642.60097
[38] Rolia, Jerome and Vetland, Vidar. 1998. Correlating resource demand information with arm data for application services. In Proceedings of the 1st International Workshop on Software and Performance. 219-230.
[39] Sidje, Roger B., Burrage, Kevin, and MacNamara, Shev. 2007. Inexact rouniformization method for computing transient distributions of Markov chains. SIAM J. Sci. Comput.29, 6 (2007), 2562-2580. · Zbl 1154.65300
[40] Spinner, Simon, Casale, Giuliano, Brosig, Fabian, and Kounev, Samuel. 2015. Evaluating approaches to resource demand estimation. Perform. Eval.92 (2015), 51-71.
[41] Thummler, Axel, Buchholz, Peter, and Telek, Miklós. 2006. A novel approach for phase-type fitting with the EM algorithm. IEEE Trans. Depend. Secure Comput.3, 3 (2006), 245-258.
[42] Wang, Runan, Casale, Giuliano, and Filieri, Antonio. 2021. Service demand distribution estimation for microservices using Markovian arrival processes. In Proceedings of the International Conference on Quantitative Evaluation of Systems. Springer, 310-328. · Zbl 1491.68032
[43] Wang, Wei, Huang, Xiang, Qin, Xiulei, Zhang, Wenbo, Wei, Jun, and Zhong, Hua. 2012. Application-level CPU consumption estimation: Towards performance isolation of multi-tenancy web applications. In Proceedings of the IEEE 5th International Conference on Cloud Computing. IEEE, 439-446.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.