 Next Article in Journal / Special Issue
On Two Interacting Markovian Queueing Systems
Previous Article in Journal
Statistical Solitons and Inequalities for Statistical Warped Product Submanifolds
Previous Article in Special Issue
Optimization of Queueing Model with Server Heating and Cooling
Article

# On Truncation of the Matrix-Geometric Stationary Distributions

1
Service Innovation Research Institute, 00120 Helsinki, Finland
2
Department of Applied Informatics and Probability, Peoples’ Friendship University of Russia (RUDN University), Miklukho-Maklaya St. 6, Moscow 117198, Russia
3
Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, Vavilov St. 44-2, Moscow 119333, Russia
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(9), 798; https://doi.org/10.3390/math7090798
Received: 30 July 2019 / Revised: 25 August 2019 / Accepted: 27 August 2019 / Published: 1 September 2019
(This article belongs to the Special Issue Stochastic Processes: Theory and Applications)

## Abstract

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. Introduction

Consider a queueing system with an infinite number of waiting places which may be modeled by a Quasi-Birth-and-Death (QBD) process $X ( t )$ on a state space $∪ l = 0 ∞ X l ,$ where $X 0 = { ( i , 0 ) , 1 ≤ i ≤ n + m }$ and $X l = { ( i , l ) , 1 ≤ i ≤ m }$, $l ≥ 1$. Here l represents the number of customers in the queue and $i$ represents the internal state of the system. The generator of the process $X ( t )$ has the block tri-diagonal form
$Q = [ Ν 0 Λ 0 0 0 0 ⋯ Μ 1 Ν 1 Λ 0 0 ⋯ 0 Μ Ν Λ 0 ⋯ 0 0 Μ Ν Λ ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ ]$
where $Ν 0$ is a square matrix of order n, the matrices $Λ$, $Ν$, $Μ$ and $Ν 1$ are square of order m, and the matrices $Λ 0$ and $Μ 1$ are rectangular of appropriate dimensions. We denote by $x$ the stationary probability vector associated with $Q$ and we partition it as $x = ( p , q 0 , q 1 , … )$, where $p$ is an n-vector, and $q l$, $l ≥ 0$, are m-vectors. We also define the generator $A = Λ + Ν + Μ$.
According to , the positive recurrent Markov chain $X ( t )$ has a modified matrix-geometric stationary probability vector,
where $R$, which is called the rate matrix, has the spectral radius $ρ < 1$ and is the minimal nonnegative solution of the matrix equation
$R 2 Μ + R Ν + Λ = 0 .$
Once $R$ is known, vectors $p$ and $q 0$ are obtained by solving the linear system
$p Ν 0 + q 0 Μ 1 = 0$
$p Λ 0 + q 0 ( Ν 1 + R Μ ) = 0$
with the normalizing condition
$p u + q 0 ( I − R ) − 1 u = 1 ,$
where $u$ is the column vector of all ones of appropriate size.
The rate matrix $R$ is usually computed via iterative algorithms [1,2,3,4] among which the fastest is the logarithmic reduction algorithm . Available methods for computation of the rate matrix are effective only for relatively small values of m. Exceptions are processes with off-diagonal blocks of a special type. If matrices $Λ$ or $Μ$ have rank one [5,6], or matrix $A$ is triangular [7,8], it is possible to find an explicit solution of Equation (3).
Now, consider a queueing system with $L ≥ 0$ waiting places, that can be modeled by a Markov chain $X L ( t )$ on a state space $∪ l = 0 L X l$ with a generator of the block tri-diagonal form
$Q L = [ Ν 0 Λ 0 0 0 ⋯ 0 Μ 1 Ν 1 Λ 0 ⋯ 0 0 Μ Ν ⋱ ⋱ ⋮ 0 0 ⋱ ⋱ Λ 0 ⋮ ⋮ ⋱ Μ Ν Λ 0 0 ⋯ 0 Μ Ν + Λ ] .$
The change in the lower diagonal block is due to the fact that if an arriving customer finds all waiting places occupied it is lost, but the internal state of the system changes in the same manner as if the customer were not lost.
We partition the stationary probability vector $x L$ associated with $Q L$ as $x L = ( p L , q L , 0 , q L , 1 , … , q L , L )$, where $p L$ is an n-vector, and $q L , l$, $0 ≤ l ≤ L ,$ are m-vectors. Solving finite QBD processes is more complicated than solving infinite processes [9,10,11]. If for some number s matrices $Λ$, $Ν$, $Μ$ satisfy $det ( s 2 Μ + s Ν + Λ ) ≠ 0$ then the stationary probability vector $x L$ can be expressed using two matrix-geometric terms as 
which require computation of the minimal nonnegative solutions of two matrix equations
The vectors $a L$, $b L$ and $p L$ can be found by solving the linear system
$p L Ν 0 + ( a L + b L S L ) Μ 1 = 0$
$p L Λ 0 + ( a L + b L S L ) Ν 1 + ( a L R + b L S L − 1 ) Μ = 0$
$( a L R L − 1 + b L S ) Λ + ( a L R L + b L ) ( Ν + Λ ) = 0$
and normalizing vector $x L$. The condition $det ( s 2 Μ + s Ν + Λ ) ≠ 0$ holds, for example, if the generator $A = Λ + Ν + Μ$ is irreducible and $π Λ u ≠ π Μ u$, where $π$ is the stationary probability vector of $A$ .
The stationary probability vector $x = ( p , q 0 , q 1 , … )$ of the generator (Equation (1)) satisfies the equation
$q l + 1 Μ + q l Ν + q l − 1 Λ = 0$
for all $l ≥ 0$. In the finite case the stationary probability vector $x L = ( p L , q L , 0 , q L , 1 , … , q L , L )$ also satisfies the equation
$q L , l + 1 Μ + q L , l Ν + q L , l − 1 Λ = 0$
for all $0 ≤ l < L$, but the boundary equation is different
$q L , L ( Ν + Λ ) + q L , L − 1 Λ = 0 .$
It is clear that if the rate matrix $R$ satisfies $R L + 1 Μ = R L Λ$ then the stationary distribution of $X L ( t )$ can be obtained by the truncation of the matrix-geometric stationary distribution (Equation (2)) of $X ( t )$ at the level of $l = L$. In turn, this is enough to fulfill the condition $R l + 1 Μ = R l Λ$ for some $l ≤ L .$ In this paper we study the properties of QBD processes with rate matrix $R$ satisfying $R Μ = Λ$. If it is so, then for any L the stationary distribution of the process $X L ( t )$ can be obtained by truncation of the stationary distribution of $X ( t )$.
In the next section we show when the rate matrix $R$ satisfies $R Μ = Λ$. In Section 3, we analyze the stationary distributions of infinite and finite QBD processes. In Section 4, we use the obtained results for solving a semi-open network in which customers from an external queue may only arrive to the node from which a departed customer left the system. We assume the process $X ( t )$ to be positive recurrent.
The following notation conventions are used throughout the article. Bold lowercase letters denote vectors, and bold capitalized letters denote matrices, $δ ( i , j ) = 1$ if $i = j$ and $δ ( i , j ) = 0$ otherwise; $I = [ δ ( i , j ) ]$ is the identity matrix; the ith component of vector $e i$ is equal to one and the others are zero.

