Joint VM placement and routing for data center traffic engineering
Authors:
Top Cited Papers
- 1 March 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 2876-2880
Abstract
Today's data centers need efficient traffic management to improve resource utilization in their networks. In this work, we study a joint tenant (e.g., server or virtual machine) placement and routing problem to minimize traffic costs. These two complementary degrees of freedom-placement and routing-are mutually-dependent, however, are often optimized separately in today's data centers. Leveraging and expanding the technique of Markov approximation, we propose an efficient online algorithm in a dynamic environment under changing traffic loads. The algorithm requires a very small number of virtual machine migrations and is easy to implement in practice. Performance evaluation that employs the real data center traffic traces under a spectrum of elephant and mice flows, demonstrates a consistent and significant improvement over the benchmark achieved by common heuristics.Keywords
This publication has 7 references indexed in Scilit:
- Killer Fabrics for Scalable Datacenters2010
- Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement2010
- Markov Approximation for Combinatorial Network Optimization2010
- PortLand2009
- Floodless in seattle2008
- Xen and the art of virtualization2003
- Internet traffic engineering by optimizing OSPF weights2002