Allocating the right amount of resources to each service in any of the data centers in a cloud environment is a very difficult task. In a previous work we considered the case where only two data centers are available and proposed a stochastic based placement algorithm to find a solution that minimizes the expected total cost of ownership. This approximation algorithm seems to work well for a very large family of overflow cost functions, which contains three functions that describe the most common practical situations. In this paper we generalize this work for arbitrary number of data centers and develop a generalized mechanism to assign services to data centers based on the available resources in each data center and the distribution of the demand for each service. We further show, using simulations based on synthetic data that the scheme performs very well on different service workloads.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Shabtai, G., Raz, D., Shavitt, Y.: Risk aware stochastic placement of cloud services: the case of two data centers. In: ALGOCLOUD (2017)
2.
Kleinberg, J., Rabani, Y., Tardos, É.: Allocating bandwidth for bursty connections. SIAM J. Comput.
30(1), 191–217 (2000)
MathSciNetCrossRefMATH
3.
Goel, A., Indyk, P.: Stochastic load balancing and related problems. In: IEEE FOCS 1999, pp. 579–586 (1999)
4.
Wang, M., Meng, X., Zhang, L.: Consolidating virtual machines with dynamic bandwidth demand in data centers. In: IEEE INFOCOM 2011, pp. 71–75 (2011)
5.
Breitgand, D., Epstein, A.: Improving consolidation of virtual machines with risk-aware bandwidth oversubscription in compute clouds. In: IEEE INFOCOM 2012, pp. 2861–2865 (2012)
6.
Nikolova, E., Kelner, J.A., Brand, M., Mitzenmacher, M.: Stochastic shortest paths via quasi-convex maximization. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 552–563. Springer, Heidelberg (2006).
https://doi.org/10.1007/11841036_50CrossRef
7.
Nikolova, E.: Approximation algorithms for offline risk-averse combinatorial optimization. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 338–351 (2010)
Über dieses Kapitel
Titel
Risk Aware Stochastic Placement of Cloud Services: The Multiple Data Center Case
Die B2B-Firmensuche für Industrie und Wirtschaft: Kostenfrei in Firmenprofilen nach Lieferanten, Herstellern, Dienstleistern und Händlern recherchieren.
Unternehmen haben das Innovationspotenzial der eigenen Mitarbeiter auch außerhalb der F&E-Abteilung erkannt. Viele Initiativen zur Partizipation scheitern in der Praxis jedoch häufig. Lesen Sie hier - basierend auf einer qualitativ-explorativen Expertenstudie - mehr über die wesentlichen Problemfelder der mitarbeiterzentrierten Produktentwicklung und profitieren Sie von konkreten Handlungsempfehlungen aus der Praxis. Jetzt gratis downloaden!
