In cloud computing,fairness is one of the most significant indicators to evaluate resource allocation algorithms,which reveals whether each user is allocated as much as that of all other users having the same bottlene...In cloud computing,fairness is one of the most significant indicators to evaluate resource allocation algorithms,which reveals whether each user is allocated as much as that of all other users having the same bottleneck.However,how fair an allocation algorithm is remains an urgent issue.In this paper,we propose Dynamic Evaluation Framework for Fairness(DEFF),a framework to evaluate the fairness of an resource allocation algorithm.In our framework,two sub-models,Dynamic Demand Model(DDM) and Dynamic Node Model(DNM),are proposed to describe the dynamic characteristics of resource demand and the computing node number under cloud computing environment.Combining Fairness on Dominant Shares and the two sub-models above,we finally obtain DEFF.In our experiment,we adopt several typical resource allocation algorithms to prove the effectiveness on fairness evaluation by using the DEFF framework.展开更多
The problem of joint radio and cloud resources allocation is studied for heterogeneous mobile cloud computing networks. The objective of the proposed joint resource allocation schemes is to maximize the total utility ...The problem of joint radio and cloud resources allocation is studied for heterogeneous mobile cloud computing networks. The objective of the proposed joint resource allocation schemes is to maximize the total utility of users as well as satisfy the required quality of service(QoS) such as the end-to-end response latency experienced by each user. We formulate the problem of joint resource allocation as a combinatorial optimization problem. Three evolutionary approaches are considered to solve the problem: genetic algorithm(GA), ant colony optimization with genetic algorithm(ACO-GA), and quantum genetic algorithm(QGA). To decrease the time complexity, we propose a mapping process between the resource allocation matrix and the chromosome of GA, ACO-GA, and QGA, search the available radio and cloud resource pairs based on the resource availability matrixes for ACOGA, and encode the difference value between the allocated resources and the minimum resource requirement for QGA. Extensive simulation results show that our proposed methods greatly outperform the existing algorithms in terms of running time, the accuracy of final results, the total utility, resource utilization and the end-to-end response latency guaranteeing.展开更多
This paper is concerned with the resource allocation problem based on data envelopment analysis (DEA) which is generally found in practice such as in public services and in production process. In management context,...This paper is concerned with the resource allocation problem based on data envelopment analysis (DEA) which is generally found in practice such as in public services and in production process. In management context, the resource allocation has to achieve the effective-efficient-equality aim and tries to balance the different desires of two management layers: central manager and each sector. In mathematical programming context, to solve the resource allocation asks for introducing many optimization techniques such as multiple-objective programming and goal programming. We construct an algorithm framework by using comprehensive DEA tools including CCR, BCC models, inverse DEA model, the most compromising common weights analysis model, and extra resource allocation algorithm. Returns to scale characteristic is put major place for analyzing DMUs' scale economies and used to select DMU candidates before resource allocation. By combining extra resource allocation algorithm with scale economies target, we propose a resource allocation solution, which can achieve the effective-efficient-equality target and also provide information for future resource allocation. Many numerical examples are discussed in this paper, which also verify our work.展开更多
基金supported in part by Program for Changjiang Scholars and Innovative Research Team in University No.IRT1078The Key Program of NSFC-Guangdong Union Foundation No.U1135002The Fundamental Research Funds for the Central Universities No.JY0900120301
文摘In cloud computing,fairness is one of the most significant indicators to evaluate resource allocation algorithms,which reveals whether each user is allocated as much as that of all other users having the same bottleneck.However,how fair an allocation algorithm is remains an urgent issue.In this paper,we propose Dynamic Evaluation Framework for Fairness(DEFF),a framework to evaluate the fairness of an resource allocation algorithm.In our framework,two sub-models,Dynamic Demand Model(DDM) and Dynamic Node Model(DNM),are proposed to describe the dynamic characteristics of resource demand and the computing node number under cloud computing environment.Combining Fairness on Dominant Shares and the two sub-models above,we finally obtain DEFF.In our experiment,we adopt several typical resource allocation algorithms to prove the effectiveness on fairness evaluation by using the DEFF framework.
基金supported by the National Natural Science Foundation of China (No. 61741102, No. 61471164)China Scholarship Council
文摘The problem of joint radio and cloud resources allocation is studied for heterogeneous mobile cloud computing networks. The objective of the proposed joint resource allocation schemes is to maximize the total utility of users as well as satisfy the required quality of service(QoS) such as the end-to-end response latency experienced by each user. We formulate the problem of joint resource allocation as a combinatorial optimization problem. Three evolutionary approaches are considered to solve the problem: genetic algorithm(GA), ant colony optimization with genetic algorithm(ACO-GA), and quantum genetic algorithm(QGA). To decrease the time complexity, we propose a mapping process between the resource allocation matrix and the chromosome of GA, ACO-GA, and QGA, search the available radio and cloud resource pairs based on the resource availability matrixes for ACOGA, and encode the difference value between the allocated resources and the minimum resource requirement for QGA. Extensive simulation results show that our proposed methods greatly outperform the existing algorithms in terms of running time, the accuracy of final results, the total utility, resource utilization and the end-to-end response latency guaranteeing.
基金This research is supported by 973 Program under Grant No.2006CB701306
文摘This paper is concerned with the resource allocation problem based on data envelopment analysis (DEA) which is generally found in practice such as in public services and in production process. In management context, the resource allocation has to achieve the effective-efficient-equality aim and tries to balance the different desires of two management layers: central manager and each sector. In mathematical programming context, to solve the resource allocation asks for introducing many optimization techniques such as multiple-objective programming and goal programming. We construct an algorithm framework by using comprehensive DEA tools including CCR, BCC models, inverse DEA model, the most compromising common weights analysis model, and extra resource allocation algorithm. Returns to scale characteristic is put major place for analyzing DMUs' scale economies and used to select DMU candidates before resource allocation. By combining extra resource allocation algorithm with scale economies target, we propose a resource allocation solution, which can achieve the effective-efficient-equality target and also provide information for future resource allocation. Many numerical examples are discussed in this paper, which also verify our work.