Simple bounds on the mean cycle time in acyclic queueing networks

Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join networks are derived using the (max,+)-algebra approach.

Original language	English
Title of host publication	Proceedings of the 3rd St. Petersburg Workshop on Simulation, St. Petersburg, June 28 July – 3, 1998
Subtitle of host publication	Материалы 3-го Санкт-Петербургского семинара по моделированию, Санкт-Петербург, 28 июня – 3 июля 1998 г.
Editors	S. M. Ermakov, Y. N. Kashtanov, V. B. Melas
Place of Publication	Санкт-Петербург
Pages	331-337
State	Published - 1998
Event	3rd St. Petersburg Workshop on Simulation - St. Petersburg, Russian Federation Duration: 28 Jun 1998 → 3 Jul 1998 Conference number: 3

Conference	3rd St. Petersburg Workshop on Simulation
Country/Territory	Russian Federation
City	St. Petersburg
Period	28/06/98 → 3/07/98

ID: 4409888