A new approximation algorithm for virtual machine placement with resource constraints in multi cloud environment

Abstract

Virtual Machine placement problem with multiple resources is a complex optimization problem. With large size of instances, the given problems become NP hard problem. In this case techniques like integer programming and linear programming are not suitable. Only option left is to use heuristic-based approach. In this paper we have designed and developed new approximation algorithm to handle such hard instances in multi cloud environment. We have also proved that problem is NP Hard with its complexity by reduction. A new approximation algorithm is proposed and tested on real time multiple cloud providers azure and google with benchmark instances. All empirical result has shown that new proposed algorithm has surpassed all existing state-of-the-art techniques.