## 3 System Architecture
### System Implementation
#### 3.2.1 Control Plane Implementation  
The control plane primarily performs the following functions:  
* Computing and network information maintenance, sensing, and announcement: This is the basis of scheduling--that service information can be announced based on different strategies. The strategies are beyond the scope of this paper, but it is important to note that within a limited domain, the service information is the same in each network node. However, due to the varying link delay between network nodes, the network status information is different. This information is the basis for subsequent scheduling. Table 2 provides detailed service information.  
\begin{table}
\begin{tabular}{p{113.8 pt} p{113.8 pt}} \hline \hline
**Information Category** & **Explanation** \\ \hline Service Identifier & Fixed-length meaningless identifier \\ \hline Service Historical Processing Time & Unit: milliseconds \\ \hline Service Quality Level & Classified based on service historical processing time; the smaller the value, the higher the level \\ \hline Computing Resource Cluster Identifier & Fixed-length meaningless identifier \\ \hline Computing Resource Availability & Percentage of available CPUs out of the total number of CPUs \\ \hline Memory Resource Availability & Percentage of available memory out of the total memory \\ \hline Storage Resource Availability & Percentage of available storage out of the total storage \\ \hline Available Computing Resources & Number of available CPUs (normalized) \\ \hline Available Memory Resources & Available memory capacity (normalized) \\ \hline Available Storage Resources & Available storage capacity (normalized) \\ \hline Network Delay & Delay from the current network node to the gateway of the computing cluster \\ \hline \hline \end{tabular}
\end{table}
Table 2: Service information and meanings.  
Figure 4: The architecture of network node.  
* In-network scheduling:  
Based on the service information maintained by the control plane, the scheduling algorithm selects several candidate nodes for a specific service. First, the computing clusters that can provide the service are classified according to the delay level of the service, and then several candidate computing clusters are selected through the scheduling algorithm and the success rate level of the service. The algorithm ranks these candidate clusters from high to low and then determines the number of candidates for different success rate levels. To ensure the success rate, the higher the success rate level, the fewer candidate clusters there are. When issuing flow tables to the data plane, these candidate clusters are sequentially stored in the state area.
* Identifier management:  
This is a fundamental function of the network node, which interacts with the ICN name resolution system to register, query, and resolve identifiers.
* Domain topology generation:  
This function can detect the network status of a path, using methods such as in-band or out-of-band telemetry, and determine the other member nodes within the domain based on certain policies. It also selects the upper-level master node according to specific constraints, such as minimizing overall delay. The specific implementation mechanisms are beyond the scope of this paper.  
* Inter-controller interaction:  
This refers to the communication and coordination between multiple controllers in a distributed software-defined networking (SDN) architecture. This interaction is critical to maintaining consistent and efficient network operation, especially in large-scale deployments. Controllers share information about the state of the network, manage resource allocation, and handle failover scenarios. An effective inter-controller protocol ensures synchronized decision making, load balancing, and scalability, enabling the network to dynamically adapt to changing conditions and demands. The specific mechanisms are beyond the scope of this article.