Modeling and Optimization for Computing Power Resource-Aware in CPN

Computing power network (CPN) has been proposed to realize the best resource allocation through distributing computing, storage, algorithm, and other resource information. Many routing nodes of computing resources pools generate many events related to computing power resources, and it’s a challenge for network control plane to process these events. To solve this problem, we design data structure of computing power resource model firstly. Then we analyze the advantages and disadvantages of traditional algorithms, and propose a scheduling approach based on Dynamic Priority (DP) algorithm for resource-aware events. At last, we design a simulation experiment to analyze our approach. From the results we can see that our approach is feasible and more effective than traditional algorithms.