Sercon: Server Consolidation Algorithm using Live Migration of Virtual Machines for Green Computing
- 1 January 2011
- journal article
- research article
- Published by Medknow in IETE Technical Review
- Vol. 28 (3), 212
- https://doi.org/10.4103/0256-4602.81230
Abstract
Virtualization technologies changed the way data centers of enterprises utilize their server resources. Instead of using dedicated servers for each type of application, virtualization allows viewing resources as a pool of unified resources, thereby reducing complexity and easing manageability. Server consolidation technique, which deals with reducing the number of servers used by consolidating applications, is one of the main applications of virtualization in data centers. The latter technique helps to use computing resources more effectively and has many benefits, such as reducing costs of power, cooling and, hence, contributes to the Green IT initiative. In a dynamic data center environment, where applications encapsulated as virtual machines are mapped to and released from the nodes frequently, reducing the number of server nodes used can be achieved by migrating applications without stopping their services, the technology known as live migration. However, live migration is a costly operation; hence, how to perform periodic server consolidation operation in a migration-aware way is a challenging task. We propose server consolidation algorithm - Sercon, which not only minimizes the overall number of used servers, but also minimizes the number of migrations. We verify the feasibility of our algorithm along with showing its scalability by conducting experiments with eight different test cases.Keywords
This publication has 15 references indexed in Scilit:
- Resource pool management: Reactive versus proactive or let’s be friendsComputer Networks, 2009
- Energy-Efficient Cloud ComputingThe Computer Journal, 2009
- A break in the cloudsACM SIGCOMM Computer Communication Review, 2008
- pMapper: Power and Migration Cost Aware Application Placement in Virtualized SystemsLecture Notes in Computer Science, 2008
- Beyond Server ConsolidationQueue, 2008
- The Virtualization RealityQueue, 2006
- Algorithms for the variable sized bin packing problemEuropean Journal of Operational Research, 2003
- Lower bounds and algorithms for the 2-dimensional vector packing problemDiscrete Applied Mathematics, 2001
- On-line bin packing ? A restricted surveyMathematical Methods of Operations Research, 1995
- A branch-and-bound algorithm for the two-dimensional vector packing problemComputers & Operations Research, 1994