• Krishnapriya S
• Sumathi D

One of the main features of cloud computing is automatic scalability of resource usage. There are web applications in which their usage changes from time to time. Application demand satisfaction depends on the underlying server capacity and the count of the application instances that are currently running on the servers. When the application demand is more, resource availability also needs to be increased to ensure requests satisfaction. Over provisioning of resources to handle peak load may cause some resources to lie idle during low demand. Automatic scaling of resources ensures better customer satisfaction during peak usage time by allocating more resources and scales down the resources when not needed. The scaling up and down of resource demands can be considered as item arrival and departure in bin packing algorithm. In this paper we are reviewing a few optimized versions of original bin packing problem. We have performed a comparison on the advantages and limitations of these bin packing problems when they are used for auto scaling of resources in cloud computing.

Cloud Computing, resource auto scaling, online and offline algorithms, bin packing problem

"A Review on Bin Packing Algorithm for Resource Auto Scaling", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.2, Issue 2, page no.235-238, February-2015, Available :http://www.jetir.org/papers/JETIR1502013.pdf

"A Review on Bin Packing Algorithm for Resource Auto Scaling", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.2, Issue 2, page no. pp235-238, February-2015, Available at : http://www.jetir.org/papers/JETIR1502013.pdf