{'fraction_non_alphanumeric': 0.017699115044247787, 'fraction_numerical': 0.0, 'mean_word_length': 5.111111111111111, '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}}
Access network dimensioning for elastic traffic based on flow-level QoS

Abstract: Network dimensioning for circuit switched networks has long been a well understood problem. However, dimensioning for data traffic, which is by nature elastic, is still an area that is not very well developed. Some work has been recently published addressing data network dimensioning and the present paper presents a survey on these. In our opinion, robustness of the used network models, forming the foundation of any dimensioning methods, is the key issue. Therefore, in this paper we propose the use of models based on the notion of balanced fairness. Dimensioning is important for example in access networks and these models allow simple and explicit evaluation of the performance of tree type access networks. We define the dimensioning problem as an optimization task where the link capacities are chosen such that costs are minimized subject to per-flow constraints on the minimum flow-level throughput. The approach is illustrated through various numerical examples. Network dimensioning for circuit switched networks has long been a well understood problem. However, dimensioning for data traffic, which is by nature elastic, is still an area that is not very well developed. Some work has been recently published addressing data network dimensioning and the present paper presents a survey on these. In our opinion, robustness of the used network models, forming the foundation of any dimensioning methods, is the key issue. Therefore, in this paper we propose the use of models based on the notion of balanced fairness. Dimensioning is important for example in access networks and these models allow simple and explicit evaluation of the performance of tree type access networks. We define the dimensioning problem as an optimization task where the link capacities are chosen such that costs are minimized subject to per-flow constraints on the minimum flow-level throughput. The approach is illustrated through various numerical examples.