Abstract: Under the development of computing and network convergence, considering the computing and network resources of multiple providers as a whole in a computing force network (CFN) has gradually become a new trend. However, since each computing and network resource provider (CNRP) considers only its own interest and competes with other CNRPs, introducing multiple CNRPs will result in 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, to improve user satisfaction and ensure the utilization of limited resources. In this paper, 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 feasible solutions using a modified fast and elitist non-dominated sorting genetic algorithm (NSGA-II). We conduct extensive simulations to evaluate the proposed algorithm. Simulation results demonstrate that the proposed model and the problem formulation are valid, and the NSGA-II is effective and can find the Pareto set of CFN, which 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 according to the actual situation.

Key words: Computing force network; Resource scheduling; Performance-based reputation; User satisfaction

Please provide your name, email address and a comment

Your Name: Affili: E-Mail Address:

Comment (Please comment in English):


Verification Code(click to change a pic):