A method for the optimum selection of datacenters in geographically distributed clouds

被引:10
作者
Ziafat, Hassan [1 ]
Babamir, Seyed Morteza [1 ]
机构
[1] Univ Kashan, Dept Comp, Kashan, Iran
关键词
Geo-distributed datacenters; Clustering; K-means algorithm; Multi-objective optimization algorithm; NSGA-II algorithm; Service-level agreement (SLA); ALGORITHM; LATENCY;
D O I
10.1007/s11227-017-1999-5
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The optimal selection of a datacenter is one of the most important challenges in the structure of a network for the wide distribution of resources in the environment of a geographically distributed cloud. This is due to the variety of datacenters with different quality-of-service (QoS) attributes. The user's requests and the conditions of the service-level agreements (SLAs) should be considered in the selection of datacenters. In terms of the frequency of datacenters and the range of QoS attributes, the selection of the optimal datacenter is an NP-hard problem. A method is therefore required that can suggest the best datacenter, based on the user's request and SLAs. Various attributes are considered in the SLA; in the current research, the focus is on the four important attributes of cost, response time, availability, and reliability. In a geo-distributed cloud environment, the nearest datacenter should be suggested after receiving the user's request, and according to its conditions, SLA violations can be minimized. In the approach proposed here, datacenters are clustered according to these four important attributes, so that the user can access these quickly based on specific need. In addition, in this method, cost and response time are taken as negative criteria, while accessibility and reliability are taken as positive, and the multi-objective NSGA-II algorithm is used for the selection of the optimal datacenter according to these positive and negative attributes. In this paper, the proposed method, known as NSGAII_Cluster, is implemented with the Random, Greedy and MOPSO algorithms; the extent of SLA violation of each of the above-mentioned attributes are compared using four methods. The simulation results indicate that compared to the Random, Greedy and MOPSO methods, the proposed approach has fewer SLA violations in terms of the cost, response time, availability, and reliability of the selected datacenters.
引用
收藏
页码:4042 / 4081
页数:40
相关论文
共 44 条
[1]  
Alicherry M, 2012, IEEE INFOCOM SER, P963, DOI 10.1109/INFCOM.2012.6195847
[2]  
Alpaydin E, 2014, ADAPT COMPUT MACH LE, P1
[3]  
[Anonymous], 2002, Evolutionary algorithms for solving multi-objective problems
[4]  
[Anonymous], 2010, EPRINT ARXIV
[5]  
[Anonymous], 2012, Reliability and availability of cloud computing
[6]  
[Anonymous], 2010, INFOCOM, 2010 Proceedings IEEE, DOI 10.1109/INFCOM.2010.5461930
[7]  
[Anonymous], 1999, Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications
[8]  
[Anonymous], 2016, WORLD REGIONS BASED
[9]  
[Anonymous], 2012, Proceedings of the 12th ACM SIGCOMM Conference on Internet Measurement
[10]   A workload characterization study of the 1998 World Cup Web site [J].
Arlitt, M ;
Jin, T .
IEEE NETWORK, 2000, 14 (03) :30-37