Method for mounting spanId-free node to link tree
The invention discloses a method for mounting a spanId-free node on a link tree, and the method comprises the steps: S1, downwards searching a child node from a root node; s2, judging whether the child node is a node without spanId or not; and S3, judging whether the number of the nodes without the...
Gespeichert in:
Hauptverfasser: | , , , , , , , , , , , , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The invention discloses a method for mounting a spanId-free node on a link tree, and the method comprises the steps: S1, downwards searching a child node from a root node; s2, judging whether the child node is a node without spanId or not; and S3, judging whether the number of the nodes without the spanId is consistent with the number of the child nodes without the spanId, and mounting the child nodes without the spanId. According to the method, newly inserted nodes and child nodes are rearranged through a method of mounting spanId-free nodes on a link tree, so that the number of identifiers in a system is reduced, and the overhead of system resources is saved; the design and implementation process of the system are simplified, and the complexity of communication and synchronization among the nodes is reduced; the response speed and the processing capability of the system are improved; the complexity and the maintenance cost of the system are reduced; new node types and function modules can be conveniently in |
---|