| 摘要 |
A method is implemented by a computing device to provide traffic-aware virtual machine (VM) placement onto physical servers of a data center where the placement takes incremental VM job arrival and physical server heterogeneity into consideration. The method forms a graph including a new VM node, an existing VM node, and an edge between the nodes, where the edge is assigned a weight that represents a traffic demand. The method marks the existing VM node as belonging to one of the physical servers, adds dummy VM nodes to the graph, adds pseudo VM nodes to the graph, connects nodes belonging to a same physical server using an infinite weight pseudo edge, runs a balanced minimum k-cut problem algorithm on the graph to thereby divide the graph into sub-graphs, and maps the new VM to one of the physical servers based on the division of sub-graphs. |
