http://popups.lib.uliege.be/1373-5411/index.php?id=1835 Publications of Auteurs Nikolai K. Krivulin fr 0 http://popups.lib.uliege.be/1373-5411/index.php?id=1834 We present a new approach to get bounds on the service cycle time in acyclic forkjoin queueing networks. The approach is based on (max,+)-algebra representation of network dynamics and involves analysis of limiting behaviour of a product of random matrices. As a result, a new upper bound on the cycle time is established which takes into consideration the network topology. Wed, 17 Jul 2024 10:13:10 +0200 Wed, 17 Jul 2024 10:13:21 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=1834