Affiliation(s):
China Mobile Research Institute, Beijing 100053, China;
moreAffiliation(s): China Mobile Research Institute, Beijing 100053, China; Purple Mountain Laboratories, Nanjing 211111, China; China Mobile Communications Corporation;
less
Yuexia FU, Jing WANG, Lu LU, Qinqin TANG, Sheng ZHANG. Reputation-based joint optimization of user satisfaction and resource utilization in Computing Force Network[J]. Frontiers of Information Technology & Electronic Engineering,in press.https://doi.org/10.1631/FITEE.2300156
@article{title="Reputation-based joint optimization of user satisfaction and resource utilization in Computing Force Network", author="Yuexia FU, Jing WANG, Lu LU, Qinqin TANG, Sheng ZHANG", journal="Frontiers of Information Technology & Electronic Engineering", year="in press", publisher="Zhejiang University Press & Springer", doi="https://doi.org/10.1631/FITEE.2300156" }
%0 Journal Article %T Reputation-based joint optimization of user satisfaction and resource utilization in Computing Force Network %A Yuexia FU %A Jing WANG %A Lu LU %A Qinqin TANG %A Sheng ZHANG %J Frontiers of Information Technology & Electronic Engineering %P %@ 2095-9184 %D in press %I Zhejiang University Press & Springer doi="https://doi.org/10.1631/FITEE.2300156"
TY - JOUR T1 - Reputation-based joint optimization of user satisfaction and resource utilization in Computing Force Network A1 - Yuexia FU A1 - Jing WANG A1 - Lu LU A1 - Qinqin TANG A1 - Sheng ZHANG J0 - Frontiers of Information Technology & Electronic Engineering SP - EP - %@ 2095-9184 Y1 - in press PB - Zhejiang University Press & Springer ER - doi="https://doi.org/10.1631/FITEE.2300156"
Abstract: Under the development of computing network convergence, considering the computing and network resources of multiple providers as a whole in the Computing Force Network (CFN) has gradually become a new trend. However, since each computing and network resource provider (CNRP) only considers its interest and competes with other CNRPs, introducing multiple CNRPs will create the problem of a lack of trust and difficulty in unified scheduling. In addition, concurrent users have different requirements, so there is an urgent need to study how to optimally match users and CNRPs on a many-to-many basis, thus improving user satisfaction and ensuring and improving the utilization of limited resources. In this paper, firstly, we adopt a reputation model based on the beta distribution function to measure the credibility of CNRPs and propose a performance-based reputation update model. Then, we formalize the problem into a constrained multi-objective optimization problem and find the feasible solutions using a modified fast and elitist non-dominated sorting genetic algorithm (NSGA-II). We also conduct extensive simulation experiments to evaluate the proposed algorithm; the simulation results demonstrate that the proposed model and the problem formulation are valid and, based on which NSGA-II algorithm is effective and which can find the Pareto set of CFN, increases user satisfaction and resource utilization. Moreover, a set of solutions provided by the Pareto set give us more choices of the many-to-many matching of users and CNRPs problem according to the actual situation.
Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article
Reference
Open peer comments: Debate/Discuss/Question/Opinion
Open peer comments: Debate/Discuss/Question/Opinion
<1>