{'fraction_non_alphanumeric': 0.01791713325867861, 'fraction_numerical': 0.0, 'mean_word_length': 5.431654676258993, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Operational analysis of multiclass queueing networks

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.