Abstract
The aim of this chapter is twofold. On one hand, it shows how some classes of optimization problems can be efficiently solved on a cloud platform, especially in terms of storage capacity and computing power. Since an exhaustive treatment of this topic is beyond the purpose of the book, the attention is focused on the following classes of optimization problems: Linear Programming, Integer Linear Programming, Stochastic Optimization, and Logistics Management. On the other hand, the chapter also shows how some problems that arise in designing and managing the clouds can be mathematically formulated as optimization problems. Among these, the attention is focused on the Data Center Location Problem, the Virtual Machines Allocation Problem, and the Partner Provider Selection Problem. Finally, some useful conclusions are derived on the relation between Simulation-based Optimization and cloud computing.
Reference48 articles.
1. Aida, Natsume, & Futakata. (2003). Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm. In Proceedings of 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid. IEEE/ACM.
2. Beaumont, O., Eyraud-Dubois, L., Pesneau, P., & Renaud-Goud, P. (2013). Reliable service allocation in clouds with memory and capacity constraints. In Proceedings of Resilience 2013. Retrieved from http://hal.inria.fr/hal-00850125/PDF/resilience.pdf
3. Hierarchical branch and bound algorithm for computational grids
4. Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints
5. Bobroff, N., Kochut, A., & Beaty, K. (2007). Dynamic placement of virtual machines for managing SLA violations. In Proceedings of 10th IFIP/IEEE International Symposium on Integrated Network Management (IM '07). IEEE.