Joint VM Placement and Routing for Data Center Traffic Engineering
Today's data centers need efficient traffic management to improve resource utilization in their networks. In this paper, the authors 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, they 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.