{'fraction_non_alphanumeric': 0.02564102564102564, 'fraction_numerical': 0.0, 'mean_word_length': 5.062111801242236, '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 binary-search based heuristic for extended Unsplittable Flow Problem

Routing a given set of flows with bandwidth requirements is a fundamental problem, which has been formulated as Unsplittable Flow Problem (UFP). One of the key issues in this formulation is that the bandwidth requirement is fixed for each flow. In practice, however, many applications (e.g., video-on-demand, backup and replication services) would greatly benefit from getting more bandwidths beyond the fixed minimum bandwidth requirement. To achieve this, we extended UFP such that bandwidth requirements will be given in a range. The challenge is now how to find paths and dynamically determine the allocated bandwidths such that we can provide more bandwidth to each flow while making sure that each flow gets at least the requested minimum amount. Like UFP, the extended UFP problem is also NP-Hard. Therefore, we propose two heuristics and demonstrate their efficiency using simulation.