SDN Controller Cross-Command Timing via Balanced Subtree Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In Software-Defined Networking (SDN), the total time for sending cross-connection commands is uncontrollable due to random ordering, preventing minimization of this time during network rerouting processes.
Innovation Solution
The method involves splitting the network into balanced single-homed subtrees and using a concurrent sending manner with a fixed order, or generating a minimum spanning tree with the centralized controller as a root node, to optimize the timing of cross-connection command delivery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If cross-connection commands are sent in a random order, then the sending process is simple, but the total time for sending commands is uncontrollable and cannot be minimized
Solution Approach 1:
The patent segments the network into multiple subtrees rooted at different access nodes of the centralized controller. Each subtree is independently managed and commands are sent in a structured sequence within each subtree, which then enables parallel processing across subtrees. This segmentation transforms the uncontrollable random sending into a controlled hierarchical process that minimizes total time while managing complexity.
Solution Approach 2:
The patent implements dynamic command sending by determining sending sequences based on real-time network topology and subtree structures. The sending order is not fixed but adapts to the network configuration, allowing the system to optimize command delivery time dynamically. This dynamic approach enables time minimization without requiring overly complex static control mechanisms.
2Loss of time
If cross-connection commands are sent sequentially from one end to the other, then the sending order is fixed and controllable, but the total time increases significantly
Solution Approach 1:
The patent divides the network into multiple independent subtrees that can be processed in parallel. Instead of sending commands sequentially across the entire network, the segmented approach allows simultaneous command sending to different subtrees, dramatically reducing total time while maintaining control through structured subtree management.
Solution Approach 2:
The patent transitions from one-dimensional sequential sending to multi-dimensional parallel sending by utilizing the tree structure hierarchy. Commands are sent concurrently across multiple branches of the network tree, effectively adding a parallelism dimension that reduces total sending time without sacrificing controllability.
3Loss of time
If the network is divided into multiple subtrees with concurrent sending, then the total time is minimized, but the method complexity increases
Solution Approach 1:
The patent uses segmentation to divide the network into subtrees, which simplifies the control problem by creating independent manageable units. Each subtree can be processed separately with its own sending sequence, reducing the overall complexity compared to managing the entire network as a single unit while still achieving parallel execution.
Solution Approach 2:
The patent performs preliminary actions by pre-establishing the subtree structure and determining optimal sending sequences before actual command transmission. This advance preparation of the network topology and sending plan reduces the complexity of real-time control during command sending, as the framework is already in place.
Data Source
Figure 1~3
Figure 4~5
Figure 6A
AI summary
The present invention relates to the communications field, and discloses a method and an apparatus for sending a cross command, which can automatically control a total time for sending cross commands, and achieve time optimization. The method provided in the present invention is applied to a centralized controller, where a network includes p nodes; the centralized controller is connected to the network by using k access nodes of the p nodes, where p≥k≥2, and both k and p are integers; and the method includes: acquiring, based on a network topology and the k access nodes, k balanced single-homed subtrees, where the k balanced single-homed subtrees include the p nodes, nodes in any two of the balanced single-homed subtrees have no intersection, and quantities of nodes in the k balanced single-homed subtrees are balanced; and concurrently sending cross commands to the nodes in the k balanced single-homed subtrees in a descending order of numbers of layers at which nodes in each balanced single-homed subtree are located.