{'fraction_non_alphanumeric': 0.022367194780987885, 'fraction_numerical': 0.0065237651444548, 'mean_word_length': 5.670807453416149, '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}}
Calantha: Content distribution across geo-distributed datacenters

Large cloud service providers often replicate data to multiple geographically distributed datacenters for availability and service quality purposes. The enormous amount of data needed to be shuffled among datacenters call for efficient schemes to maximally exploit the capacity of the inter-datacenter networks. In this paper, we propose Calantha, a new rate allocation scheme that improves the reliability and operability of content distribution across geo-distributed datacenters, without sacrificing capacity utilization and max-min fairness among competing sessions. Calantha leverages hop-constrained spanning tree to enhance the reliability of inter-datacenter links. A novel approximation algorithm is proposed to solve the rate allocation problem in polynomial time and achieve α-optimal approximation. Our simulation results have shown that we can reduce the number of spanning trees by 44.5%, as well as has 2.7% more average capacity utilization and 1.0% less minimum spanning tree calculations.