DEPAS: a decentralized probabilistic algorithm for auto-scaling

被引:29
作者
Calcavecchia, Nicolo M. [1 ]
Caprarescu, Bogdan A. [2 ]
Di Nitto, Elisabetta [1 ]
Dubois, Daniel J. [1 ]
Petcu, Dana [2 ]
机构
[1] Politecn Milan, Dipartimento Elettron & Informaz, I-20133 Milan, Italy
[2] W Univ Timisoara, Fac Math & Comp Sci, IeAT, Timisoara 300223, Romania
关键词
Auto-scaling; Cloud computing; Self-organization;
D O I
10.1007/s00607-012-0198-8
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The dynamic provisioning of virtualized resources offered by cloud computing infrastructures allows applications deployed in a cloud environment to automatically increase and decrease the amount of used resources. This capability is called auto-scaling and its main purpose is to automatically adjust the scale of the system that is running the application to satisfy the varying workload with minimum resource utilization. The need for auto-scaling is particularly important during workload peaks, in which applications may need to scale up to extremely large-scale systems. Both the research community and the main cloud providers have already developed auto-scaling solutions. However, most research solutions are centralized and not suitable for managing large-scale systems, moreover cloud providers' solutions are bound to the limitations of a specific provider in terms of resource prices, availability, reliability, and connectivity. In this paper we propose DEPAS, a decentralized probabilistic auto-scaling algorithm integrated into a P2P architecture that is cloud provider independent, thus allowing the auto-scaling of services over multiple cloud infrastructures at the same time. Our experiments (simulations and real deployments), which are based on real service traces, show that our approach is capable of: (i) keeping the overall utilization of all the instantiated cloud resources in a target range, (ii) maintaining service response times close to the ones obtained using optimal centralized auto-scaling approaches.
引用
收藏
页码:701 / 730
页数:30
相关论文
共 34 条
[1]  
Adam C, 2006, IEEE T NETW SERV MAN, V3, P1
[2]   Joint admission control and resource allocation in virtualized servers [J].
Almeida, Jussara ;
Almeida, Virgilio ;
Ardagna, Danilo ;
Cunha, Italo ;
Francalanci, Chiara ;
Trubian, Marco .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2010, 70 (04) :344-362
[3]   A View of Cloud Computing [J].
Armbrust, Michael ;
Fox, Armando ;
Griffith, Rean ;
Joseph, Anthony D. ;
Katz, Randy ;
Konwinski, Andy ;
Lee, Gunho ;
Patterson, David ;
Rabkin, Ariel ;
Stoica, Ion ;
Zaharia, Matei .
COMMUNICATIONS OF THE ACM, 2010, 53 (04) :50-58
[4]  
Baresi L., 2011, P 4 IND SOFTW ENG C, P11
[5]  
Bolch G., 1998, QUEUEING NETWORKS MA
[6]  
Bonvin Nicolas, 2011, 2011 Proceedings of 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2011), P434, DOI 10.1109/CCGrid.2011.24
[7]  
Buyya R, 2010, LECT NOTES COMPUT SC, V6081, P13
[8]   A Self-Organizing Feedback Loop for Autonomic Computing [J].
Caprarescu, Bogdan Alexandru ;
Petcu, Dana .
2009 COMPUTATION WORLD: FUTURE COMPUTING, SERVICE COMPUTATION, COGNITIVE, ADAPTIVE, CONTENT, PATTERNS, 2009, :126-131
[9]  
Celesti Antonio, 2010, 2010 IEEE 3rd International Conference on Cloud Computing (CLOUD 2010), P337, DOI 10.1109/CLOUD.2010.46
[10]  
Di Nitto E, 2008, P 3 INT C BIOINSP MO, P14