{'fraction_non_alphanumeric': 0.019548872180451128, 'fraction_numerical': 0.0, 'mean_word_length': 5.224299065420561, '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}}
Improving fairness in multi service multi layer networks

Fairness is an important but seldom addressed aspect in multi layer networks with traffic grooming capabilities. Often an excessive high blocking probability is observed for high capacity connections compared to small capacity connections. Similar, connections with more hops are more often blocked than those to the neighbor node. In this paper, we present two extensions of a bandwidth fairness algorithm that is based on a call admission control (CAC). First, this algorithm will be generalized for any class-based system. Second, an improvement is presented in order to reduce the performance drawbacks.