Research Article
Optimized Virtual Machine Placement with Traffic-Aware Balancing in Data Center Networks
Algorithm 3
Greedy Based Placement (GBP).
| Input: : Set of bandwidth requirements of VMs of all requests; | | : Set of cumulative bandwidth occupancy of the uplinks of all ToR switches; | | : Set of cumulative numbers of VMs under ToR switches | | : Maximum bandwidth capacity of a uplink of ToR switch; | | : Maximum number of VMs under a ToR switch. | | Output: Virtual Machine Placement Schema | | () , , | | () , | | () , | | () | | () | | () for to do | | () for to do | | () for to do | | () while && do | | () place VM of request under ToR switches in the ToR switch order | | () end while | | () end for | | () end for | | () end for |
|