## 2. Rate Matrices Satisfying $R Μ = Λ$

Here we derive the explicit solution of matrix Equation (3) obtained for a rate matrix satisfying $R Μ = Λ$.
Theorem 1.
Let$A$be an irreducible generator with stationary probability vector$π$, and let$R$be the minimal nonnegative solution of Equation (3). Then the matrix$R$satisfies the relation$R Μ = Λ$if and only if
$Λ = 1 π μ λ π Μ ,$
where $λ = Λ u$ and $μ = Μ u$. Moreover, the matrix $R$ and its spectral radius $η$ are given by
$R = 1 π μ λ π ,$
$η = π λ π μ .$
Proof.
Let matrix $R$ satisfy the relation $R Μ = Λ$. Then, Equation (3) can be rewritten as
$R A = R Λ + R Ν + Λ = R 2 Μ + R Ν + Λ = 0 .$
Since the generator $A$ is irreducible, each column of the matrix $R$ is proportional to the vector $π$. Therefore $R$ has the form $R = w π$, where $w$ is a row vector satisfying
$w π Μ = Λ .$
By postmultiplying Equation (15) by vector $u$ we obtain $w π μ = λ ,$ which implies Equations (11) and (12).
Let matrix $Λ$ be given by Equation (11). Since the process $X ( t )$ is positive recurrent, the matrix $N + R M$ is nonsingular  and we have
$R = − Λ ( N + R M ) − 1 .$
This relation implies that the rate matrix is of the form $R = λ ξ$, where $ξ$ is the unique solution of the equation
$ξ = − 1 π μ π Μ ( Ν + ξ λ Μ ) − 1 .$
It is easy to check that the vector
$ξ = 1 π μ π$
satisfies Equation (16). Therefore, the rate matrix and its maximum eigenvalue are given by Equations (12) and (13). This completes the proof of the theorem. □
Corollary 1.
Let matrices$Λ$,$Μ$,$Ν$have the block-diagonal form
$Λ = [ Λ 1 0 ⋯ 0 0 Λ 2 ⋱ ⋮ ⋮ ⋱ ⋱ 0 0 ⋯ 0 Λ k ] , Ν = [ Ν 1 0 ⋯ 0 0 Ν 2 ⋱ ⋮ ⋮ ⋱ ⋱ 0 0 ⋯ 0 Ν k ] , Μ = [ Μ 1 0 ⋯ 0 0 Μ 2 ⋱ ⋮ ⋮ ⋱ ⋱ 0 0 ⋯ 0 Μ k ] ,$
and suppose that $A i = Λ i + Ν i + Μ i$ is an irreducible generator with a stationary probability vector $π i$. Then the minimal nonnegative solution
$R = [ R 1 0 ⋯ 0 0 R 2 ⋱ ⋮ ⋮ ⋱ ⋱ 0 0 ⋯ 0 R k ]$
of Equation (3) satisfies the relation $R Μ = Λ$, if and only if
$Λ i = 1 π i μ i λ i π i Μ i , 1 ≤ i ≤ k ,$
where $λ i = Λ i u$ and $μ i = Μ i u$. The matrices $R i$ and their spectral radii $η i$ are given by
$R i = 1 π i μ i λ i π i ,$
$η i = π i λ i π i μ i .$
This Corollary 1 follows directly from Theorem 1 applied to each diagonal block of the matrices (17) and (18).

## 3. Truncation of the Stationary Distribution

Consider a queueing system with $L ≥ 0$ waiting places that can be modeled by a Markov chain $X L ( t )$ with a generator of the form (7) with the block-diagonal matrices $Λ$, $Μ$, $Ν$ as in Equation (17). We partition the stationary probability vector $x L$ corresponding to $Q L$ as $x L = ( p , q 0 , … , q L )$, where $p$ is an n-vector, and $q l$ is partitioned as $q l = ( q l , 1 , q l , 2 , … , q l , k )$, with $m i$-vectors $q l , i$, $1 ≤ i ≤ k ,$$0 ≤ l ≤ L$.
Theorem 2.
Let a generator$Q L$be irreducible, matrices$Λ$,$Μ$,$Ν$have the block-diagonal form (Equation (17)),$A i = Λ i + Ν i + Μ i$be an irreducible generator with the stationary probability vector$π i ,$the matrices$Λ i ,$$R i$be given by Equations (19) and (20) respectively, and vectors$a$and$b = ( b 1 , b 2 , … , b k )$satisfy the linear system
$a Ν 0 + b Μ 1 = 0 ,$
$a Λ 0 + b ( Ν 1 + Λ ) = 0 ,$
$a u + b u = 1 .$
Then the stationary probability vector of $Q L$ is given by
$p = c L a , q 0 , i = c L b i , q l , i = c L ρ i l − 1 b i λ i π i μ i π i , 1 ≤ l ≤ L , 1 ≤ i ≤ k ,$
where $c L$ is the normalization constant,
$c L = ( 1 + ∑ i = 1 k s L , i ) − 1 , s L , i = { b i λ i ( 1 − ρ i L ) π i μ i ( 1 − ρ i ) , ρ i ≠ 1 , L b i λ i π i μ i , ρ i = 1 .$
Proof.
Since the matrices $Λ i$ and $R i$ are given by Equations (19) and (20), under the Corollary 1 of Theorem 1, matrix (18) is the solution of Equation (3) and satisfies $R Μ = Λ$. It implies that vectors $p$ and $q l = ( q l , 1 , q l , 2 , … , q l , k )$ given by Equation (25) satisfy the following relations:
$p Ν 0 + q 0 Μ 1 = c L ( a Ν 0 + b Μ 1 ) = 0 ,$
$p Λ 0 + q 0 Ν 1 + q 1 Μ = c L ( a Λ 0 + b Ν 1 + b R Μ ) = c L ( a Λ 0 + b Ν 1 + b Λ ) = 0 ,$
$q l + 1 Μ + q l Ν + q l − 1 Λ = q l − 1 ( R 2 Μ + R Ν + Λ ) = 0 , 0 < l < L ,$
$q L ( Λ + Ν ) + q L − 1 Λ = q L − 1 ( R Λ + R Ν + Λ ) = q L − 1 ( R 2 Μ + R Ν + Λ ) = 0 .$
It follows that $x L = ( p , q 0 , … , q L )$ is the stationary probability vector of the generator $Q L .$ Power $R i l$ of the matrix $R i$ is given by
$R i l = η i l − 1 λ i π i π i μ i .$
Using this formula and equality (Equation (24)) we obtain the normalization constant (Equation (26)). This completes the proof of the theorem. □
Note that the vector $( a , b )$ in Equations (22)–(24) gives the stationary distribution of the Markov chain $X 0 ( t )$ which models a queueing system without waiting places, and the stationary distribution $x L$ of the Markov chain $X L ( t )$ depends on the number of waiting places L only via the normalizing constant $c L$. Similar results are valid for the infinite QBD process $X ( t )$ with generator $Q$ of the form (1).
Theorem 3.
Let generator$Q$be irreducible, matrices$Λ$,$Μ$,$Ν$have the block-diagonal form (17),$A i = Λ i + Ν i + Μ i$be an irreducible generator with stationary probability vector$π i ,$matrices$Λ i ,$$R i$be given by (19) and (20) respectively, and vectors$a$and$b = ( b 1 , b 2 , … , b k )$satisfy the linear system (22)–(24). Then process$X ( t )$is positive recurrent if and only if$π i λ i < π i μ i$for all$1 ≤ i ≤ k .$In this case the stationary probability vector of$Q$is given by
where$c$is the normalization constant,
$c = ( 1 + ∑ i = 1 k b i λ i π i μ i − π i λ i ) − 1 .$
Proof.
The proof of Equations (27) and (28) is similar to the proof of Equations (25) and (26). The spectral radius of the rate matrix $R$ is the maximum of the spectral radii if its diagonal blocks are given by Equation (21). Therefore, the process $X ( t )$ is positive recurrent if and only if $π i λ i < π i μ i$ for all $1 ≤ i ≤ k$. □
The following result is a direct consequence of Equation (25) for the stationary distribution of the processes $X L ( t )$ and of Equation (27) for the stationary distribution of the process $X ( t )$.
Corollary 2.
If the conditions of Theorem 2 hold and$π i λ i < π i μ i$for all$1 ≤ i ≤ k$then the stationary distributions of the processes$X L ( t )$can be obtained by truncation of the stationary distribution of the process$X ( t )$.

## 4. Semi-Open Networks with Replacement

Since the first papers [14,15] on semi-open networks appeared, the use of these models has become increasingly widespread [16,17,18]. However, the exact analysis even of the simplest network, with two exponential single-server nodes, Poisson arrival process, and an infinite queue, remains a difficult task . The semi-open networks with external queue are mainly analyzed by approximate methods and the matrix-geometric method [19,20,21,22,23].
Consider a semi-open network consisting of an internal network with v nodes and an external queue. The number of customers in the internal network cannot exceed N. If an arriving customer finds the internal network busy it waits in the external queue or is lost if the number of customers in the queue has reached its maximum value $L$. Such a network can be considered as a queuing system with N resource units. If all N resource units are occupied, the arriving customer waits in the external queue until a resource unit becomes available. Upon completion of its service in the internal network, the customer releases the occupied resource unit.
We consider semi-open networks in which the customers waiting in the external queue select a node for entering the internal network according to the following rule, which we call the replacement. If a customer leaves the system upon completing service at node i, then a customer from the external queue will start service also at node i, thus “replacing” the leaving customer. As a result, the number of customers in the external queue will decrease by one, but the number of customers at each node of the internal network remains unchanged. An example of a system in which only the replacement of customers leaving the system is possible is shown in Figure 1. It is a semi-open network with only one node where customers can complete service and through which waiting customers can enter the internal network.
Let the arrival process be Poisson with rate $λ$. The service rate $μ k i , i$ at node i depends on the number $k i$ of customers at this node: $μ 0 , i = 0$ and $μ k i , i > 0$ for $1 ≤ k i ≤ N .$ A customer entering the internal network is sent to node i with probability $a i$, $∑ i = 1 n a i = 1$. A customer completing service at node i will either require service at node j with a probability $q i , j$ or leave the system with probability $q i , 0 = 1 − ∑ j = 1 n q i , j$. The visit ratios $q i ,$ $i = 1 , 2 , … , v ,$ can be found as a solution of the linear system
and the nodes’ throughputs are given by $λ i = λ q i$, $i = 1 , 2 , … , v$. Summing both sides of Equation (1) over j, we obtain a useful relation
$∑ i = 1 n q i q i , 0 = 1 .$
A semi-open network can be modeled by a Markov chain $Y L ( t ) = ( y 0 ( t ) , y 1 ( t ) , … , y n ( t ) ) ,$ where $y 0 ( t )$ represents the number of customers in the system at time t, and $y j ( t )$, $1 ≤ j ≤ n$, represent the number of customers at node j of the internal network. The process $Y L ( t )$ has a state space $∪ l = 0 L Y l$ with
where
We assume that all states of the process $Y ( t )$ communicate and denote its stationary distribution as $θ l = ( θ l ( k ) )$, $( l , k ) ∈ Y l$, $0 ≤ l ≤ N + L$.
The generator of the process $Y ( t )$ has the block tri-diagonal form (Equation (18)) with the following nonzero transition rates
where
$μ ( k ) = ∑ i = 1 v μ k i , i q i , 0 .$
In Equation (8) the matrices $Λ$, $Μ$, $Ν$ are diagonal with elements $γ ( ( l , k ) , ( l + 1 , n ) ) = λ δ ( k , n )$, $γ ( ( l , k ) , ( l − 1 , n ) ) = μ ( k ) δ ( k , n )$, $γ ( ( l , k ) , ( l , n ) ) = − ( λ + μ ( k ) ) δ ( k , n )$ respectively. Therefore, the stationary distributions for the finite and infinite semi-open networks with replacement can be found using Theorems 2 and 3.
For a semi-open network without an external queue the closed form solution can be easily derived because there exists an equivalent closed network of capacity N. The equivalent network can be obtained by adding a single-server node 0 with an infinite queue and exponentially distributed service times with parameter $λ$ to the original network. Node 0 plays the role of the external environment of the original network. When a customer arrives to or departs from the original network, it departs from or arrives to node 0 in the equivalent network. The stationary distribution $x l = ( x l ( k ) )$, $k ∈ Z l$, $l = 0 , 1 , … , N$ of closed queueing networks with state-dependent service rates have a product form  and the solution $a = ( x 0 , x 1 , … , x N − 1 )$ and $b = x N$ of the linear system (Equations (19)–(21)) is given by
$G ( N ) = 1 + ∑ l = 1 N ∑ k ∈ X l ∏ i = 1 v λ i k i μ 1 , i μ 2 , i ⋯ μ k i , i .$
For closed queueing networks, there are several effective methods for computation of the normalization constant $G ( N )$ .
By virtue of Theorem 2 for semi-open network with replacement and a finite external queue, the stationary distribution of the process $Y L ( t )$ is given by
where
$ρ ( k ) = λ ∑ i = 1 v μ k i , i q i , 0 .$
It follows from Theorem 3 that a semi-open network with replacement and an infinite external queue is stable if and only if $ρ ( k ) < 1$ for all states $k ∈ Z N$. In this case, the stationary distribution of $Y ( t )$ is given by
$c L = ( 1 + ∑ k ∈ Z N x N ( k ) ρ ( k ) 1 − ρ ( k ) ) − 1 .$
Similarly, it is possible to analyze semi-open queuing networks partitioned into subnetworks. Each such subnetwork consists of a subset of nodes of the internal network. If a customer leaves the system, then a customer from the external queue will proceed with a certain probability to a node in the same subnetwork in which the customer leaving the system was served. The generator of the related QBD process has the matrices $Λ$ of the form of Equation (17). The results of this paper can be used if the diagonal blocks of $Λ$ satisfy relation (19).

## 5. Conclusions

We have studied the properties of QBD processes with the rate matrix $R$ satisfying $R Μ = Λ$, which guarantees that the stationary distribution of the finite QBD process is a truncation of the stationary distribution of the infinite QBD process. We have obtained the necessary and sufficient condition for the fulfillment of the equality $R Μ = Λ$ and have derived the formulae for the rate matrix and for the superdiagonal blocks of the process generator. These matrices have rank one, and therefore the stationary distribution and the performance parameters of QBD processes can be easily found. The results obtained have been applied to a semi-open network in which customers from the external queue can enter the internal network only through the node from which the departing customer left the system.

## Author Contributions

Conceptualization, V.A.N. and K.E.S.; methodology and validation, V.A.N.; review and editing, original draft preparation, examples, Y.V.G.; supervision and project administration, K.E.S.

## Funding

The publication has been supported by the Ministry of Education and Science of the Russian Federation (project No. 2.882.2017/4.6).

## Conflicts of Interest

The authors declare no conflict of interest.

## References

1. Neuts, M.F. Matrix-Geometric Solutions an Algorithmic Approach; The Johns Hopkins University Press: Baltimore, MD, USA, 1981. [Google Scholar]
2. Latouche, G.; Ramaswami, V. A logarithmic reduction algorithm for Quasi-Birth-Death processes. J. Appl. Probab. 1993, 30, 650–674. [Google Scholar] [CrossRef]
3. Meini, B. Solving QBD problems: The cyclic reduction algorithm versus the invariant subspace method. Adv. Perform. Anal. 1998, 1, 215–225. [Google Scholar]
4. Qiang, Y. On Latouche-Ramaswami’s logarithmic reduction algorithm for Quasi-Birth-and-Death processes. Stoch. Models 2001, 18, 449–467. [Google Scholar]
5. Neuts, M.F. Explicit steady-state solutions to some elementary queueing models. Oper. Res. 1982, 30, 480–489. [Google Scholar] [CrossRef]
6. Latouche, G.; Ramaswami, V. A general class of Markov processes with explicit matrix-geometric solutions. Oper. Res. 1986, 8, 209–218. [Google Scholar]
7. Leeuwaarden, J.S.H.; Squillante, M.; Winands, E. Quasi-birth-and-death processes, lattice path counting, and hypergeometric functions. J. Appl. Probab. 2009, 46, 507–520. [Google Scholar] [CrossRef]
8. Doroudi, S.; Fralix, B.; Harchol-Balter, M. Clearing analysis on phases: Exact limiting probabilities for skip-free, unidirectional, quasi-birth-death processes. Stoch. Syst. 2016, 6, 420–458. [Google Scholar] [CrossRef]
9. Hajek, B. Birth-and-Death Processes on the Integers with Phases and General Boundaries. J. Appl. Probab. 1982, 19, 488–499. [Google Scholar] [CrossRef]
10. Naumov, V. Modified Matrix-Geometric Solution for Finite QBD processes. In Advances in Algorithmic Methods for Stochastic Models; Latouche, G., Taylor, P., Eds.; Notable Publications: Neshanic Station, NJ, USA, 2000; pp. 257–264. [Google Scholar]
11. Akar, N.; Sohraby, K. Finite and infinite QBD chains: A simple and unifying algorithmic approach. In Proceedings of the INFOCOM ‘97, Kobe, Japan, 7–11 April 1997; Volume 3, pp. 1105–1113. [Google Scholar]
12. Naoumov, V. Matrix-multiplicative approach to quasi-birth-and-death processes analysis. In Matrix-Anal. Methods Stoch. Models; Alfa, A.S., Chakravarthy, S.R., Eds.; Marcel Dekker: New York, NY, USA, 1996; pp. 87–106. [Google Scholar]
13. Krieger, U.R.; Naumov, V. Analysis of a delay-loss system with a superimposed markovian arrival process and state dependent service times. In Numer. Solut. Markov Chain; Plateau, B., Stewart, W.J., Silva, M., Eds.; Prensas Universitarias de Zaragoza: Zaragoza, Spain, 1999. [Google Scholar]
14. Avi-Itzhak, B.; Heyman, D.P. Approximate Queuing Models for Multiprogramming Computer Systems. Oper. Res. 1973, 21, 1212–1230. [Google Scholar] [CrossRef]
15. Konheim, A.G.; Reiser, M. Finite Capacity Queuing Systems with Applications in Computer Modeling. SIAM J. Comput. 1978, 7, 210–229. [Google Scholar] [CrossRef]
16. Busacott, J.A.; Shanthikumar, J.G. Design of Manufacturing Systems Using Queueing Models. Queueing Syst. 1992, 12, 135–214. [Google Scholar] [CrossRef]
17. Cai, X.; Heragu, S.S.; Yang Liu, Y. Modeling Automated Warehouses Using Semi-Open Queueing Networks. In Handbook of Stochastic Models and Analysis of Manufacturing System Operations; Smith, J., Tan, B., Eds.; Springer: New York, NY, USA, 2003. [Google Scholar]
18. Zou, B.P.; de Koster, R.; Xu, X.H. Operating Policies in Robotic Compact Storage and Retrieval Systems. Transp. Sci. 2008, 52, 788–811. [Google Scholar] [CrossRef]
19. Jia, J.; Heragu, S.S. Solving Semi-Open Queuing Networks. Oper. Res. 2009, 57, 391–401. [Google Scholar] [CrossRef]
20. Roy, D. Semi-Open Queuing Networks: A Review of Stochastic Models, Solution Methods and New Research Areas. Int. J. Prod. Res. 2016, 54, 1735–1752. [Google Scholar] [CrossRef]
21. Ekren, B.Y.; Heragu, S.S.; Krishnamurthy, A.; Malmborg, C.J. Matrix-Geometric Solution for Semi-Open Queuing Network Model of Autonomous Vehicle Storage and Retrieval System. Comput. Ind. Eng. 2014, 68, 78–86. [Google Scholar] [CrossRef]
22. Dhingraa, V.; Kumawat, G.L.; Roy, D.; de Koster, R. Solving Semi-open Queuing Networks with Time-varying Arrivals: An Application in Container Terminal Landside Operations. Eur. J. Oper. Res. 2018, 267, 855–876. [Google Scholar] [CrossRef]
23. Kim, J.; Dudin, A.; Dudin, S.; Kim, C. Analysis of a semi-open queueing network with Markovian arrival process. Perform. Eval. 2018, 120, 1–19. [Google Scholar] [CrossRef]
24. Baskett, F.; Chandy, K.M.; Muntz, A.A.; Palacios, F.G. Open, closed, and mixed networks of queues with different classes of customers. J. ACM 1975, 22, 248–260. [Google Scholar] [CrossRef]
25. Bolch, G.; Greiner, S.; de Meer, H.; Trivedi, K.S. Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications, 2nd ed.; John Wiley & Sons: Hoboken, NJ, USA, 2006. [Google Scholar]
Figure 1. Internal network with a single node in which customers start and finish servicing.
Figure 1. Internal network with a single node in which customers start and finish servicing. 