{'fraction_non_alphanumeric': 0.015677491601343786, 'fraction_numerical': 0.0, 'mean_word_length': 5.340425531914893, '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}}
A deterministic loss model based analysis of CUBIC

Effective congestion control is one of the most critical issues in the utility efficiency of network resources. Because of better scalability and higher flexibility, CUBIC has become a widely deployed TCP congestion control protocol in high-speed long-delay networks and it is the current default algorithm implemented in the Linux kernel. However, the behavior of CUBIC is not fully understood. In this paper, a deterministic loss model has been proposed to analyze the characteristics of the concave region in the congestion avoidance state. This paper aims to provide deeper insight on the function and mechanism of CUBIC protocol. Through extensive mathematical analysis and simulation experimental study, this work verified that the CUBIC protocol effectively improved the bandwidth utility efficiency in high-speed long-delay networks.