{'fraction_non_alphanumeric': 0.02465331278890601, 'fraction_numerical': 0.0, 'mean_word_length': 5.2451923076923075, '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 the fast-convergence of delay-based load balancing over multipaths for dynamic traffic environments

Multipath routing enables the source exploit multiple available paths to transfer data to destination. This technique has drawn much attention by efficiently utilizing the bandwidths, preserving packets order and so on. However, these load balancing schemes are not for the delay-related issue and thus unsuited for the real-time applications. To deal with the delay-sensitive features, a load balancing scheme named Effective Delay-Controlled Load Distribution (E-DCLD) has been proposed to lower the end-to-end delay and the associating packet reordering possibility. Nevertheless, to compute the optimal load for each path, this scheme uses gradually approaching method that needs extra convergence rounds, and performs unsatisfactory especially when path status is unstable. In this paper, we propose a Convex optimization-Based Method (CBM) to effectively figure out the best load ratio for each path based on the model of E-DCLD. The proposed method could count out the result at once and overcome the low convergence rate problem of the original solution. Experimental results demonstrate that our solution could significantly decrease the end-to-end packet delay and total packet delay.