{'fraction_non_alphanumeric': 0.018884892086330936, 'fraction_numerical': 0.0035971223021582736, 'mean_word_length': 5.081967213114754, '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}}
Strict priority versus weighted fair queueing in switched Ethernet networks for time critical applications

In an industrial or technical context, some of the communications are strongly time-constrained. Our objective is to evaluate the service offered by a switched Ethernet architecture. We have chosen the network calculus theory because it gives a good representation of the exchanges and enables to determine the maximum end to end delays. Previous models implementing a strict priority policy presented in (J. -P. Georges et al., 2004) are improved in order to take into account the weighted fair queueing mechanism, which enables to balance the allocation of the network to the different traffics regarding the time contraints they have to respect. This paper also presents the new analytical formulas which upper bound the maximum end-to-end delays of the time-critical messages over the whole network. This enables to determine the optimal bandwith dedicated to both critical and best effort traffics. On an industrial scenario, strict priority and weighted fair queueing policies are finally compared.