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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.