Stochastic model driven capacity planning for an infrastructure-as-a-service cloud

IEEE Transactions on Services Computing

Volumn 7, Issue 4, 2014, Pages 667-680

  Ghosh, Rahul ^a   Longo, Francesco ^b   Xia, Ruofan ^c   Naik, Vijay K ^d   Trivedi, Kishor S ^c  

^a IBM   (United States)

^b UNIVERSITY OF MESSINA   (Italy)

^c DUKE UNIVERSITY   (United States)

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

Author keywords

Capacity planning; Cloud; Downtime; Optimization; Stochastic models

Indexed keywords

CLOUDS; COST BENEFIT ANALYSIS; COST REDUCTION; MAINTENANCE; OPTIMIZATION; SIMULATED ANNEALING; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

CAPACITY PLANNING; CAPACITY REQUIREMENT; DOWNTIME; OPTIMIZATION FRAMEWORK; OPTIMIZATION PROBLEMS; SERVICE LEVEL AGREEMENTS; STOCHASTIC SEARCH ALGORITHMS; TOTAL COST OF OWNERSHIP;

INFRASTRUCTURE AS A SERVICE (IAAS);

EID: 84919717849     PISSN: 19391374     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSC.2013.44     Document Type: Article

References (28)

1. F. Longo, R. Ghosh, V.K. Naik, and K.S. Trivedi, "A Scalable Availability Model for Infrastructure-as-a-Service Cloud," in Proc. IEEE/IFIP Int'l Conf. DSN, Hong Kong, 2011, pp. 335-346.
2. V. Mainkar and K.S. Trivedi, "Sufficient Conditions for Existence of a Fixed Point in Stochastic Reward Net-Based Iterative Models," IEEE Trans. Softw. Eng., vol. 22, no. 9, pp. 640-653, Sept. 1996.
3. L. Tomek and K. Trivedi, "Fixed-Point Iteration in Availability Modeling," in Informatik-Fachberichte, vol. 91, Fehlertolerierende Rechensysteme, M. Dal Cin, Ed. Berlin, Germany: Springer-Verlag, 1991, pp. 229-240.
4. R. Ghosh, F. Longo, V.K. Naik, and K.S. Trivedi. (2013, July). Modeling and Performance Analysis of Large Scale Iaas Clouds. Future Gen. Comput. Syst. [Online]. 29(5), pp. 1216-1234. Available: http://dx.doi.org/10.1016/j.future.2012.06.005
5. R. Ghosh, V.K. Naik, and K.S. Trivedi, "Power-Performance Trade-Offs in IAAS Cloud: A Scalable Analytic Approach," in Proc. IEEE/IFIP Int'l Conf. DSN Workshop, Hong Kong, 2011, pp. 152-157.
6. Vision Solutions, "Assessing the Financial Impact of Downtime," Irvine, CA, USA, White Paper, 2008.
7. R. Ghosh, F. Longo, V.K. Naik, and K. Trivedi, "Capacity Planning for Highly Available IAAS Cloud," presented at the INFORMS Annual Meeting, Charlotte, NC, USA, 2011, (Abstract only).
8. V.K. Naik, R. Ghosh, F. Longo, and K. Trivedi, "Availability, at What Cost?" presented at the INFORMS Annual Meeting, Charlotte, NC, USA, 2011, (Abstract only).
9. M.R. Garey and D.S. Johnson, "Computers and Intractability," in A Guide to the Theory of NP-Completeness. San Francisco, CA, USA: Freeman, 1979.
10. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing . Hoboken, NJ, USA: Wiley, 1989.
11. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, "Optimization by Simulated Annealing," IBM, Armonk, NY, USA, IBM Res. Rep. RC 9355, 1982.
12. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, "Optimization by Simulated Annealing," Science, vol. 220, no. 4598, pp. 671-680, May 1983.
13. V. Cerny, "Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm," J. Optim. Theory Appl., vol. 45, no. 1, pp. 41-51, Jan. 1985.
14. P.J.M. van Laarhoven and E.H.L. Aarts, Simulated Annealing: Theory and Applications. Amsterdam, The Netherlands: Reidel, 1987.
15. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller, "Equation of State Calculations by Fast Computing Machines," J. Chem. Phys., vol. 21, no. 6, pp. 1087-1092, June 1953.
16. D.T. Pham and D. Karaboga, Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks. New York, NY, USA: Springer-Verlag, 2000.
17. B.W. Wah and T. Wang, "Simulated Annealing With Asymptotic Convergence for Nonlinear Constrained Global Optimization," in Proc. Int'l Conf. Principles Pract. Constr. Programm., Alexandria, VA, USA, 1999, pp. 461-475.
18. C. Hirel, B. Tuffin, and K.S. Trivedi, "SPNP: Stochastic Petri Nets. Version 6," in Proc. Int'l Conf. Comput. Perform. Eval., Model. Tech. TOOLS , vol. LNCS 1786, B. Haverkort and H. Bohnenkamp, Eds., Schaumburg, IL, USA, 2000, vol. LNCS 1786, pp. 354-357, Springer-Verlag.
19. K.S. Trivedi and R. Sahner, "SHARPE at the Age of Twenty Two," ACM SIGMETRICS Perform. Eval. Rev., vol. 36, no. 4, pp. 52-57, Mar. 2009.
20. H.J. Moon, Y. Chi, and H. Hacigümüs, "SLA-Aware Profit Optimization in Cloud Services Via Resource Scheduling," in Proc. 6th World Congr. SERVICES, Miami, FL, USA, 2010, pp. 152-153.
21. A. Andrzejak, D. Kondo, and S. Yi, "Decision Model for Cloud Computing Under SLA Constraints," in Proc. IEEE Int'l Symp. MASCOTS, Miami Beach, FL, USA, 2010, pp. 257-266.
22. D. Kondo, B. Javadi, P. Malecot, F. Cappello, and D.P. Anderson, "Cost-Benefit Analysis of Cloud Computing Versus Desktop Grids," in Proc. IEEE IPDPS, Rome, Italy, 2009, pp. 1-12.
23. X. Li, Y. Li, T. Liu, J. Qiu, and F. Wang, "The Method and Tool of Cost Analysis for Cloud Computing," in Proc. IEEE Int'l Conf. CLOUD Comput., Sept. 2009, pp. 93-100.
24. H. Qian and D. Medhi, "Server Operational Cost Optimization for Cloud Computing Service Providers Over a Time Horizon," in Proc. 11th USENIX Conf. Hot-ICE Topics Manage. Netw. Serv., Berkeley, CA, USA, 2011, p. 4.
25. Y. Jiang, C.-S. Perng, T. Li, and R. Chang, "Self-Adaptive Cloud Capacity Planning," in Proce. IEEE 9th Int'l Conf. Serv. Comput., Honolulu, HI, USA, 2012, pp. 73-80.
26. H. Goudarzi, M. Ghasemazar, and M. Pedram, "SLA-Based Optimization of Power and Migration Cost in Cloud Computing," in Proc. 12th IEEE/ACM Int'l Symp. Cluster, Cloud Grid Comput., Ottawa, ON, Canada, 2012, pp. 172-179.
27. D. Menasce and P. Ngo, "Understanding Cloud Computing: Experimentation and Capacity Planning," in Proc. Comput. Meas. Grp. Conf., Dallas, TX, USA, 2009, pp. 1-11.
28. S. Shang, B. Wang, J. Jiang, Y. Wu, and W. Zheng, "An Intelligent Capacity Planning Model for Cloud Market," J. Internet Serv. Inf. Security, vol. 1, no. 1, pp. 37-45, May 2011.