{'fraction_non_alphanumeric': 0.03344120819848975, 'fraction_numerical': 0.002157497303128371, 'mean_word_length': 4.987096774193549, '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 conservative scheme for distributed low-delay routing in MANETs

Delay-based routing is proved to improve the network's round-trip time without enhancing its throughput [1]. The reason is that optimising the end-to-end delay -as any load-based metric- creates route instability which results in packet reordering. This problem is detrimental for TCP. In the present work, we couple delay-based routing with a mechanism that locks, upon each node, the next-hop for each TCP flow, unless that hop becomes unavailable. The routes for future flows are proactively discovered by optimized link-state routing (OLSR) and reside in the node's routing table, so the proposed mechanism is fully distributed. Simulation experiments in static and mobile scenarios for small pedestrian networks show that the use of path-locking in conjunction with delay-based routing alleviates the route oscillations and improves the TCP's throughput1.