Consolidating virtual machines with dynamic bandwidth demand in data centers

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 71-75

  Wang, Meng ^a   Meng, Xiaoqiao ^b   Zhang, Li ^b  

^a Department of Obstetrics Gynecology   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIN PACKING PROBLEM; DATA CENTERS; DYNAMIC BANDWIDTH; NETWORK BANDWIDTH DEMANDS; NUMERICAL EXPERIMENTS; PACKING ALGORITHMS; PRODUCTION DATA; VIRTUAL MACHINES; VIRTUALIZATIONS;

ALGORITHMS; BANDWIDTH;

COMPUTER SIMULATION;

EID: 79960853001     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935254     Document Type: Conference Paper

References (28)

1. Y. Ajiro and A. Tanaka, "Improving packing algorithms for server consolidation," in Proceedings of the International Conference for the Computer Measurement Group (CMG), 2007.
2. T. A. Benson, A. Anand, A. Akella, and M. Zhang, "Understanding data center traffic characteristics," in ACM SIGCOMM WREN workshop, 2009.
3. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, "Approximation algorithms for bin packing: a survey," pp. 46-93, 1997.
4. G. Dosa, "The tight bound of first fit decreasing bin-packing algorithm is FFD(1)=(11/9)OPT(1)+6/9," in Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, 2007.
5. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co Ltd, January 1979.
6. A. Goel and P. Indyk, "Stochastic load balancing and related problems," 40th IEEE Annual Symposium on Foundations of Computer Science, vol. 0, p. 579, 1999.
7. IBM, "Server Planning Tool, http://www-304.ibm.comljct01004c/ systems/supportltools/systemplanningtool!."
8. IBM WebSphere CloudBurst, "'http://www.ibm.comlsoftware/webservers/ cloudburstl."
9. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, "Worst-case performance bounds for simple one-dimensional packing algorithms," SIAM Journal on Computing, vol. 3, no. 4, pp. 299-325, 1974.
10. D. S. Johnson, Ph.D. dissertation. MIT, Cambridge, Mass., June 1973.
11. -, "Fast algorithms for bin packing," Journal of Computer and System Sciences, vol. 8, no. 3, pp. 272-314, 1974.
12. D. S. Johnson and M. R. Garey, "A 71160 theorem for bin packing," Journal of Complexity, vol. I, no. I, pp. 65-106, 1985.
13. J.Shahabuddin, A.Chrungoo, y'Gupta, S.Juneja, S.Kapoor, and A.Kumar, "Stream-packing: Resource allocation in web server farms with a QOS guarantee," in HiPC, 2001 .
14. S. Kandula, S. Sengupta, A. Greenberg, and P. Patel, "The nature of datacenter traffic: Measurements and analysis," in ACM IMC, 2009.
15. Kleinberg, Y. Rabani, and E. Tardos, "Allocating bandwidth for bursty connections," in Proc. STOC, 1997, pp. 664-673.
16. Lanamark Suite,.http://www.lanamark.coml.
17. C. C. Lee and D. T. Lee, "A simple on-line bin-packing algorithm," J. ACM, vol. 32, no. 3, pp. 562-572, 1985.
18. S. Mehta and A. Neogi, "Recon: a tool to recommend dynamic server consolidation in multi-cluster data centers," in NOMS, 2008.
19. X. Meng, Y. Pappas, and L. Zhang, "Improving the scalability of data center networks with traffic-aware virtual machine placement," in IEEE INF O COM, 2010.
20. N.Bobroff, A.Kochut, and K.Beaty, "Dynamic placement of virtual machines for managing SLA violations," in Integrated Network Management, 2007.
21. Novell PlateS pin Recon,.http://www.novell.comlproducts/reconl.
22. VMware Inc., "VMware Capacity Planner, http://www.vmware. comlproducts/capacity-planner/.
23. -, "VMWare vCenter CapacityIQ, http://www.vmware.comlproducts/ vcenter-capacityiq/.
24. -, "Resource Management with VMware DRS," VMware Inc., Whitepaper, 2006.
25. M. Wang, X. Meng, and L. Zhang, "Consolidating virtual machines with dynamic bandwidth demand in data centers," Tech. Rep., 2010.[Online]. Available: http://networks.ece.comell.edulmeng/pubIBPIO.pdf
26. W.Leinberger, G.Karypis, and Y.Kumar, "Multi-capacity bin packing algorithms with applications to job scheduling under multiple constraints," in ICPP, 1999.
27. A. C.-C. Yao, "New algorithms for bin packing," J. ACM, vol. 27, no. 2, pp. 207-227, 1980.
28. M. Yue and L. Zhang, "A simple proof of the inequality MFFD(L):S 711600PT(L) + 1, L for the MFFD bin-packing algorithm," Acta Mathematicae Applicatae Sinica, vol. 11, no. 3, pp. 318-330, 1995.