On Truncation of the Matrix-Geometric Stationary Distributions

In this paper, we study queueing systems with an infinite and finite number of waiting places that can be modeled by a Quasi-Birth-and-Death process. We derive the conditions under which the stationary distribution for a loss system is a truncation of the stationary distribution of the Quasi-Birth-and-Death process and obtain the stationary distributions of both processes. We apply the obtained results to the analysis of a semi-open network in which a customer from an external queue replaces a customer leaving the system at the node from which the latter departed.

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

[2]  Barış Tan,et al.  Handbook of stochastic models and analysis of manufacturing system operations , 2013 .

[3]  Peter G. Taylor,et al.  Advances in Algorithmic Methods for Stochastic Models , 2000 .

[4]  Marcel F. Neuts.  Explicit Steady-State Solutions to Some Elementary Queueing Models , 1982, Oper. Res..

[5]  Mark S. Squillante,et al.  Quasi-Birth-and-Death Processes, Lattice Path Counting, and Hypergeometric Functions , 2009, Journal of Applied Probability.

[6]  Alan G. Konheim,et al.  Finite Capacity Queuing Systems with Applications in Computer Modeling , 1978, SIAM J. Comput..

[7]  Vaidyanathan Ramaswami,et al.  A logarithmic reduction algorithm for quasi-birth-death processes , 1993, Journal of Applied Probability.

[8]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[9]  J. George Shanthikumar,et al.  Design of manufacturing systems using queueing models , 1992, Queueing Syst. Theory Appl..

[10]  Mor Harchol-Balter,et al.  Clearing Analysis on Phases: Exact Limiting Probabilities for Skip-Free, Unidirectional, Quasi-Birth-Death Processes , 2015, 1503.05899.

[11]  Nail Akar,et al.  Finite and infinite QBD chains: a simple and unifying algorithmic approach , 1997, Proceedings of INFOCOM '97.

[12]  Benjamin Avi-Itzhak,et al.  Approximate Queuing Models for Multiprogramming Computer Systems , 1973, Oper. Res..

[13]  Qiang Ye,et al.  ON LATOUCHE–RAMASWAMI'S LOGARITHMIC REDUCTION ALGORITHM FOR QUASI-BIRTH-AND-DEATH PROCESSES , 2002 .

[14]  Jing Jia,et al.  Solving Semi-Open Queuing Networks , 2009, Oper. Res..

[15]  Xianhao Xu,et al.  Operating Policies in Robotic Compact Storage and Retrieval Systems , 2018, Transp. Sci..

[16]  Valeri Naoumov.  Matrix-Multiplicative Approach to Quasi-Birth-and-Death Processes Analysis , 1996 .

[17]  Debjit Roy,et al.  Solving semi-open queuing networks with time-varying arrivals: An application in container terminal landside operations , 2018, Eur. J. Oper. Res..

[18]  Charles J. Malmborg,et al.  Matrix-geometric solution for semi-open queuing network model of autonomous vehicle storage and retrieval system , 2014, Comput. Ind. Eng..

[19]  Myron Hlynka,et al.  Queueing Networks and Markov Chains (Modeling and Performance Evaluation With Computer Science Applications) , 2007, Technometrics.

[20]  Bruce Hajek,et al.  Birth-and-death processes on the integers with phases and general boundaries , 1982, Journal of Applied Probability.

[21]  Debjit Roy,et al.  Semi-open queuing networks: a review of stochastic models, solution methods and new research areas , 2016 .

[22]  Jiseung Kim,et al.  Analysis of a semi-open queueing network with Markovian arrival process , 2018, Perform. Evaluation.

[23]  Yang Liu,et al.  Modeling Automated Warehouses Using Semi-Open Queueing Networks , 2013 .