Self-adjusting binary search trees
Journal of the ACM (JACM)
BCube: a high performance, server-centric network architecture for modular data centers
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
ElasticTree: saving energy in data center networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Topology-aware VM migration in bandwidth oversubscribed datacenter networks
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Locally Self-Adjusting Tree Networks
IPDPS '13 Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing
| Hi-index | 0.00 |
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.