.png){kind=icon}
.png){kind=icon}
Return
Research on Computing Resource Measurement and Routing Methods in Software Defined Computing First Network
.png){kind=icon}
OA
AI
DOI：10.3390/s24041086.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Computing resource measurement and computing routing are essential technologies in the computing first network (CFN), serving as its foundational elements. This paper introduces a Software Defined Computing First Network (SD-CFN) architecture. Building upon this framework, a Dynamic-Static Integrated Computing Resource Measurement Mechanism (DCRMM) is proposed, incorporating methods such as the entropy weight method and K-Means clustering. The DCRMM algorithm outperforms the Maximum-closest Static Algorithm (MSA) and Maximum Closest Dynamic Algorithm (MDA) in terms of node stability, node utilization, and node matching accuracy. Additionally, a Reinforcement Learning and Software Defined Computing First Networking Routing (RSCR) algorithm is presented as a software-defined computing routing solution within the SD-CFN. RSCR introduces a knowledge plane responsible for computing routing calculations. It comprehensively considers factors such as link latency, available bandwidth, and packet loss rate. Simulation experiments conducted on the GeANT topology demonstrate that RSCR outperforms the OSPF algorithm in terms of link latency, packet loss rate, and throughput. DCRMM and RSCR offer innovative solutions for computing resource measurement and computing routing in computing first networks.
Keywords:
software defined network
computing first network
computing routing
computing resource measurement
reinforcement learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.