Title: the M/g/1-type Markov Chain with Restricted Transitions and Its Application to Queues with Batch Arrivals Short Title: the M/g/1-type Markov Chain with Restricted Transitions the M/g/1-type Markov Chain with Restricted Transitions and Its Application to Queues with Batch Arrivals

We consider M/G/1-type Markov chains where a transition that decreases the value of the level triggers the phase to a small subset of the phase space. We show how this structure—referred to as restricted downward transitions—can be exploited to speed up the computation of the stationary probability vector of the chain. To this end we define a new M/G/1-type Markov chain with a smaller block size, the G matrix of which is used to find the original chain's G matrix. This approach is then used to analyze the BMAP/PH/1 queue and the BMAP[2]/PH[2]/1 preemptive priority queue, yielding significant reductions in computation time.

[1]  Beatrice Meini,et al.  Numerical methods for structured Markov chains , 2005 .

[2]  Tom Burr,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 2001, Technometrics.

[3]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[4]  Beatrice Meini,et al.  Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation) , 2005 .

[5]  Guy Latouche,et al.  A general class of Markov processes with explicit matrix-geometric solutions , 1986 .

[6]  Marcel F. Neuts,et al.  Markov chains with marked transitions , 1998 .

[7]  Alan J. Laub,et al.  Solution of the Sylvester matrix equation AXBT + CXDT = E , 1992, TOMS.

[8]  B MolerCleve,et al.  Solution of the Sylvester matrix equation AXBT + CXDT = E , 1992 .

[9]  Marcel F. Neuts,et al.  A queuing model for meteor burst packet communication systems , 1989, IEEE Trans. Commun..

[10]  Benny Van Houdt,et al.  Exploiting Restricted Transitions in Quasi-Birth-and-Death Processes , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[11]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[12]  G. Golub,et al.  A Hessenberg-Schur method for the problem AX + XB= C , 1979 .

[13]  Attahiru Sule Alfa,et al.  On approximating higher order MAPs with MAPs of order two , 1999, Queueing Syst. Theory Appl..

[14]  A. Cumani.  On the canonical representation of homogeneous markov processes modelling failure - time distributions , 1982 .

[15]  V. Ramaswami.  A stable recursion for the steady state vector in markov chains of m/g/1 type , 1988 .

[16]  Ward Whitt,et al.  Approximating a Point Process by a Renewal Process, I: Two Basic Methods , 1982, Oper. Res..

[17]  Ward Whitt,et al.  Approximating a point process by a renewal process , 1981 .

[18]  Dario Bini,et al.  Solving nonlinear matrix equations arising in Tree-Like stochastic processes , 2003 .

[19]  Beatrice Meini,et al.  An improved FFT-based version of Ramaswami's formula , 1997 .

[20]  Beatrice Meini,et al.  On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems , 1996, SIAM J. Matrix Anal. Appl..

[21]  Benny Van Houdt,et al.  Quasi-birth-and-death processes with restricted transitions and its applications , 2011, Perform. Evaluation.

[22]  WhittWard.  Approximating a Point Process by a Renewal Process, I , 1982 .

[23]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[24]  A. Alfa.  Matrix‐geometric solution of discrete time MAP/PH/1 priority queue , 1998 .

[25]  Douglas R. Miller.  Computation of Steady-State Probabilities for M/M/1 Priority Queues , 1981, Oper. Res..

[26]  Bo Li,et al.  A matrix-analytic solution for the DBMAP/PH/1 priority queue , 2006, Queueing Syst. Theory Appl..

[27]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[28]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .