A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks (Q5953159)

The paper is concerned with multistation multiserver exponential reliable queueing networks. The authors analyze and provide a recursive algorithm for generating the transition matrix of a type of such queueing networks. By applying the proposed algorithm the transition matrix of a \(K\)-station network can be created for every \(K\). This process allows one to obtain the exact solution of the large sparse linear system by the use of the Gauss-Seidel method. From the solution of the linear system the throughput and other performance measures can be calculated. In the particular type of queueing networks that are studied items arrive at the first station according to a Poisson distribution and an operation is performed on each item by a server at each station. The processing times at each station are exponentially distributed. Buffers of nonidentical finite capacities are allowed between successive stations.