{'fraction_non_alphanumeric': 0.021505376344086023, 'fraction_numerical': 0.0, 'mean_word_length': 5.037037037037037, '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}}
Strategies for Traffic-Aware VM Migration

This paper investigates the opportunities and limitations of adaptive virtual machine (VM) migration to reduce communication costs in a virtualized environment. We propose a simple cost model, and present a class of Destination-Swap algorithms which are based on an aggressive collocation strategy (inspired by splay trees) and which maintain a minimal and local amount of per-node information to decide where to migrate a VM and how, thus, the algorithms react quickly to changes in the load. While our algorithms are applicable in any network, we in this paper will focus on the BCube data center topology.