CN107733802B - Node control method and system of distributed network topology structure - Google Patents
Node control method and system of distributed network topology structure Download PDFInfo
- Publication number
- CN107733802B CN107733802B CN201710843090.4A CN201710843090A CN107733802B CN 107733802 B CN107733802 B CN 107733802B CN 201710843090 A CN201710843090 A CN 201710843090A CN 107733802 B CN107733802 B CN 107733802B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- sibling
- father
- identity information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/46—Cluster building
Abstract
The invention relates to a node control method and a system of a distributed network topology structure, wherein the method comprises the following steps: setting a father node to send identity information to other nodes; respectively calculating the weight between the respective identity information and the identity information, judging whether the weight is greater than a preset weight, and if so, attributing to a secondary node; determining whether a sibling node exists, if so, attributing to an optimal node, performing priority sequencing on other auxiliary nodes, and meanwhile, forming a communication network with a topological structure by a father node, the optimal node and the auxiliary nodes; and forwarding the target data stream according to the forwarding request. It also relates to a system comprising: the system comprises a setting module, a classification module, a topological structure network forming module and a control module; the communication network formed by the invention has simple structure, and meanwhile, the communication network can not cause the collapse of the whole network topology structure because of the failure of any node in the network, thereby improving the stability and the safety of the forwarding of the data stream and the effectiveness of the node.
Description
Technical Field
The invention belongs to the field of node control, and particularly relates to a node control method and a node control system of a distributed network topology structure.
Background
The existing method for clustering in the topology control method usually causes the topology control method to be executed for many times to reduce the network efficiency and the survival time because the energy consumption of the cluster head node is too fast, on one hand, the other type of pure power control method has larger energy consumption because each node needs to participate in the communication and calculation required by the method, on the other hand, the generated network topology structure is complex, the difficulty is increased for the routing and data fusion, and the failure of any one tiny node in the network can cause the collapse of the whole network topology structure, thereby greatly improving the cost and reducing the utility of the node.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: in the prior art, the network topology structure is complex, the energy consumption of each node is high, and the failure of any small node in the network can also cause the collapse of the whole network topology structure, so that the cost is greatly improved, and the utility of the node is also reduced.
In order to solve the above technical problem, the present invention provides a node control method for a distributed network topology, including:
setting any node in a network as a father node and sending identity information of the father node to other nodes, wherein the other nodes are all nodes in the network except the father node;
the other nodes respectively calculate the weight between the respective identity information and the identity information of the father node, judge whether the weight is greater than a preset weight, and if so, attribute the node corresponding to the weight greater than the preset weight as a secondary node controlled by the father node;
traversing all secondary nodes, determining whether a sibling node exists, if so, attributing the sibling node as an optimal node, and performing priority sequencing on the rest secondary nodes according to identity information, wherein the rest secondary nodes are all secondary nodes except the optimal node, and meanwhile, a communication network with a topological structure is formed by taking the father node as a control center, the optimal node as a direct node controlled by the father node and the rest secondary nodes as secondary nodes controlled by the father node, wherein the sibling node refers to N nodes for synchronously transmitting the same information, and N is a natural number greater than 1;
and the father node controls the nodes in the communication network to forward the target data stream according to the received forwarding request.
The invention has the beneficial effects that: the method comprises the steps of setting a father node, sending a message to other nodes through the father node, enabling the other nodes to automatically judge the self condition according to the self information, simultaneously determining the self priority according to the self identity information, and forming a communication network with a topological structure according to a direct node controlled by the father node with the father node as a control center and an optimal node and a secondary node controlled by the father node with other secondary nodes after determining the priority information of all the nodes, wherein the formed communication network has a simple structure and clear communication levels among the nodes, so that the forwarding task of target data streams among the nodes is more definite, and simultaneously, the communication network cannot cause the collapse of the whole network topological structure due to the failure of any node in the network because the sibling nodes exist in the communication network, the stability and the safety of the forwarding of the data flow are improved, and the effectiveness of the nodes is also improved.
Further, traversing all the secondary nodes and determining whether there is a sibling node further comprises: and judging whether the similarity value is within a preset threshold range, if not, sequencing all the auxiliary nodes according to the priority sequence, sequencing the auxiliary nodes from high to low according to the priority, taking the auxiliary nodes which are sequenced to the first third as optimal nodes and as direct nodes controlled by the father node, and taking the other two thirds of auxiliary nodes as auxiliary nodes controlled by the father node.
The method has the following further beneficial effects: when no sibling node exists, the nodes which cannot communicate with each other like the nodes with the sibling node exist are described, but in order to make all the nodes have hierarchy differentiation and also to simplify the structure of a communication network and facilitate searching and forwarding of data streams, one third of secondary nodes are obtained according to the priority sequence to serve as optimal nodes, so that even if no sibling node exists, the matched nodes can be inquired firstly in the optimal level, the matching efficiency and the node utility are improved, and the phenomenon that the whole network topology structure is collapsed due to the fact that any one node in the network fails is indirectly avoided.
The invention also relates to a node control system of a distributed network topology, comprising: the system comprises a setting module, a classification module, a topological structure network forming module and a control module;
the setting module is configured to set any node in a network as a parent node, and the parent node sends identity information of the node to other nodes, where the other nodes are all nodes in the network except the parent node;
the classification module is used for the other nodes to respectively calculate weights between the respective identity information and the identity information of the father node, judge whether the weights are greater than a preset weight, and if so, attributing the nodes corresponding to the weights greater than the preset weight to the secondary nodes controlled by the father node;
the topological structure network forming module is used for traversing all secondary nodes, determining whether a sibling node exists, if so, attributing the sibling node as an optimal node, and performing priority sequencing on the rest secondary nodes according to identity information, wherein the rest secondary nodes are all the secondary nodes except the optimal node; meanwhile, a communication network with a topological structure is formed by taking the father node as a control center, taking the optimal node as a direct node controlled by the father node and taking the other secondary nodes as secondary nodes controlled by the father node, wherein the sibling nodes mean that N nodes synchronously transmit the same information, and N is a natural number greater than 1;
and the control module is used for controlling the node in the communication network to forward the target data stream according to the received forwarding request by the father node.
The invention has the beneficial effects that: the system sets a father node first, then sends information to other nodes through the father node, the other nodes automatically judge the state of the other nodes according to the self information, simultaneously determines the priority of the other nodes according to the self identity information, and after the priority information of all the nodes is determined, then forms a communication network with a topological structure according to a direct node which takes the father node as a control center and is controlled by an optimal node as the father node and the secondary nodes which take the other secondary nodes as the father node, the structure of the formed communication network is simple, the communication hierarchy among the nodes is clear, the forwarding task of the target data stream among the nodes is more definite, and simultaneously, because the sibling nodes exist in the communication network, the communication network can not cause the collapse of the whole network topological structure due to the failure of any one node in the network, the stability and the safety of the forwarding of the data flow are improved, and the effectiveness of the nodes is also improved.
Further, the topology network forming module is further configured to determine whether the similarity value is within a preset threshold range, if not, sort all the secondary nodes according to a priority order, take the first one-third secondary nodes of the sorted secondary nodes from high to low according to the priority as optimal nodes and serve as direct nodes controlled by the parent node, and take the remaining two-thirds secondary nodes as secondary nodes controlled by the parent node.
The method has the following further beneficial effects: when no sibling node exists, the nodes which cannot communicate with each other like the nodes with the sibling node exist are described, but in order to make all the nodes have hierarchy differentiation and also to simplify the structure of a communication network and facilitate searching and forwarding of data streams, one third of secondary nodes are obtained according to the priority sequence to serve as optimal nodes, so that even if no sibling node exists, the matched nodes can be inquired firstly in the optimal level, the matching efficiency and the node utility are improved, and the phenomenon that the whole network topology structure is collapsed due to the fact that any one node in the network fails is indirectly avoided.
Drawings
Fig. 1 is a flowchart of a node control method of a distributed network topology according to embodiment 1 of the present invention;
fig. 2 is a flowchart of a node control method of a distributed network topology according to embodiment 2 of the present invention;
fig. 3 is a flowchart of a node control method of a distributed network topology according to embodiment 4 of the present invention;
fig. 4 is a flowchart of a node control method of a distributed network topology according to embodiment 5 of the present invention;
fig. 5 is a schematic structural diagram of a node control system of a distributed network topology according to embodiment 6 of the present invention;
fig. 6 is an architecture diagram of a node control system of a distributed network topology according to the present invention.
Detailed Description
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth by way of illustration only and are not intended to limit the scope of the invention.
Example 1
As shown in fig. 1, an embodiment 1 of the present invention provides a node control method for a distributed network topology, where the node control method includes:
s11, setting any node in the network as a father node and sending the identity information of the father node to other nodes, wherein the other nodes are all nodes in the network except the father node;
in embodiment 1, one node is first selected from all nodes in an area as a parent node, so that other devices can be saved to identify the parent node, and the parent node automatically sends identity information to the other nodes, where the identity information of the parent node includes: i P address, communication rate, memory processing, communication protocol, etc. of the father node, so that other nodes can know which is their father node, and the subsequent nodes can judge the status of their own identity information according to the weight value between the identity information of the father node and the own identity information.
S12, the other nodes respectively calculate the weight between the respective identity information and the identity information of the father node, judge whether the weight is larger than a preset weight, if so, the node corresponding to the weight larger than the preset weight is attributed as the auxiliary node controlled by the father node;
it should be noted that, after the determined parent node, the other nodes may automatically calculate the weight between the identity information of the other nodes and the identity information of the parent node according to the received identity information, for example: the method comprises the steps of calculating a ratio between the communication rate of the node and the communication rate of the father node, and a ratio between the memory processing of the node and the memory processing of the father node, calculating a weight between the node and the father node according to the ratios, comparing the weight with a preset weight through calculating the weight, and attributing the node as a secondary node controlled by the father node if the weight is greater than the preset weight.
S13, traversing all secondary nodes, determining whether a sibling node exists, if so, attributing the sibling node as an optimal node, and performing priority sequencing on the rest secondary nodes according to identity information, wherein the rest secondary nodes are all secondary nodes except the optimal node, and a communication network with a topological structure is formed by taking the father node as a control center, taking the optimal node as a direct node controlled by the father node and taking the rest secondary nodes as secondary nodes controlled by the father node, wherein the sibling node refers to N nodes for synchronously transmitting the same information, and N is a natural number greater than 1;
it should be noted that, after the secondary node is determined, since there may be some nodes that synchronously transmit the same information, if the nodes that synchronously transmit the same information are grouped together, when one of the nodes has a failure problem, the other nodes that transmit the same information together with the failed node may also continue to communicate. Therefore, when the existence of the sibling nodes is judged, the sibling nodes are attributed to the optimal nodes, so that when a certain node fails, the sibling nodes can continue to communicate, the topology structure of the whole network can be prevented from being broken down due to the failure of any node in the network, the utility and the power of the whole communication network can be improved, and the stability and the safety of the forwarding of the data stream can be improved.
In addition, the other secondary nodes are subjected to priority sequencing according to the identity information of the other secondary nodes, and meanwhile, a communication network with a topological structure is formed by taking the father node as a control center, taking the optimal node as a direct node controlled by the father node and taking the other secondary nodes as secondary nodes controlled by the father node. The structure of the communication network is more stable and secure.
And S14, the father node controls the node in the communication network to forward the target data flow according to the received forwarding request.
It should be noted that, after the communication network is determined, the parent node may find a matching node in the communication network to forward the target data stream according to the received forwarding request of the target data stream.
By the method of this embodiment 1, a father node is set first, and then a message is sent to the other nodes by the father node, so that the other nodes automatically judge their own status according to their own information, and at the same time, determine their own priority according to their own identity information, and after determining the priority information of all the nodes, form a communication network with a topology structure according to a direct node controlled by the father node with the father node as a control center and an optimal node as the father node and a secondary node controlled by the father node with the other secondary nodes as the secondary nodes, so that the formed communication network has a simple structure and clear communication hierarchy among the nodes, so that the forwarding task of the target data stream among the nodes is more definite, and meanwhile, since there are sibling nodes in the communication network, the communication network will not cause the collapse of the entire network topology due to the failure of any one node in the network, the stability and the safety of the forwarding of the data flow are improved, and the effectiveness of the nodes is also improved.
Example 2
An embodiment 2 is used to explain whether there is a sibling node in all the secondary nodes, as shown in fig. 2, the method flow in the embodiment 2 is as follows:
s21, setting any node in the network as a father node and sending the identity information of the father node to other nodes, wherein the other nodes are all nodes in the network except the father node;
in this embodiment 2, one node is first selected from all nodes in an area as a parent node, so that other devices can be saved to identify the parent node, and the parent node automatically sends identity information to the other nodes, where the identity information of the parent node includes: i P address, communication rate, memory processing, communication protocol, etc. of the father node, so that other nodes can know which is their father node, and the subsequent nodes can judge the status of their own identity information according to the weight value between the identity information of the father node and the own identity information.
And S22, the other nodes respectively calculate the weight between the respective identity information and the identity information of the father node, judge whether the weight is greater than a preset weight, and if so, attributing the node corresponding to the weight greater than the preset weight as a secondary node controlled by the father node.
In this embodiment 2, after determining the parent node, the other nodes may automatically calculate the weight between the identity information of the other nodes and the identity information of the parent node according to the received identity information, for example: the method comprises the steps of calculating a ratio between the communication rate of the node and the communication rate of the father node, and a ratio between the memory processing of the node and the memory processing of the father node, calculating a weight between the node and the father node according to the ratios, comparing the weight with a preset weight through calculating the weight, and attributing the node as a secondary node controlled by the father node if the weight is greater than the preset weight.
S23, traversing all the secondary nodes, determining whether a sibling node exists, if so, attributing the sibling node as an optimal node, and performing priority sequencing on the other secondary nodes according to identity information, wherein the other secondary nodes are all the secondary nodes except the optimal node, and meanwhile, a communication network with a topological structure is formed by taking the father node as a control center, the optimal node as a direct node controlled by the father node and the other secondary nodes as secondary nodes controlled by the father node, wherein the sibling node refers to N nodes for synchronously transmitting the same information, and N is a natural number greater than 1.
As shown in fig. 2, the specific steps in S23 are as follows:
s231, traversing all the secondary nodes, and calculating the similarity value between any two secondary nodes;
and S232, judging whether the similarity value is within a preset threshold range, if so, marking the two secondary nodes as sibling nodes, wherein the sibling nodes are used for synchronously transmitting the same information and have the same information transmission rate, information among the N nodes is transferred mutually, and N is a natural number greater than 1.
It should be noted that after all the secondary nodes are traversed, the similarity value between any two secondary nodes is calculated, and some nodes may perform repeated calculation, for example: when the similarity values of the first and second are not within the preset range, but the similarity values of the first and third are within the preset similarity value range, the first and third are marked as sibling nodes, and the similarity value of the third and fifth may be within the preset similarity value range, the third and fifth are marked as sibling nodes, which indicates that the third will be the sibling node of the first and fifth simultaneously, i.e. the third transmits information that can be synchronized for the first or fifth, and when the third is the first, the fifth cannot transmit information. Therefore, the same node can form a sibling node with a plurality of nodes, so that the conveying efficiency is greatly improved, and the utility of the node is improved.
S233, when there is a sibling node, attributing the sibling node as an optimal node, and performing priority ordering on other auxiliary nodes according to identity information;
and S234, the rest secondary nodes are all secondary nodes except the optimal node, and a communication network with a topological structure is formed by taking the father node as a control center, taking the optimal node as a direct node controlled by the father node and taking the rest secondary nodes as secondary nodes controlled by the father node.
In this embodiment 2, when there are sibling nodes, the sibling nodes are attributed as optimal nodes, so that when a node in the communication network fails, the sibling nodes can further continue to communicate, which can avoid the disruption of the topology of the entire network due to the failure of any node in the network, thereby also improving the utility and power of the entire communication network, and also improving the stability and security of forwarding data streams.
In addition, the other secondary nodes are subjected to priority sequencing according to the identity information of the other secondary nodes, and meanwhile, a communication network with a topological structure is formed by taking the father node as a control center, taking the optimal node as a direct node controlled by the father node and taking the other secondary nodes as secondary nodes controlled by the father node. The structure of the communication network is more stable and secure.
And S24, the father node controls the node in the communication network to forward the target data flow according to the received forwarding request.
It should be noted that, after the communication network is determined, the parent node may request to forward the target data stream according to the received forwarding request of the target data stream, and the parent node may forward the target data stream by finding the matched node in the communication network.
By the method of this embodiment 2, a father node is first set, and then a message is sent to the other nodes by the father node, so that the other nodes can automatically determine their own status according to their own information, and at the same time, it is determined whether there is a sibling node in all the secondary nodes, a similarity value between any two secondary nodes is calculated, and by determining that the similarity value is compared with a preset threshold range, the same node can form a sibling node with a plurality of nodes, thereby greatly improving the efficiency of the transportation of the sibling node and the utility of the sibling node, and by the relationship between the sibling node and other nodes, a communication network of a topology structure is formed, so that the structure of the communication network is simple, the task of forwarding a target data stream between the nodes is more definite, and the communication network will not cause the collapse of the topology of the whole network due to the failure of any one node in the network, the stability and the safety of the forwarding of the data flow are improved, and the effectiveness of the nodes is also improved.
Example 3
Another embodiment 3 of the present invention is used for explaining that when the parent node controls the node in the communication network to forward the target data stream according to the received forwarding request, the flow of the method of this embodiment 3 is as follows:
s31, setting any node in the network as a father node and sending the identity information of the father node to other nodes, wherein the other nodes are all nodes in the network except the father node;
in embodiment 3, one node is first selected from all nodes in an area as a parent node, so that other devices can be saved to identify the parent node, and the parent node automatically sends identity information to the other nodes, where the identity information of the parent node includes: i P address, communication rate, memory processing, communication protocol, etc. of the father node, so that other nodes can know which is their father node, and the subsequent nodes can judge the status of their own identity information according to the weight value between the identity information of the father node and the own identity information.
S32, the other nodes respectively calculate the weight between the respective identity information and the identity information of the father node, judge whether the weight is larger than a preset weight, if so, the node corresponding to the weight larger than the preset weight is attributed as the auxiliary node controlled by the father node;
it should be noted that, after the determined parent node, the other nodes may automatically calculate the weight between the identity information of the other nodes and the identity information of the parent node according to the received identity information, for example: the method comprises the steps of calculating a ratio between the communication rate of the node and the communication rate of the father node, and a ratio between the memory processing of the node and the memory processing of the father node, calculating a weight between the node and the father node according to the ratios, comparing the weight with a preset weight through calculating the weight, and attributing the node as a secondary node controlled by the father node if the weight is greater than the preset weight.
S33, traversing all secondary nodes, determining whether a sibling node exists, if so, attributing the sibling node as an optimal node, and performing priority sequencing on the rest secondary nodes according to identity information, wherein the rest secondary nodes are all secondary nodes except the optimal node, and a communication network with a topological structure is formed by taking the father node as a control center, taking the optimal node as a direct node controlled by the father node and taking the rest secondary nodes as secondary nodes controlled by the father node, wherein the sibling node refers to N nodes for synchronously transmitting the same information, and N is a natural number greater than 1;
it should be noted that, after the secondary node is determined, since there may be some nodes that synchronously transmit the same information, if the nodes that synchronously transmit the same information are grouped together, when one of the nodes has a failure problem, the other nodes that transmit the same information together with the failed node may also continue to communicate. Therefore, when the existence of the sibling nodes is judged, the sibling nodes are attributed to the optimal nodes, so that when a certain node fails, the sibling nodes can continue to communicate, the topology structure of the whole network can be prevented from being broken down due to the failure of any node in the network, the utility and the power of the whole communication network can be improved, and the stability and the safety of the forwarding of the data stream can be improved.
In addition, the other secondary nodes are subjected to priority sequencing according to the identity information of the other secondary nodes, and meanwhile, a communication network with a topological structure is formed by taking the father node as a control center, taking the optimal node as a direct node controlled by the father node and taking the other secondary nodes as secondary nodes controlled by the father node. The structure of the communication network is more stable and secure.
And S34, when the father node receives the forwarding request, traversing all the sibling nodes in the optimal node, judging whether all the sibling nodes at the current time are in a non-idle state, if so, traversing the other secondary nodes, finding out secondary nodes in an idle state at the current time, and controlling the secondary nodes in the idle state to forward the target data stream.
In this embodiment 3, when a parent node receives a forwarding request, all sibling nodes are traversed to see whether there is a node in an idle state at this time, if yes, it indicates that the node can be called to forward a target data stream, if not, it indicates that no sibling node can forward at this time, then an auxiliary node needs to be searched, if there is an auxiliary node, an auxiliary node is used to forward, so as to avoid that a node that can be forwarded can be found when there is no sibling node, by using this hierarchical manner, a speed of searching can be accelerated, in addition, a sibling node and an auxiliary node can be searched at the same time, and when there is no sibling node, an auxiliary node is used, so that a speed of searching matching can be accelerated, and a forwarding efficiency of a target data stream is improved.
By the method of this embodiment 3, a father node is first set, and then a message is sent to other nodes through the father node, so that other nodes can automatically determine their own status according to their own information, and at the same time, it is determined whether there is a sibling node in all the secondary nodes, so that the same node can form a sibling node with multiple nodes, thereby greatly improving the efficiency of the transportation of the sibling node and the utility of the sibling node, and a communication network with a topology structure is formed through the relationship between the sibling node and other nodes, and then the node capable of forwarding the target data stream in each layer is first searched or synchronously searched in the communication network, and when there is no optimal node, the node is searched in the secondary node, thereby the matching rate can be accelerated, the forwarding efficiency of the target data stream is improved, and also the communication network will not cause the collapse of the topology structure of the entire network due to the failure of any one node in the network, the stability and the safety of the forwarding of the data flow are improved, and the effectiveness of the nodes is also improved.
Example 4
Another embodiment 4 of the present invention is used to explain that when the weight is smaller than the preset weight, as shown in fig. 3, the flow of the method of this embodiment 4 is as follows:
s41, setting any node in the network as a father node and sending the identity information of the father node to other nodes, wherein the other nodes are all nodes in the network except the father node;
in this embodiment 4, one node is first selected from all nodes in an area as a parent node, so that other devices can be saved to identify the parent node, and the parent node automatically sends identity information to the other nodes, where the identity information of the parent node includes: i P address, communication rate, memory processing, communication protocol, etc. of the father node, so that other nodes can know which is their father node, and the subsequent nodes can judge the status of their own identity information according to the weight value between the identity information of the father node and the own identity information.
And S42, the other nodes respectively calculate weights between the respective identity information and the identity information of the father node, judge whether the weights are greater than a preset weight, and when the weights are less than the preset weight, attributing the nodes corresponding to the weights less than the preset weight as alternative nodes controlled by the father node, wherein the alternative nodes refer to nodes which fail when any one node in the communication network forwards a target data stream, the alternative nodes forward the target data stream instead of failed nodes, and the failed nodes are nodes which fail when the target data stream is forwarded.
In this embodiment 4, after determining the parent node, the other nodes may actively calculate the weight between their own identity information and the identity information according to the received identity information, for example: the method comprises the steps of calculating a weight between a self communication rate and a father node according to a ratio between the self communication rate and the communication rate of the father node and a ratio between self memory processing and the memory processing of the father node, comparing the weight with a preset weight by calculating the weight, and if the weight is smaller than the preset weight, attributing the node as an alternative main node controlled by the father node, so as to avoid the situation that the data stream is crowded and cannot be transmitted in time due to the fact that a fault occurs when a peer node forwards a target data stream, and setting an alternative node to replace the faulty peer node for transmission. Therefore, the stability and the safety of the communication network structure are greatly improved, the target data stream is ensured not to be transmitted in time due to the fault, and the flexibility of the communication network is improved.
S43, traversing all secondary nodes, determining whether a sibling node exists, if so, attributing the sibling node as an optimal node, and performing priority sequencing on the rest secondary nodes according to identity information, wherein the rest secondary nodes are all secondary nodes except the optimal node, and a communication network with a topological structure is formed by taking the father node as a control center, taking the optimal node as a direct node controlled by the father node and taking the rest secondary nodes as secondary nodes controlled by the father node, wherein the sibling node refers to N nodes for synchronously transmitting the same information, and N is a natural number greater than 1;
it should be noted that, after the secondary node is determined, since there may be some nodes that synchronously transmit the same information, if the nodes that synchronously transmit the same information are grouped together, when one of the nodes has a failure problem, the other nodes that transmit the same information together with the failed node may also continue to communicate. Therefore, when the existence of the sibling nodes is judged, the sibling nodes are attributed to the optimal nodes, so that when a certain node fails, the sibling nodes can continue to communicate, the topology structure of the whole network can be prevented from being broken down due to the failure of any node in the network, the utility and the power of the whole communication network can be improved, and the stability and the safety of the forwarding of the data stream can be improved.
In addition, the other secondary nodes are subjected to priority sequencing according to the identity information of the other secondary nodes, and meanwhile, a communication network with a topological structure is formed by taking the father node as a control center, taking the optimal node as a direct node controlled by the father node and taking the other secondary nodes as secondary nodes controlled by the father node. The structure of the communication network is more stable and secure.
S44, when the sibling node in the optimal node fails in forwarding the target data stream, selecting at least two alternative nodes to replace the failed sibling node for forwarding the target data stream, wherein the number of the alternative nodes is greater than that of the sibling nodes.
It should be noted that, after the communication network is determined, the parent node may request to forward the target data stream according to the received forwarding request of the target data stream, and the parent node may forward the target data stream by finding the matched node in the communication network.
By the method of this embodiment 4, the node whose weight is smaller than the preset weight is set as the alternative master node, which is to avoid that a peer node fails when forwarding a target data stream, so that the data stream is congested and cannot be transmitted in time, and the setting of the alternative node is to solve such a situation, and replace the failed peer node with the alternative node for transmission. Therefore, the stability and the safety of the communication network structure are greatly improved, the target data stream is ensured not to be transmitted in time due to the fault, and the flexibility of the communication network is improved.
Example 5
An embodiment 5 is used to explain that when a sibling node in the optimal node fails to forward the target data stream, as shown in fig. 4, the method flow in the embodiment 5 is as follows:
s51, setting any node in the network as a father node and sending the identity information of the father node to other nodes, wherein the other nodes are all nodes in the network except the father node;
in embodiment 5, one node is first selected from all nodes in an area as a parent node, so that other devices can be saved to identify the parent node, and the parent node automatically sends identity information to the other nodes, where the identity information of the parent node includes: i P address, communication rate, memory processing, communication protocol, etc. of the father node, so that other nodes can know which is their father node, and the subsequent nodes can judge the status of their own identity information according to the weight value between the identity information of the father node and the own identity information.
S52, the other nodes respectively calculate the weight between the respective identity information and the identity information of the father node, judge whether the weight is larger than a preset weight, if so, the node corresponding to the weight larger than the preset weight is attributed as the auxiliary node controlled by the father node;
it should be noted that, after the determined parent node, the other nodes may automatically calculate the weight between the identity information of the other nodes and the identity information of the parent node according to the received identity information, for example: the method comprises the steps of calculating a ratio between the communication rate of the node and the communication rate of the father node, and a ratio between the memory processing of the node and the memory processing of the father node, calculating a weight between the node and the father node according to the ratios, comparing the weight with a preset weight through calculating the weight, and attributing the node as a secondary node controlled by the father node if the weight is greater than the preset weight.
And S53, traversing all the secondary nodes, determining whether the sibling nodes exist, when the sibling nodes do not exist, sequencing all the secondary nodes according to the priority sequence, sequencing the secondary nodes from high to low according to the priority, taking the secondary nodes which are sequenced to the first third as optimal nodes and as direct nodes controlled by the father nodes, taking the other two thirds of the secondary nodes as secondary nodes controlled by the father nodes, and forming a communication network with a topological structure by taking the father nodes as a control center, taking the optimal nodes as the direct nodes controlled by the father nodes and taking the other secondary nodes as the secondary nodes controlled by the father nodes.
It should be noted that, when there is no sibling node, it indicates a node that cannot communicate with each other like the one that exists, but in order to make the hierarchical distinction among all nodes, and also to simplify the structure of the communication network, facilitate the lookup and forwarding of data flows, and the auxiliary nodes are sorted from high to low according to the priority, the auxiliary node which is sorted to the first third is used as the optimal node and is used as the direct node controlled by the father node, the other two thirds of the auxiliary nodes are used as auxiliary nodes controlled by the father node, so that even if no sibling node exists, the matching node can be inquired firstly in the optimal level, the matching efficiency is improved, the utility of the node is improved, and the phenomenon that the topology structure of the whole network is collapsed due to the failure of any node in the network is indirectly avoided.
S54, when the sibling node in the optimal node fails in forwarding the target data stream, selecting at least two alternative nodes to replace the failed sibling node for forwarding the target data stream, wherein the number of the alternative nodes is greater than that of the sibling nodes.
By the method of this embodiment 5, by setting a father node first, and then sending a message to the other nodes through the father node, the other nodes automatically determine their own status according to their own information, and determine their own priority according to their own identity information, and after determining the priority information of all the nodes, determine whether there is a sibling node, and when there is no sibling node, it indicates that there is no node that can not communicate with each other like the sibling node, but in order to make hierarchical distinction among all the nodes, it is also for the structure of a simple communication network, it is convenient to find and forward data streams, and sequence the sub-nodes according to the priorities from high to low, and take the sub-node that is ranked first one third as the optimal node and as the direct node controlled by the father node, and take the two thirds of the sub-nodes as the sub-nodes controlled by the father node, therefore, even if no sibling node exists, the matching can be inquired firstly in the optimal level, the matching efficiency and the node utility are improved, and the phenomenon that the whole network topology structure is collapsed due to the failure of any node in the network is avoided.
Example 6
Fig. 6 is an architecture diagram of a node communication system of a step-by-step network topology according to the present invention.
Correspondingly, as shown in fig. 5, embodiment 6 of the present invention further provides a node communication system with a step-by-step network topology, where the node communication system includes:
the system comprises a setting module, a classification module, a topological structure network forming module and a control module;
the setting module is configured to set any node in a network as a parent node, and the parent node sends identity information of the node to other nodes, where the other nodes are all nodes in the network except the parent node;
it should be noted that in this embodiment 6, one node is first selected from all nodes in an area as a parent node, so that other devices can be saved to identify the parent node, and the parent node automatically sends identity information to the other nodes, where the identity information of the parent node includes: i P address, communication rate, memory processing, communication protocol, etc. of the father node, so that other nodes can know which is their father node, and the subsequent nodes can judge the status of their own identity information according to the weight value between the identity information of the father node and the own identity information.
The classification module is used for the other nodes to respectively calculate weights between the respective identity information and the identity information of the father node, judge whether the weights are greater than a preset weight, and if so, attributing the nodes corresponding to the weights greater than the preset weight to the secondary nodes controlled by the father node;
it should be noted that, in this embodiment 6, after the determined parent node, the other nodes may automatically calculate the weight between the own identity information and the identity information of the parent node according to the received identity information, for example: the method comprises the steps of calculating a ratio between the communication rate of the node and the communication rate of the father node, and a ratio between the memory processing of the node and the memory processing of the father node, calculating a weight between the node and the father node according to the ratios, comparing the weight with a preset weight through calculating the weight, and attributing the node as a secondary node controlled by the father node if the weight is greater than the preset weight.
The topological structure network forming module is used for traversing all secondary nodes, determining whether a sibling node exists, if so, attributing the sibling node as an optimal node, and performing priority sequencing on the rest secondary nodes according to identity information, wherein the rest secondary nodes are all secondary nodes except the optimal node, and meanwhile, a communication network of a topological structure is formed by taking the father node as a control center, the optimal node as a direct node controlled by the father node and the rest secondary nodes as secondary nodes controlled by the father node, wherein the sibling node refers to N nodes for synchronously transmitting the same information, and N is a natural number greater than 1;
it should be noted that in this embodiment 6, after the secondary node is determined, since there are some nodes that synchronously transmit the same information, if the nodes that synchronously transmit the same information are grouped together, when one of the nodes has a failure problem, the other nodes that transmit the same information together with the failed node can also continue to communicate. Therefore, when the existence of the sibling nodes is judged, the sibling nodes are attributed to the optimal nodes, so that when a certain node fails, the sibling nodes can continue to communicate, the topology structure of the whole network can be prevented from being broken down due to the failure of any node in the network, the utility and the power of the whole communication network can be improved, and the stability and the safety of the forwarding of the data stream can be improved.
In addition, the other secondary nodes are subjected to priority sequencing according to the identity information of the other secondary nodes, and meanwhile, a communication network with a topological structure is formed by taking the father node as a control center, taking the optimal node as a direct node controlled by the father node and taking the other secondary nodes as secondary nodes controlled by the father node. The structure of the communication network is more stable and secure.
And the control module is used for controlling the node in the communication network to forward the target data stream according to the received forwarding request by the father node.
It should be noted that, after the communication network is determined, the parent node may find a matching node in the communication network to forward the target data stream according to the received forwarding request of the target data stream.
Through the system of this embodiment 6, a father node is first set, and then a message is sent to the other nodes through the father node, so that the other nodes automatically determine their own status according to their own information, and at the same time, determine their own priority according to their own identity information, and after determining the priority information of all the nodes, then form a communication network with a topology structure according to a direct node controlled by the father node, which uses the father node as a control center, an optimal node as the father node, and a secondary node controlled by the father node, which uses the other secondary nodes as secondary nodes controlled by the father node, so that the formed communication network has a simple structure and clear communication hierarchy among the nodes, so that the forwarding task of the target data stream among the nodes is more definite, and meanwhile, since there are sibling nodes in the communication network, the communication network will not cause the collapse of the entire network topology structure due to the failure of any one node in the network, the stability and the safety of the forwarding of the data flow are improved, and the effectiveness of the nodes is also improved.
With the above system in embodiment 6, optionally, in embodiment 7, the topology network forming module is specifically configured to traverse all the secondary nodes and calculate a similarity value between any two secondary nodes; and judging whether the similarity value is within a preset threshold range, if so, marking the two secondary nodes as sibling nodes, wherein the sibling nodes are used for synchronously transmitting the same information and have the same information transmission rate, and simultaneously, the information among the N nodes is mutually transferred, and N is a natural number greater than 1.
It should be noted that, after traversing all the secondary nodes, calculating similarity values between any two secondary nodes, some may perform repeated calculation, and when the similarity values of the first and second nodes are not within the preset range, but the similarity values of the first and third nodes are within the preset similarity value range, the first and third nodes are labeled as sibling nodes, and the similarity value of the third node, which may be within the preset similarity value range, and the similarity value of the fifth node, which may be also within the preset similarity value range, the third and fifth nodes are labeled as sibling nodes, which indicates that the third node becomes the first and fifth sibling nodes at the same time, that is, the third node indicates that the third node can transmit the transmission information synchronized with the first or fifth node, and when the third node is the first transmission, the third node cannot transmit the fifth transmission information. Therefore, the same node can form a sibling node with a plurality of nodes, so that the conveying efficiency is greatly improved, and the utility of the node is improved.
With the system in embodiment 6 or 7, optionally, in embodiment 8, the control module is specifically configured to, when the parent node receives the forwarding request, traverse all sibling nodes in the optimal node, determine whether all sibling nodes at the current time are in a non-idle state, if yes, traverse the other secondary nodes, find out a secondary node in an idle state at the current time, and control the secondary node in the idle state to forward the target data stream.
In this embodiment 8, when a parent node receives a forwarding request, it traverses all sibling nodes, and sees whether there is a node in an idle state at this time, if yes, it indicates that the node can be called to forward a target data stream, if not, it indicates that there is no sibling node that can forward at this time, then it needs to search for a secondary node, if there is a secondary node, it uses the secondary node to forward, so as to avoid finding a node that can forward when there is no sibling node, by using this hierarchical manner, the speed of searching can be accelerated, in addition, it can also use the same time to search for the sibling nodes and the secondary node, when there is no sibling node, it can also accelerate the speed of searching for a matching, and improve the forwarding efficiency of the target data stream.
Through the system of this embodiment 8, a father node is first set, and then a message is sent to other nodes through the father node, so that other nodes can automatically determine their own status according to their own information, and at the same time, it is determined whether there is a sibling node in all the secondary nodes, so that the same node can form a sibling node with multiple nodes, thereby greatly improving the efficiency of the transportation of the sibling node and the utility of the sibling node, and through the relationship between the sibling node and other nodes, a communication network with a topology structure is formed, and then the node capable of forwarding the target data stream in each layer is first searched or synchronously searched in the communication network, and when there is no optimal node, the node is searched in the secondary node, thereby the matching rate can be accelerated, the forwarding efficiency of the target data stream is improved, and also the communication network will not cause the collapse of the topology structure of the entire network due to the failure of any one node in the network, the stability and the safety of the forwarding of the data flow are improved, and the effectiveness of the nodes is also improved.
With the above system of embodiment 6 or 7, optionally, further in embodiment 9,
the classification module is specifically configured to, when the weight is smaller than a preset weight, attribute a node corresponding to the weight smaller than the preset weight as an alternative node controlled by the parent node, where the alternative node is a node that fails when any node in the communication network forwards a target data stream, the alternative node forwards the target data stream instead of a failed node, and the failed node is a node that fails when the target data stream is forwarded.
In this embodiment 9, after determining the parent node, the other nodes may actively calculate the weight between their own identity information and the identity information according to the received identity information, for example: the method comprises the steps of calculating a weight between a self communication rate and a father node according to a ratio between the self communication rate and the communication rate of the father node and a ratio between self memory processing and the memory processing of the father node, comparing the weight with a preset weight by calculating the weight, and if the weight is smaller than the preset weight, attributing the node as an alternative main node controlled by the father node, so as to avoid the situation that the data stream is crowded and cannot be transmitted in time due to the fact that a fault occurs when a peer node forwards a target data stream, and setting an alternative node to replace the faulty peer node for transmission. Therefore, the stability and the safety of the communication network structure are greatly improved, the target data stream is ensured not to be transmitted in time due to the fault, and the flexibility of the communication network is improved.
With the above system of example 9, optionally, in this example 10 further,
the control module is specifically configured to select at least two candidate nodes to replace a faulty sibling node for forwarding the target data stream when a fault occurs in forwarding the target data stream by a sibling node in the optimal node, where the number of the candidate nodes is greater than the number of the sibling nodes.
Optionally, in this embodiment 10, the topology network forming module is further configured to determine whether the similarity value is within a preset threshold range, if not, sort all the secondary nodes according to a priority order, take a first third secondary node of the sorted secondary nodes from high to low as an optimal node and serve as a direct node controlled by the parent node, and take the remaining two thirds secondary nodes as secondary nodes controlled by the parent node.
With the system of this embodiment 10, when there is no sibling node, it is explained that nodes which cannot communicate with each other like the sibling node exists among the nodes, but in order to make the hierarchical distinction among all nodes, and also to simplify the structure of the communication network, facilitate the lookup and forwarding of data flows, and the auxiliary nodes are sorted from high to low according to the priority, the auxiliary node which is sorted to the first third is used as the optimal node and is used as the direct node controlled by the father node, the other two thirds of the auxiliary nodes are used as auxiliary nodes controlled by the father node, so that even if no sibling node exists, the matching node can be inquired firstly in the optimal level, the matching efficiency is improved, the utility of the node is improved, and the phenomenon that the topology structure of the whole network is collapsed due to the failure of any node in the network is indirectly avoided.
The reader should understand that in the description of this specification, reference to the description of the terms "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed.
Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment of the present invention.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A node control method of a distributed network topology structure is characterized by comprising the following steps:
setting any node in a network as a father node and sending identity information of the father node to other nodes, wherein the other nodes are all nodes in the network except the father node;
the other nodes respectively calculate the weight between the respective identity information and the identity information of the father node, judge whether the weight is greater than a preset weight, and if so, attribute the node corresponding to the weight greater than the preset weight as a secondary node controlled by the father node;
traversing all secondary nodes, determining whether a sibling node exists, if so, attributing the sibling node as an optimal node, and performing priority sequencing on the rest secondary nodes according to identity information, wherein the rest secondary nodes are all secondary nodes except the optimal node, and meanwhile, a communication network with a topological structure is formed by taking the father node as a control center, the optimal node as a direct node controlled by the father node and the rest secondary nodes as secondary nodes controlled by the father node, wherein the sibling node refers to N nodes for synchronously transmitting the same information, and N is a natural number greater than 1;
the father node controls the nodes in the communication network to forward the target data stream according to the received forwarding request;
wherein the identity information of the parent node comprises: communication rate and memory processing; the step of calculating the weight between the identity information of each of the other nodes and the identity information of the parent node by the other nodes specifically includes: and calculating a rate ratio between the communication rates of the other nodes and the communication rate of the father node, calculating a memory ratio between the memory processing of the other nodes and the memory processing of the father node, and calculating a weight between the other nodes and the father node according to the rate ratio and the memory ratio.
2. The node control method of claim 1, wherein traversing all secondary nodes and determining whether a sibling node exists comprises:
traversing all the secondary nodes, and calculating the similarity value between any two secondary nodes;
and judging whether the similarity value is within a preset threshold range, if so, marking the two secondary nodes as sibling nodes, wherein the sibling nodes are used for synchronously transmitting the same information and have the same information transmission rate, and simultaneously, the information among the N nodes is mutually transferred, and N is a natural number greater than 1.
3. The node control method according to claim 1 or 2, wherein the parent node controlling the node in the communication network to forward the target data flow according to the received forwarding request comprises:
and traversing all sibling nodes in the optimal node when the father node receives a forwarding request, judging whether all the sibling nodes at the current moment are in a non-idle state, traversing the other secondary nodes if all the sibling nodes at the current moment are in the non-idle state, finding out the secondary nodes in the idle state at the current moment, and controlling the secondary nodes in the idle state to forward the target data stream.
4. The node control method according to claim 1 or 2, characterized by further comprising:
and when the weight is smaller than a preset weight, attributing a node corresponding to the weight smaller than the preset weight as a standby node controlled by the father node, wherein the standby node refers to a node which fails when any node in the communication network forwards a target data stream, the standby node forwards the target data stream instead of a failed node, and the failed node is a node which fails when the target data stream is forwarded.
5. The node control method of claim 4, wherein the parent node controlling nodes in the communication network to forward the target data stream according to the received forwarding request further comprises:
and when the sibling nodes in the optimal nodes fail in forwarding the target data stream, selecting at least two alternative nodes to replace the failed sibling nodes for forwarding the target data stream, wherein the number of the alternative nodes is greater than that of the sibling nodes.
6. A node control system of a distributed network topology, the node control system comprising:
the system comprises a setting module, a classification module, a topological structure network forming module and a control module;
the setting module is configured to set any node in a network as a parent node, and the parent node sends identity information of the node to other nodes, where the other nodes are all nodes in the network except the parent node;
the classification module is used for the other nodes to respectively calculate weights between the respective identity information and the identity information of the father node, judge whether the weights are greater than a preset weight, and if so, attributing the nodes corresponding to the weights greater than the preset weight to the secondary nodes controlled by the father node;
the topological structure network forming module is used for traversing all secondary nodes, determining whether a sibling node exists, if so, attributing the sibling node as an optimal node, and performing priority sequencing on the rest secondary nodes according to identity information, wherein the rest secondary nodes are all the secondary nodes except the optimal node; meanwhile, a communication network with a topological structure is formed by taking the father node as a control center, taking the optimal node as a direct node controlled by the father node and taking the other secondary nodes as secondary nodes controlled by the father node, wherein the sibling nodes mean that N nodes synchronously transmit the same information, and N is a natural number greater than 1;
the control module is used for controlling the father node to forward the target data stream by the node in the communication network according to the received forwarding request;
wherein the identity information of the parent node comprises: communication rate and memory processing; the classification module is specifically configured to calculate a rate ratio between the communication rates of the other nodes and the communication rate of the parent node, calculate a memory ratio between the memory processing of the other nodes and the memory processing of the parent node, and calculate a weight between the other nodes and the parent node according to the rate ratio and the memory ratio.
7. The node control system according to claim 6, wherein the topology network formation module is specifically configured to traverse all secondary nodes and calculate a similarity value between any two secondary nodes; and judging whether the similarity value is within a preset threshold range, if so, marking the two secondary nodes as sibling nodes, wherein the sibling nodes are used for synchronously transmitting the same information and have the same information transmission rate, and simultaneously, the information among the N nodes is mutually transferred, and N is a natural number greater than 1.
8. The node control system according to claim 6 or 7, wherein the control module is specifically configured to, when the parent node receives a forwarding request, traverse all sibling nodes in the optimal node, determine whether all sibling nodes at the current time are in a non-idle state, if yes, traverse the remaining secondary nodes, find out a secondary node in an idle state at the current time, and control the secondary node in the idle state to forward the target data stream.
9. The node control system according to claim 6 or 7, wherein the classification module is specifically configured to, when the weight is smaller than a preset weight, attribute a node that is smaller than the preset weight as an alternative node controlled by the parent node, where the alternative node is a node that fails when any node in the communication network forwards a target data stream, and the alternative node forwards the target data stream instead of a failed node, and the failed node is a node that fails when the target data stream is forwarded.
10. The node control system according to claim 9, wherein the control module is specifically configured to select at least two candidate nodes to replace a faulty sibling node for forwarding the target data stream when a sibling node in the optimal node fails to forward the target data stream, where the number of the candidate nodes is greater than the number of the sibling nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710843090.4A CN107733802B (en) | 2017-09-18 | 2017-09-18 | Node control method and system of distributed network topology structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710843090.4A CN107733802B (en) | 2017-09-18 | 2017-09-18 | Node control method and system of distributed network topology structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107733802A CN107733802A (en) | 2018-02-23 |
| CN107733802B true CN107733802B (en) | 2020-11-13 |
Family
ID=61207662
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710843090.4A Active CN107733802B (en) | 2017-09-18 | 2017-09-18 | Node control method and system of distributed network topology structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107733802B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110932981B (en) * | 2019-11-27 | 2021-10-08 | 北京宝兰德软件股份有限公司 | Data exchange system supporting automatic routing |
| CN112995241B (en) * | 2019-12-02 | 2022-11-18 | 中国电信股份有限公司 | Service scheduling method and device |
| CN116094952A (en) * | 2023-01-04 | 2023-05-09 | 中国联合网络通信集团有限公司 | Method, device, equipment and storage medium for determining network structure similarity |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101959054A (en) * | 2009-07-14 | 2011-01-26 | 中国电信股份有限公司 | Integrated P2P (Peer-To-Peer) VOD (Video-On-Demand) system and partner node selecting method |
| CN101997922A (en) * | 2010-11-19 | 2011-03-30 | 武汉大学 | Cost optimization-based P2P streaming media coverage network topology structure adjustment method |
| CN102185916A (en) * | 2011-04-27 | 2011-09-14 | 西安电子科技大学 | Method for establishing sensor network with small world and scale-free properties |
| CN102984009A (en) * | 2012-12-06 | 2013-03-20 | 北京邮电大学 | Disaster recovery backup method for VoIP (Voice overInternet Protocol) system based on P2P |
| CN105072159A (en) * | 2015-07-17 | 2015-11-18 | 杭州施强网络科技有限公司 | Node management list structure in P2P networking and management method thereof |
| CN106165356A (en) * | 2014-02-13 | 2016-11-23 | 洛克波特网络股份有限公司 | The method of routing packets in distributed direct interference networks |
| CN106452886A (en) * | 2016-10-31 | 2017-02-22 | 中国联合网络通信集团有限公司 | Super node selection method and apparatus |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10432500B2 (en) * | 2015-11-09 | 2019-10-01 | Atmel Corporation | Debugger for wireless sensor networks |
-
2017
- 2017-09-18 CN CN201710843090.4A patent/CN107733802B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101959054A (en) * | 2009-07-14 | 2011-01-26 | 中国电信股份有限公司 | Integrated P2P (Peer-To-Peer) VOD (Video-On-Demand) system and partner node selecting method |
| CN101997922A (en) * | 2010-11-19 | 2011-03-30 | 武汉大学 | Cost optimization-based P2P streaming media coverage network topology structure adjustment method |
| CN102185916A (en) * | 2011-04-27 | 2011-09-14 | 西安电子科技大学 | Method for establishing sensor network with small world and scale-free properties |
| CN102984009A (en) * | 2012-12-06 | 2013-03-20 | 北京邮电大学 | Disaster recovery backup method for VoIP (Voice overInternet Protocol) system based on P2P |
| CN106165356A (en) * | 2014-02-13 | 2016-11-23 | 洛克波特网络股份有限公司 | The method of routing packets in distributed direct interference networks |
| CN105072159A (en) * | 2015-07-17 | 2015-11-18 | 杭州施强网络科技有限公司 | Node management list structure in P2P networking and management method thereof |
| CN106452886A (en) * | 2016-10-31 | 2017-02-22 | 中国联合网络通信集团有限公司 | Super node selection method and apparatus |
Non-Patent Citations (1)
| Title |
|---|
| 混合式对等网络Kazaa模型结构及其分析研究;蒋成;《信息安全与技术》;20130630;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107733802A (en) | 2018-02-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107733802B (en) | Node control method and system of distributed network topology structure | |
| US9049131B2 (en) | Network system and load balancing method | |
| Prasanth et al. | Implementation of efficient intra-and inter-zone routing for extending network consistency in wireless sensor networks | |
| CN108770036B (en) | Inter-cluster-head communication method and wireless sensor network routing device | |
| US20090164576A1 (en) | Methods and systems for peer-to-peer systems | |
| CN103746911A (en) | SDN (software defined networking) structure and communication method thereof | |
| CN107659974A (en) | Wireless sense network route method, apparatus, equipment and computer-readable recording medium | |
| US20190089611A1 (en) | Switch health index for network devices | |
| CN112350949A (en) | Rerouting congestion control method and system based on flow scheduling in software defined network | |
| JP6256343B2 (en) | Network, network node, distribution method, and network node program | |
| Venkataraman et al. | A cluster-based approach to fault detection and recovery in wireless sensor networks | |
| Abdulsaheb et al. | Improving ad hoc network performance by using an efficient cluster based routing algorithm | |
| CN106411731B (en) | Method and device for auto-negotiation LACP protocol reference system and reference port | |
| Ambika et al. | A novel energy efficient routing algorithm for MPLS-MANET using fuzzy logic controller | |
| Bettstetter et al. | On the message and time complexity of a distributed mobility-adaptive clustering algorithm in wireless ad hoc networks | |
| CN108040016B (en) | WSN (wireless sensor network) network congestion control scheduling method for collecting cargo information of airport cargo station | |
| US11595292B2 (en) | Dynamic node cluster discovery in an unknown topology graph | |
| CN110212941B (en) | Event-driven heterogeneous node-based clustering method | |
| Besharati et al. | A topology-aware application layer multicast protocol | |
| Dong et al. | Topology control mechanism based on link available probability in aeronautical ad hoc network | |
| Baolinr et al. | Distributed QoS multicast routing protocol in ad hoc networks | |
| CN102647424A (en) | Data transmission method and data transmission device | |
| CN108696460B (en) | Message forwarding method and device | |
| Aziz et al. | Enhancing multipath routing using an efficient multicriteria sorting technique | |
| CN105530189A (en) | Method for forwarding messages in TRILL network, and routing bridge |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |