References
Facsimile [PDF, 6.0M]

Evaluation of Bounds on Service Cycle Timesin Acyclic Fork-Join Queueing Networks

Nikolai K. Krivulin

p. 94-109

    Abstract

    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.

    Text

    Download Facsimile [PDF, 6.0M]

    References

    Bibliographical reference

    Nikolai K. Krivulin, « Evaluation of Bounds on Service Cycle Timesin Acyclic Fork-Join Queueing Networks », CASYS, 9 | 2001, 94-109.

    Electronic reference

    Nikolai K. Krivulin, « Evaluation of Bounds on Service Cycle Timesin Acyclic Fork-Join Queueing Networks », CASYS [Online], 9 | 2001, Online since 17 July 2024, connection on 10 November 2024. URL : http://popups.lib.uliege.be/1373-5411/index.php?id=1834

    Author

    Nikolai K. Krivulin

    School of Management

    St.Petersburg State University

    16 Dekabristov Lane, St.Petersburg, 198904 Russia

    Copyright

    CC BY-SA 4.0 Deed