{'fraction_non_alphanumeric': 0.021621621621621623, 'fraction_numerical': 0.016216216216216217, 'mean_word_length': 4.898089171974522, '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}}
Fair and Efficient TCP Access in IEEE 802.11 WLANs

We illustrate the transport layer unfairness problem in the IEEE 802.11 wireless local area networks (WLANs). We propose a novel and simple analytical model to calculate the per-flow congestion window limit that provides fair TCP access in a wired/wireless scenario where the wireless hop is an 802.11 link. The proposed analysis is unique in that it considers the effects of varying number of uplink and downlink TCP flows, varying round trip times (RTTs) of TCP connections, and the use of delayed TCP acknowledgment (ACK) mechanism. The comparison with simulation results validates the accuracy of the analytical estimations on the congestion window limit. When the TCP connections use the congestion window limits calculated from the proposed model, not only fair access can be provisioned, but also the channel can be utilized efficiently in a wide range of scenarios.