Abstract
Operational analysis is an alternative to the stochastic analysis of queueing networks. It consists in analyzing the behaviour of a queueing network during a finite period of time. Operational analysis has contributed to explain the robustness of productform queueing network models. However, previous results were only pertaining to single-class networks. In this paper, we present an operational analysis of queueing networks with several classes of customers. Operational variables which characterize the behaviour of the queueing network are defined. We show that under some assumptions pertaining to the behaviour of the system, the queueing network has a product-form solution. Furthermore, if an assumption called homogeneous behaviour is satisfied, then the product-form solution is similar to the one provided by the BCMP theorem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
