Performance Approximations of Markov Modulated Poisson Process Arrival Queue With Markovian Service Using Matrix Geometric Approach
DOI:
https://doi.org/10.2298/YJOR230715027RKeywords:
(MMPP), (MSP), performance analysis, quasi-birth-death process, structured Markov chain, optimal costAbstract
Queue analysis of correlated work of the arrival and the service process are not available much in literature. This research paper applies matrix geometric approach to study the MMPP/MSP/1 queuing model under the quasi-birth death(QBD) process. Customers admitted in the system are having two different intensity of arrival followed by Markov Modulated Poisson Process(MMPP). MMPP is a versatile class of MAP and it is necessary to adapt the first characterization of the queuing model. In service mechanism Markov Service Process(MSP) is adopted. As like MMPP, MSP is also a versatile and can capture the correlation of the modulated arrivals. The methodology presented in this research work calculates the metric performances not depending on the series of infinite state of the system. The assumed model is formulated as QBD process to obtain the steady state probability of the system. The complexity model formulated involves structures matrices with appropriate dimension. Neut’s pioneered the matrix geometric approach to such complex models which involves the rate computation of rate matrix R. The rate matrix R is approximated to derive the performance metrics of the system and then compute the cost for the underlying Markov chain. To attain this approximation the sensitivity analysis is done with numerical results.References
A. Heindl, “Traffic based decomposition of general queueing networks with correlated input processes,” Shaker Verlag., pp. 865-881, 2001.
Y. Bard, “Some extensions to multi class queueing network analysis,” Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems, pp. 51-62, 1979.
A. Asanjarani and Y. Nazarathy, “A queueing approximation of mmpp/ph/1,” Queueing Theory and Network Applications, pp. 41-51, 2016.
A. Heindl and M. Telek, “Output models of map/ph/1/k queues for an efficient network decomposition,” Performance Evaluation, vol. 49, pp. 321-339, 2002.
W. Fischer and K. Meier-Hellstern, “The markov-modulated poisson process (mmpp) cookbook,” Performance Evaluation, vol. 18, pp. 149-171, 1993.
W. Turin and M. Zorzi, “Performance analysis of delay-constrained communications over slow rayleigh fading channels,” Wireless Communication, vol. 1, pp. 801-807, 2002.
R. R. R. Sakthi and V. Vidhya, “Optimality of state dependent single server queue with mmpp input,” Advances in Mathematics: Scientific Journal, vol. 9, pp. 1197-1204, 2020.
M. M. M. A. M. L. Muscariello, M. Mellia and R. L. Cigno, “Markov models of internet traffic and a new hierarchical mmpp model,” Computer Communication, vol. 28, pp. 1835- 1851, 2005.
R. V. P. Salvador and A. Pacheco, “Multiscale fitting procedure using markov modulated poisson processes,” Telecommunication Systems, vol. 23, pp. 123-148, 2003.
C. Blondia and O. Casals, “Statistical multiplexing of vbr sources a matrix-analytic approach,” Performance Evaluation, vol. 16, pp. 5-20, 1992.
A. S. G. Casale and P. Cremonesi, “Compact markov modulated models for multi class trace fitting,” European Journal of Operational Research, vol. 255, pp. 822-833, 2016.
A. Banik and U. Gupta, “Analyzing the finite buffer batch arrival queue under markovian service process: Gi x/msp/1/n,” Proceedings of the 2nd international conference on performance evaluation methodologies and tools, vol. 15, pp. 146-160, 2007.
S. K. S. M. L. Chaudhry and A. Pacheco, “Analytically explicit results for the gi/c-msp/1/1 queueing system using roots,” Probability in the Engineering and Informational Sciences, vol. 26, pp. 221-244, 2012.
P. Bocharov, “Stationary distribution of a finite queue with recurrent flow and markovian service,” Autom. Remote Control, vol. 57, pp. 66-78, 1996.
C. D. P. P. Bocharov and S. Salerno, “The stationary characteristics of the g/msp/1/r queueing system,” Autom. Remote Control, vol. 64, pp. 288-301, 2003.
U. Gupta and A. Banik, “Complete analysis of finite and infinite buffer gi/msp/1 queue - a computational approach,” Operations Research Letters, vol. 35, pp. 273-280, 2002.
T. D. H. Okamura and K. Trivedi, “Markovian arrival process parameter estimation with group data,” IEEE/ACM Transactions on Networking, vol. 17, pp. 1326-1339, 2008.
U. C. G. S. K. Samanta and M. L. Chaudhry, “Analysis of stationary discrete-time i/dmsp/ 1 queue with finite and infinite buffers,” Journal of Operations Research, vol. 7, pp. 337-361, 2009.
S. K. Samanta, “Sojourn-time distribution of the gi/msp/1 queueing system,” Journal of Operations Research, vol. 52, pp. 756-770, 2015.
M. L. C. S. K. Samanta and A. Pacheco, “Analysis of bmap/msp/1 queue,” Methodology and Computing in Applied Probability, vol. 18, pp. 419-440, 2016.
S.-Y. W. Yung-Chung Wang, Jen-Hsiang Chou, “Loss pattern of dbmap/dmsp/1/k queue and its application in wireless local communications,” Applied Mathematical Modelling, vol. 35, pp. 1782-1797, 2011.
Y. Wang and C. Lu, “Loss behavior in space priority queue with batch markovian arrival process ˆa¿“ discrete-time case,” Performance Evaluation, vol. 41, pp. 269-293, 2001.
T. Ozawa, “Analysis of queues with markovian service processes,” Stochastic Models, vol. 41, pp. 391-413, 2004.
K. S. T. Hofkens and C. Blondia, “Transient analysis of the d-bmap/g/1 queue with an application to the dimensioning of a playout buffer for vbr video,” LNCS, vol. 3042, pp. 1338-1343, 2004.
A. D. B. M. L. Chaudhry and A. Pacheco, “A simple analysis of the batch arrival queue with infinite-buffer and markovian service process using roots method: Gi[x]/c-msp/1/1,” Annales in Operations Research, vol. 252, pp. 135-173, 2017.
M. K. S. Meier-Hellstern, “A fitting algorithm for markov-modulated poisson processes having two arrival rates,” European Journal of Operations Research, vol. 29, pp. 370-377, 1987.
M. F. Neuts, “Matrix geometric solutions in stochastic models: an algorithmic approach,” 1994.
Q. M. He, “Fundamentals of matrix-analytic methods,” 1987.
R. Bellman, “Introduction to matrix analysis,” 1997.
A. Graham, “Kronecker products and matrix calculus with applications,” 1981.
Downloads
Published
Issue
Section
License
Copyright (c) YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
