Algebraic modelling and performance evaluation of acyclic fork-join queueing networks

Abstract

Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join queueing networks are derived using a (max,+)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.

19 pages, 2 figures, 3 tables

References in corpus (3)

• A max-algebra approach to modeling and simulation of tandem queueing systems
• Max-plus algebra models of queueing networks
• The max-plus algebra approach in modelling of queueing networks

Cited by in corpus (2)

• Modeling and performance evaluation of computer systems security operation
• Products of random matrices and queueing system performance evaluation