Shadow-Routing Based Dynamic Algorithms for Virtual Machine Placement in a Network Cloud

We consider a <italic>shadow routing</italic> based approach to the problem of real-time adaptive placement of virtual machines (VM) in large data centers (DC) within a network cloud. Such placement in particular has to respect <italic>vector packing</italic> constraints on the allocation of VMs to host physical machines (PM) within a DC, because each PM can potentially serve multiple VMs simultaneously. Shadow routing is attractive in that it allows a large variety of system objectives and/or constraints to be treated within a common framework (as long as the underlying optimization problem is convex). Perhaps even more attractive feature is that the corresponding algorithm is very simple to implement, it runs continuously, and adapts automatically to changes in the VM demand rates, changes in system parameters, etc., without the need to re-solve the underlying optimization problem “from scratch”. In this paper we focus on the <italic>min-max-DC-load</italic> problem. Namely, we propose a combined VM-to-DC routing and VM-to-PM assignment algorithm, referred to as <italic>Shadow scheme</italic>, which minimizes the maximum of appropriately defined DC utilizations. We prove that the Shadow scheme is asymptotically optimal (as one of its parameters goes to <inline-formula><tex-math notation="LaTeX">$0$</tex-math><alternatives> <inline-graphic xlink:href="guo-ieq1-2464795.gif"/></alternatives></inline-formula>). Simulation confirms good performance and high adaptivity of the algorithm. Favorable performance is also demonstrated in comparison with a baseline algorithm based on VMware implementation <xref ref-type="bibr" rid="ref7">[7]</xref> , <xref ref-type="bibr" rid="ref8">[8]</xref> . We also propose a simplified – “more distributed” – version of the Shadow scheme, which performs almost as well in simulations.