Resource allocation in cloud using simulated annealing

摘要

One of the major problems in the domain of cloud computing is to allocate requests to resources maintaining high resource utilization. Many researchers have used heuristic algorithms, statistical methods, stochastic knapsack problem, and soft computing techniques to solve this problem. In this paper, we have utilized a variation of multi dimensional (multi parameter) bin packing to model the problem. We have also presented an efficient resource allocation algorithm using simulated annealing. Our approach can be generalized to solve resource allocation problem in multiple layers of cloud computing. Furthermore, we have carried out experiments to illustrate efficiency of our algorithm with respect to commonly used First Come First Serve (FCFS) resource allocation method.