A hierarchical structure for optimal resource allocation in geographically distributed clouds

نویسندگانحسن ضیافت,سید مرتضی بابامیر
نشریهFUTURE GENER COMP SY
شماره صفحات539
شماره مجلد90
ضریب تاثیر (IF)4.639
نوع مقالهFull Paper
تاریخ انتشار2018-08-11
رتبه نشریهعلمی - پژوهشی
نوع نشریهالکترونیکی
کشور محل چاپایران
نمایه نشریهISI ,SCOPUS

چکیده مقاله

Due to the growth of users’ requests for various resources in cloud computing, the optimal resource allocation is one of the most important challenges in cloud environments. The optimal resource allocation is achieved by considering user requirements stated in Service Level Agreements (SLAs) and the Quality of Services (QoSs) provided by resources. Since some user requirements (objectives) conflict with some others, a optimal trade-off between them is required in the selection of resources. Obtaining such a trade-off is a complicated and NP-hard problem because we may come up with a lot of permutations (choices) of the resources with the desired QoS. If a cloud environment is geographically distributed, the problem becomes more complicated because in the geographically distributed cloud there are a lot of candidate datacenters with qualified resources. The user requirements considered in this paper are availability and reliability of resources should be maximized and resource cost and response time should be minimized as well as the minimization of the network traffic. The maximization of and the minimization of the requirements conflict with each other; therefore a trade-off between them is required. In this paper, a hierarchical structure with two resource selections methods called Simplex Linear Programming (SLP) Method and GrEA-based method are used where the hierarchical structure is used to present connections between distributed datacenters and the methods are used to select optimal resources among the datacenters. The most important feature of the hierarchical structure is to prevent the occurrence of an accumulation of requests in a datacenter leading to increase the rate of finding optimal VMs. Moreover, in most studies on geographically distributed clouds, one user requirement is considered for the optimal selection of resources; however, in this study, datacenters are selected based on 4 user requirements as well as the network traffic. Moreover, while in most studies, the requests for one user is considered at one time, this work does the requests for several users sent to the cloud simultaneously. Our results showed an optimal trade-off between user conflicting requirements and the resource utilization by 92%. Moreover, the performance indexes coverage ratio and the maximum spread indexes showed more performance compared to related studies.

tags: Geographically distributed cloudsMany-objective algorithmVM allocationLinear programming (LP)GrEA algorithmHierarchical structure