Bounds on mean cycle time in acyclic fork-join queueing networks

Abstract

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

The 4th International Workshop on Discrete Event Systems (WODES'98), University of Cagliary, Cagliari, Sardinia, Italy, August 26-28, 1998

References in corpus (1)

• Max-plus algebra models of queueing networks

Cited by in corpus (1)

• On evaluation of the mean service cycle time in tandem queueing systems