SLA-aware placement of multi-virtual machine elastic services in compute clouds

Proceedings of the 12th IFIP/IEEE International Symposium on Integrated Network Management, IM 2011

Volumn , Issue , 2011, Pages 161-168

  Breitgand, David ^a   Epstein, Amir ^a  

^a IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CLOUD PROVIDERS; COLUMN GENERATION; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATION TIME; CONSTANT FACTOR APPROXIMATION; ELASTIC SERVICES; EXACT SOLUTION; EXTENSIVE SIMULATIONS; FINANCIAL LOSS; GENERALIZED ASSIGNMENT PROBLEM; INTEGER PROGRAMMING FORMULATIONS; LARGE DATA; MULTI-UNIT COMBINATORIAL AUCTIONS; NEAR-OPTIMAL SOLUTIONS; PLACEMENT PROBLEMS; SERVICE LEVEL AGREEMENTS; VIRTUALIZED RESOURCES;

COMBINATORIAL OPTIMIZATION; COMPUTER SIMULATION; INTEGER PROGRAMMING; LOSSES; OPTIMIZATION;

NETWORK MANAGEMENT;

EID: 80052738206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INM.2011.5990687     Document Type: Conference Paper

References (30)

1. B. Rochwerger, D. Breitgand, E. Levy, A. Galis, K. Nagin, I. Llorente, R. Montera, Y. Wolfsthal, E. Elmroth, J. Caceres, M. Ben-Yehuda, W. Emmerich, and F. Galan, "The RESERVOIR Model and Architecture for Open Federated Cloud Computing," IBM Journal of Research and Development, vol. 53, no. 4, 2009.
2. "Right Scale," http://www.rightscale.com/m/.
3. "The RESERVOIR project home page," http://www.reservoir-fp7.eu, 2008.
4. B. Urgaonkar, A. L. Rosenberg, and P. J. Shenoy, "Application placement on a cluster of servers," Int. J. Found. Comput. Sci., vol. 18, no. 5, pp. 1023-1041, 2007.
5. S. Mehta and A. Neogi, "Recon: A tool to recommend dynamic server consolidation in multi-cluster data centers," in IEEE Network Operations and Management Symposium (NOMS 2008), Salvador, Bahia, Brasil, Apr 2008, pp. 363-370.
6. T. Wood, P. Shenoy, A. Venkataramani, and M. Yousif, "Black-Box and Gray-Box Strategies for Virtual Machine Migration," in USENIX Symposium on Networked System Design and Implementation (NSDI'07), Cambridge, MA, USA, Apr 2007.
7. S. Khuller, J. Li, and B. Saha, "Energy efficient scheduling via partial shutdown," in Proc. 21th ACM-SIAM Symp. on Discrete Algorithms, 2010, pp. 1360-1372.
8. X. Meng, V. Pappas, and L. Zhang, "Improving the scalability of data center networks with traffic-aware virtual machine placement," in INFOCOM, 2010.
9. C. Chekuri and S. Khanna, "A polynomial time approximation scheme for the multiple knapsack problem," SIAM J. Comput., vol. 35, no. 3, pp. 713-728, 2005.
10. D. Shmoys and E. Tardos, "An approximation algorithm for the generalized assignment problem," Mathematical Programming A, vol. 62, pp. 461-474, 1993.
11. U. Feige and J. Vondrák, "Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e," in Proc. 47th IEEE Symp. on Found. of Comp. Science, 2006, pp. 667-676.
12. D. J. Lehmann, L. O'Callaghan, and Y. Shoham, "Truth revelation in approximately efficient combinatorial auctions," J. ACM, vol. 49, no. 5, pp. 577-602, 2002.
13. S. Dobzinski, N. Nisan, and M. Schapira, "Approximation algorithms for combinatorial auctions with complement-free bidders," Math. Oper. Res., vol. 35, no. 1, pp. 1-13, 2010.
14. B. Lehmann, D. J. Lehmann, and N. Nisan, "Combinatorial auctions with decreasing marginal utilities," in ACM Conference on Electronic Commerce, 2001, pp. 18-28.
15. P. Briest, P. Krysta, and B. Vöcking, "Approximation techniques for utilitarian mechanism design," in STOC, 2005, pp. 39-48.
16. A. Srinivasan, "Improved approximation guarantees for packing and covering integer programs," SIAM J. Comput., vol. 29, no. 2, pp. 648-670, 1999.
17. P. Raghavan, "Probabilistic construction of deterministic algorithms: Approximating packing integer programs," J. Comput. Syst. Sci., vol. 37, no. 2, pp. 130-143, 1988.
18. A. Srinivasan, "An extension of the lovász local lemma, and its applications to integer programming," in SODA '96: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, 1996, pp. 6-15.
19. P. C. Gilmore and R. E. Gomory, "A linear programming approach to the cutting stock problem-Part II," Oper. Res., vol. 11, pp. 863-888, 1963.
20. M. Desrochers, J. Desrosiers, and M. Solomon, "A new optimization algorithm for the vehicle routing problem with time windows," Oper. Res., vol. 40, no. 2, pp. 342-354, 1992.
21. M. Desrochers and F. Soumis, "A column generation approach to urban transit crew scheduling," Transportation Sci., vol. 23, pp. 1-13, 1989.
22. P. Värbrand, D. Yuan, and P. Björklund, "Resource Optimization of Spatial TDMA in Ad Hoc Radio Networks: A Column Generation Approach," in INFOCOM, 2003, pp. 818-824.
23. S. de Vries and R. V. Vohra, "Combinatorial auctions: A survey," INFORMS Journal on Computing, vol. 15, no. 3, pp. 284-309, 2003.
24. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, Algorithmic Game Theory. New York, NY, USA: Cambridge University Press, 2007.
25. H. N. Gabow, "Data structures for weighted matching and nearest common ancestors with linking," in SODA, 1990, pp. 434-443.
26. C. Barnhart, E. L. Johnson, G. L. Nemhauser, and M. W. P. Savelsbergh, "Branch-and-price: Column generation for solving huge integer programs," Oper. Res., vol. 46, no. 3, pp. 316-329, 1998.
27. R. N. Calheiros, R. Ranjan, A. Beloglazov, C. A. F D. Rose, and R. Buyya, CloudSim: A Toolkit for Modeling and Simulation of Cloud Computing Environments and Evaluation of Resource Provisioning Algorithms, Software: Practice and Experience. New York, USA: Wiley Press, 2010.
28. Amazon Elastic Compute Cloud (EC2), http://aws.amazon.com/ec2.
29. IBM ILOG CPLEX 12.1, http://www-01.ibm.com/software/integration/- optimization/cplex-optimizer.
30. D. Breitgand and A. Epstein, SLA-aware Placement of Multi-Virtual Machine Elastic Services in Compute Clouds. IBM Technical Report, H-0287, 2010.