Consolidating virtual machines with dynamic bandwidth demand in data centers

Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation scheme requires that VMs are packed tightly, yet receive resources commensurate with their demands. However, measurements from production data centers show that the network bandwidth demands of VMs are dynamic, making it difficult to characterize the demands by a fixed value and to apply traditional consolidation schemes. In this work, we formulate the VM consolidation into a Stochastic Bin Packing problem and propose an online packing algorithm by which the number of servers required is within equation of the optimum for any ∈ > 0. The result can be improved to within equation of the optimum in a special case. In addition, we use numerical experiments to evaluate the proposed consolidation algorithm and observe 30% server reduction compared to several benchmark algorithms.

[1]  János Csirik.  An on-line algorithm for variable-sized bin packing , 2004, Acta Informatica.

[2]  Vasileios Pappas,et al.  Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement , 2010, 2010 Proceedings IEEE INFOCOM.

[3]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[4]  Steven S. Seiden.  An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing , 2001, SIAM J. Discret. Math..

[5]  Sameep Mehta,et al.  ReCon: A tool to Recommend dynamic server Consolidation in multi-cluster data centers , 2008, NOMS 2008 - 2008 IEEE Network Operations and Management Symposium.

[6]  Guochuan Zhang,et al.  On Variable-Sized Bin Packing , 2007 .

[7]  Steven S. Seiden,et al.  An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing , 2000, SIAM J. Discret. Math..

[8]  Michael A. Langston,et al.  A Storage-Size Selection Problem , 1984, Inf. Process. Lett..

[9]  Donna J. Brown,et al.  A Lower Bound for On-Line One-Dimensional Bin Packing Algorithms. , 1979 .

[10]  D. T. Lee,et al.  A simple on-line bin-packing algorithm , 1985, JACM.

[11]  Andrzej Kochut,et al.  Dynamic Placement of Virtual Machines for Managing SLA Violations , 2007, 2007 10th IFIP/IEEE International Symposium on Integrated Network Management.

[12]  Yasuhiro Ajiro,et al.  Improving Packing Algorithms for Server Consolidation , 2007, Int. CMG Conference.

[13]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[14]  Guochuan Zhang,et al.  Worst-Case analysis of the FFH algorithm for online variable-sized bin packing , 1996, Computing.

[15]  D. K. Friesen,et al.  Variable Sized Bin Packing , 1986, SIAM J. Comput..

[16]  Frank M. Liang.  A Lower Bound for On-Line Bin Packing , 1980, Inf. Process. Lett..

[17]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[18]  Ashish Goel,et al.  Stochastic load balancing and related problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[19]  György Dósa,et al.  The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9 , 2007, ESCAPE.

[20]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[21]  Ming Zhang,et al.  Understanding data center traffic characteristics , 2010, CCRV.

[22]  M. Yue,et al.  A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm , 1991 .

[23]  Yuval Rabani,et al.  Allocating bandwidth for bursty connections , 1997, STOC '97.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  David S. Johnson,et al.  A 71/60 theorem for bin packing , 1985, J. Complex..

[26]  Michael A. Langston,et al.  Online variable-sized bin packing , 1989, Discret. Appl. Math..

[27]  Arun Kumar,et al.  Stream-Packing: Resource Allocation in Web Server Farms with a QoS Guarantee , 2001, HiPC.

[28]  Guochuan Zhang,et al.  Bounded Space On-Line Variable-Sized Bin Packing , 1997, Acta Cybern..

[29]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[30]  Albert G. Greenberg,et al.  The nature of data center traffic: measurements & analysis , 2009, IMC '09.

[31]  Vipin Kumar,et al.  Multi-capacity bin packing algorithms with applications to job scheduling under multiple constraints , 1999, Proceedings of the 1999 International Conference on Parallel Processing.