{'fraction_non_alphanumeric': 0.020444444444444446, 'fraction_numerical': 0.0, 'mean_word_length': 5.3977272727272725, '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}}
An Efficient Flow Detection and Scheduling Method in Data Center Networks

Nowdays Datacenter networks (DCNs) scale is rapidly increasing because of the widely deployment of cloud services. Thus, a large amount of data needs to be frequently interchanged among thousands of servers. In this environment, a key and challenging issue is to keep the traffic loadbalanced. In this letter, we propose a port forwarding load-balanced scheduling (PFLBS) approach for Fat-tree based DCNs. Firstly, we define a port-based source-routing addressing scheme, which simplifies the switch's functionality and makes the routing lookup operation unnecessary. Secondly, we apply the addressing scheme to the end hosts and formulate the PFLBS problem. PFLBS propose an efficient algorithm for multipath selection to obtain optimal paths and designs a trigger mechanism to split large flow implement scheduling data flows dynamically. The experiment results indicate that our PFLBS approach has better performance compared with the methods ECMP and Hedera and decreases the flow completion time and improve the average throughput significantly.