A cross-network integration scheduling mechanism for high-concurrency transmission tasks in computing power networks

The digital age has promoted the growth of the demand for a large number of computing resources, and the computing power network was born. Through distributed architecture, the computing power network can cover clouds, edges, and terminals to meet different levels of computing needs. Then, in reality, the network resources are complex, and there are many high-concurrent transmission tasks in the computing network. The OSPF routing algorithm adopted in the traditional network only supports multiple transmission tasks to seize the bandwidth resources of a single link, so it is difficult for users to flexibly choose computing resources according to the task requirements. Therefore, in order to achieve the heterogeneity of network resources, we propose a cross-network fusion scheduling mechanism for high-concurrent transmission tasks in the computing network. By sensing the performance parameters of multi-link heterogeneous networks, we assign a link with relatively abundant bandwidth and relatively short time to complete all transmission tasks to the new task flow for transmission, so as to ensure the bandwidth demand of high concurrent transmission tasks. Finally, the test results show that this method can make full use of network resources, and the throughput of each task flow is improved by more than 100 Mbps, and the transmission time of each task is reduced by more than 5 s.