A convolution algorithm for product-form queueing networks with blocking

Research paper by S. Balsamo, M.C. Clò

Indexed on: 01 Jan '98Published on: 01 Jan '98Published in: Annals of Operations Research


Queueing network models with finite capacity and blocking can be used to represent various systems with finite resources, including communication and computer systems, as well as production and manufacturing systems, to evaluate their performance. Various blocking types have been defined to represent various system behaviors. Queueing networks with blocking show a product-form solution under special constraints. We present a convolution algorithm for the class of product-form closed network models with blocking to evaluate queue length distribution and average performance indices. As a consequence, this class of networks can be analysed with a polynomial time computational complexity.