Tree-Structure Network Management Splitting for Load Balancing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In large-scale tree-structure networks, the root node experiences significant load, leading to management inefficiencies and the need for additional root nodes to alleviate this burden, particularly in systems with many child nodes where coordinated processing and management become challenging.
Innovation Solution
A method for splitting the tree-structure network by dynamically assessing and redistributing child nodes, aggregating them into balanced classes, and deploying new root nodes to distribute the load, ensuring minimal difference in child node totals between classes, thereby optimizing management structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If the network scale is expanded by adding more child nodes to the root node, then the network coverage and functionality are improved, but the service load on the root node increases significantly
Solution Approach 1:
The patent divides the large-scale tree-structure network into multiple smaller management trees by selecting a child node as a new root node. This segmentation reduces the number of child nodes under any single root node, thereby decreasing the service load on the original root node while maintaining overall network functionality. The original root node R with Q(R) child nodes is split into at least two management trees, each with fewer child nodes to manage.
2Ease of operation
If additional root nodes are deployed to offload the root node, then the root node service load is reduced, but the network management complexity increases
Solution Approach 1:
The patent implements a dynamic root node selection mechanism where a child node can be promoted to become a new root node based on the load condition Q(R). This dynamic adjustment allows the network to adaptively restructure itself, reducing management complexity compared to deploying fixed additional root nodes. The system transitions from a static single-root structure to a dynamic multi-root structure only when necessary.
Solution Approach 2:
The patent introduces a load threshold parameter L as an intermediary criterion to determine when root node splitting should occur. This mediator provides a clear, objective condition (Q(R) > L) for triggering the complex operation of adding new root nodes, simplifying the decision-making process and reducing management complexity by establishing explicit rules for structural changes.
3Ease of operation
If the tree-structure network is split into multiple management trees, then the root node service load is reduced, but the node management efficiency may be affected
Solution Approach 1:
The patent applies local quality by creating management trees with balanced child node distributions. When splitting the network, the system selects a child node pi with Q(pi) ≈ Q(R)/2 to become a new root node, ensuring that both management trees have comparable and manageable sizes. This balanced local structure maintains management efficiency within each subtree while reducing the overall load on the original root node.
Data Source
Figure 1
AI summary
A management structure splitting method for a tree-structure network comprises: where Q(R) is greater than L, it is assumed that a node o is a dynamic root node, with regard to any child node Pi of the node o, if Q(Pi) < Q(o)/ 2, all nodes are aggregated into two classes; a new node is deployed or assigned as a newly split management root node, a parent node of one class of nodes in the aggregated two classes in a management structure points to the new management root node, and the operation ends; otherwise, Pi and a subtree thereof are extracted as a new management tree, and then a new management root node is deployed at the position of Pi or a network position above Pi, and Pi points to the new management root node, and the operation ends; or otherwise, where Q(Pi) > Q(o)/ 2, the node Pi is set to be the dynamic root node o, and then re-execution is carried out.