{'fraction_non_alphanumeric': 0.018276762402088774, 'fraction_numerical': 0.0, 'mean_word_length': 5.607758620689655, '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}}
Bandwidth Reservation for Data Transfers through Multiple Disjoint Paths of Dynamic HPNs

Bandwidth reservation was initially designed to provide QoS for real-time multimedia applications, and has been widely used since because of its proved high efficiency and effectiveness. It was recently started being used for big data transfers in high-performance networks from the data generation center to remotely located collaborating sites for data storage, mining and analysis. Most existing work on big data transfer using bandwidth reservation service focuses on addressing various data transfer problems on one or two network paths. In this paper, we study three important problems regarding data transfers using bandwidth reservation through multiple (node-and edge-)disjoint paths in dynamic high-performance networks: (i) achieve the earliest completion time for a given data transfer request through multiple variable disjoint paths, (ii) achieve the earliest completion time for a given data transfer request through multiple fixed disjoint paths with fixed bandwidths, and (iii) achieve the minimum number of fixed disjoint paths with fixed bandwidths to finish the given data transfer by its deadline. We prove all of these problems to be NP-complete and then propose one heuristic algorithm for each. We compare the heuristic algorithms with existing scheduling algorithms, and conduct extensive simulations. The simulation results show that our proposed heuristic algorithms have much better overall scheduling performance.