{'fraction_non_alphanumeric': 0.02356020942408377, 'fraction_numerical': 0.0, 'mean_word_length': 5.133689839572193, '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 New Multi-Path Routing Methodology Based on Logit Type Assignment

We present a new multi-path routing methodology called MLB-routing based on multinomial logit model, which is well known as the random utility theory. The key concept of the study is to incorporate multiple paths from same origin to desti- nation, and distribute packets followed by the multinomial logit type probability. Since MLB-routing is pure multi-path routing, it reduce the severe convergence to same links and increases the bandwidth utilization in the network. Compared to the existing multi-path routing schemes that select pre-determined alternate paths, the proposed method can dynamically distribute packets to every possible paths and thus is more efficient than them. Furthermore, it should be mentioned that this methodology could be implemented as both link-state protocol and distance-vector protocol. Therefore, it has enough affinity for present Internet mechanism. Using simulations, we have also shown that this methodology produces more efficient use of network and causes significant improvements in end-to-end delays and jitter times. I. INTRODUCTION