{'fraction_non_alphanumeric': 0.023054755043227664, 'fraction_numerical': 0.0009606147934678194, 'mean_word_length': 5.058139534883721, '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}}
On efficient data distribution in multipath TCP

Nowadays, internet devices are becoming multi-homed. To utilise the multiple links, it is needed to use all the interfaces for transmission. Multipath TCP (MPTCP) is an effort that enables end points to distribute data over interfaces simultaneously. However, alternatively distributing data over links cannot utilise the network resources. Due to different characteristics of subflows, out-of-order data arrived at the receiver. This problem is more severe where the characteristics of each available link are different. This causes the receiver to send duplicate acknowledgement and this may induce the sender to infer data loss. This can degrade MPTCP performance because re-ordering is interpreted as sign of congestion. In this paper, we proposed an algorithm that predicts the data segment to be transmitted for a given subflow based on round-trip-time and present congestion state of the subflow. We implemented our proposed algorithm on ns-3 and noticed improvement over simple MPTCP.