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

M. I. Vidalis, H. T. Papadopoulos

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

This paper is concerned with reliable multistation series queueing networks. 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. Every station is allowed to have more than one server with the same characteristics. The processing times at each station are exponentially distributed. Buffers of nonidentical finite capacities are allowed between successive stations. The structure of the transition matrices of these specific type of queueing networks is examined and a recursive algorithm is developed for generating them. The transition matrices are blockstructured and very sparse. By applying the proposed algorithm the transition matrix of a K-station network can be created for any 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 culculated.

Original languageEnglish
Pages (from-to)853-883
Number of pages31
JournalComputers and Operations Research
Volume28
Issue number9
DOIs
Publication statusPublished - Aug 1 2001

Keywords

  • Blocking phenomenon
  • Finite queues
  • Large sparse matrices
  • Markov chains
  • Multistation multiserver queueing networks
  • Numerical solution
  • Quasi-birth-death processes

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks'. Together they form a unique fingerprint.

Cite this