Performance Measures of State Dependent MMPP/M/1 Queue

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    In this research work we are concerned with single unit server queue  queue with Markov Modulated process in Poisson fashion and the service time follow exponential distribution. The system is framed as a state dependent with the arrival process as Markov Modulated input and service is rendered by a single server with variation in service rate based on the intensity of service state of the system. The rate matrix that is essential to compute the stationary probability vector is obtained and various performance measures are computed using matrix method.


  • Keywords


    Single server, Markov Modulated Poisson process (MMPP), quasi-birth-death, matrix geometric method, stationary vector, performance analysis.

  • References


      [1] Baumann H & Sandmann W(2010), Numerical solution of Level Dependent Quasi -Birth and Death Process, Proceedings of the International Conference on Computational Science, ICCS, Procedia Computer Science, 1: 1555-1563.

      [2] Bright L & Taylor PG (1995). Calculating the equilibrium distribution in level dependent quasi-birth-and –death process, Stochastic Models 11(3): 497-525.

      [3] Delasay M, Ingolfsson A & Kolfal B(2016), Modeling load and overwork effects in queuing systems with adaptive service rates, Operations Research 31.

      [4] Ferng HW & Chang JF (2001), Connection wise end to end performance analysis of queuing networks with MMPP inputs, Performance Evaluation 43, 39-62.

      [5] He Q.M.(2014), Fundamentals of Matrix-Analytic Methods, Springer, New York.

      [6] Kharoufeh JP(2011), Level-dependent quasi-birth-and-death processes. In J. Cochran, A. Cox, P. Keskinocak, J.P. Kharoufeh, and J.C. Smith, editors, Wiley Encyclopaedia of Operations Research and Management Science, Hoboken, NJ, John Wiley & Sons, Inc.

      [7] Kroese D.P, Scheinhardt W.R.W & Taylor P.G(2004), Spectral properties of the tandem Jackson network seen as a quasi-birth and death process, Annals of Applied Probability 14, 2057-2089.

      [8] Latouche G & Ramaswami V(1999), Introduction to Matrix Analytic Methods in Stochastic Modelling, ASA-SIAM Series on Statistics and Applied Probability, SIAM, Philadelphia, PA.

      [9] Li X, He Q.M & Alfa AS(2017), Optimal Control of State-Dependent Service Rates in a MAP/M/1 Queue. IEEE Transactions of Automatic Control 62 (10), 4965 - 4979.

      [10] Madan KC(2000), An M/G/1 queue with second optional service, Queuing Systems 34, 37-48.

      [11] Hellstern M.K (1989) The Analysis of a queue arising in overflow models, IEEE Trans. Communications, 37, 367-372.

      [12] Fischer W & Hellstern M.K(1992), The Markov-modulated Poisson process (MMPP) cook book. Performance Evaluation 18(2), 149-171.

      [13] Neuts M.F(1979), A versatile Markovian point process. Journal of Applied Probability, 16: 764-779.

      [14] Neuts MF(1989), Matrix Geometric Solutions in Stochastic Models, John Hopkins, Baltimore, Marcel Dekker, New York.

      [15] Oliver C & Walrand J(1994), On the existence of finite-dimensional filters for Markov-modulated traffic. Journal of Applied Probability 31, 515–525.

      [16] Phung-Duc T, Masuyama H, Kasahara S & Takahashi Y( 2013), A Matrix Continued Fraction Approach to Multi server Retrial Queues, Annals of Operations Research 202(1), 161—183.

      [17] Ramaswami V & Taylor PG (1996). Some properties of the rate operators in level dependent quasi-birth-and-death processes with a countable number of phases. Stoch Models 12,143–164

      [18] Scott S.L & Smyth P(2003), The Markov Modulated Poisson Process and Markov Poisson Cascade with Applications to Web Traffic Modeling. Bayesian Statistics 7. Oxford University Press.

      [19] Ye J & Li SQ (1994), Folding algorithm: A computational method for finite QBD processes with level dependent transitions. IEEE Trans. Commun 42, 625-639.


 

View

Download

Article ID: 26632
 
DOI: 10.14419/ijet.v7i4.10.26632




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.