{'fraction_non_alphanumeric': 0.012583271650629163, 'fraction_numerical': 0.0, 'mean_word_length': 4.827586206896552, '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}}
Distributed path selection (DPS) a traffic engineering protocol for IP-networks

The path selection strategy of an autonomous system (AS) has got a strong impact on the latency of packets travelling through the AS and the throughput of the underlying network. In theoretical analysis it has been shown for a simple load balancing approach that it can achieve a near optimal packet throughput even in the case of a dynamically changing network and for adversarial packet injections. Similar results have not been shown for any other protocol. The drawbacks of this load balancing approach are that it requires a large amount of information that has to be spread among the network, that it does not detect the drop out of nodes, and that it requires a complex buffer management. In this paper we examine the new routing protocol DPS (distributed path selection) that is based on this simple load balancing approach. DPS overcomes its restrictions by the use of new protocol enhancements and is able to transfer the optimal properties of the load balancing approach into a routing protocol. Comparing DPS with OSPF and RIP by simulation, we show that DPS is able to significantly improve the properties of the path system by considering the network topology as well as the traffic pattern while calculating the path system in a reasonable amount of time.