{'fraction_non_alphanumeric': 0.019279128248113998, 'fraction_numerical': 0.0, 'mean_word_length': 5.317460317460317, '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}}
TCP Throughput Analysis with Variable Packet Loss Probability for Improving Fairness among Long / Short-lived TCP Connections

Short-lived TCP connections, which send small documents, suffer from significant low throughput compared with long-lived TCP connections, which transmit large documents. It is because of an inherent nature of the ACK-based window flow control of TCP. In this paper, we focus on the unfairness problem of TCP connections transmitting differently sized documents. To improve the fairness, it is necessary to treat packets from short-lived TCP connections preferentially over those from long-lived TCP connections. For realizing it, we first introduce a new analysis approach to estimate the throughput of TCP connections when the packet loss probability of each transmitted packet from the same connection is different. Our analysis can give a better estimation of the TCP throughput than the existing analysises. Using the analysis results, we propose a new algorithm to improve the fairness, and investigate its effectiveness through simulation experiments. We show that our proposed algorithm can improve the fairness without degradation of the network utilization.