CN107395480A - Tree topology network recovery method based on self-organizing differentiated control - Google Patents

Tree topology network recovery method based on self-organizing differentiated control Download PDF

Info

Publication number
CN107395480A
CN107395480A CN201710522625.8A CN201710522625A CN107395480A CN 107395480 A CN107395480 A CN 107395480A CN 201710522625 A CN201710522625 A CN 201710522625A CN 107395480 A CN107395480 A CN 107395480A
Authority
CN
China
Prior art keywords
node
network
network recovery
level
message
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.)
Withdrawn
Application number
CN201710522625.8A
Other languages
Chinese (zh)
Inventor
张冰
姜燕红
张奭
罗盛
于欣
张宇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201710522625.8A priority Critical patent/CN107395480A/en
Publication of CN107395480A publication Critical patent/CN107395480A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/44—Star or tree networks
    • 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/04—Network management architectures or arrangements
    • H04L41/044—Network management architectures or arrangements comprising hierarchical management structures
    • 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/06—Management of faults, events, alarms or notifications
    • H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a kind of restoration methods of the tree topology network based on self-organizing differentiated control, mainly solve the problems, such as that prior art can not quickly recover network to tree topology network because of power down failure or after restarting.Its implementation is：Centroid and all via nodes independently initiate network recovery, complete the network recovery between this node and child node；After slave node receives the recovery order from the superior node itself being subordinated to, report itself and be subordinated to the network recovery information of all nodes of itself；The summarizing and reporting of the progress network recovery information of final stage via node from bottom to top, until reaching Centroid completes network recovery；The present invention can utilize the original network of the fast quick-recovery of historic network information stored in the network equipment, improve network recovery efficiency, can be applied to LAN and the access network field of various communications.

Description

Tree topology network recovery method based on self-organizing differentiated control
Technical field
The invention belongs to communication technical field, is related to the restoration methods of tree topology network, can be applied to various communications Access network or LAN.
Background technology
In the access network based on wired or wireless medium or LAN, the logical topology knot of one tree-shaped of generally use Structure.In this network structure, the slave node of a Centroid and multiple different stages be present, in addition to Centroid Other nodes be referred to as slave node.It is direct-connected below slave node to have other slave nodes, referred to as via node.Slave node Below without direct-connected other slave nodes, referred to as leaf node.The via node being directly connected with Centroid is referred to as one-level Via node, the via node being directly connected with one-level via node are two level via node, by that analogy.Centroid and one Row data communication can directly be entered between level via node, Centroid and non-one-level via node can carry out data indirectly and lead to Letter.
Network for having set up completion, after all devices are because occurring power down failure or restarting in network, centromere Point and each slave node would generally preserve history mesh information, including network identity, this node identification, this node are subordinated to Superior node identifies and is subordinated to the downstream site mark of this node.But the mode of existing method generally use networking again is realized Network recovery, i.e. Centroid guide all slave nodes of the whole network to complete networking process according to complete networking flow.Again During networking, because Centroid does not know the situation of slave node in network, it usually needs use and sought step by step by beacon frame Mode carry out networking, complete the registration and receiving of all slave nodes.This process needs to rebuild the network information and road By information, flow complexity is cumbersome, it usually needs takes a long time.
The content of the invention
It is an object of the invention to need networking again for above-mentioned prior art because of power down failure or after restarting, and cause Communication spends the deficiency of time length, proposes a kind of tree topology network recovery method based on self-organizing differentiated control, to utilize History mesh information carries out network recovery, reduces the time of network recovery, improves network recovery efficiency.
To achieve the above object, technical scheme is as follows:
(1) a Centroid K, one-level to N-1 levels via node and N level leaf sections are set in tree topology network Point, N >=2；
(2) Centroid in network and each via node send " network recovery order by way of spot broadcasting Message P ", each via node set timer according to the level of itself；
(3) each via node or leaf node receive " the network recovery life from the superior node itself being subordinated to After making message P ", " superior node that network recovery response message R " is subordinated to itself is replied；
(4) Centroid or each via node receive from be subordinated to itself via node or leaf node " net After network recovers response message R ", " network recovery confirmation message V " gives the node, completes the via node to being subordinated to itself for reply Or the network recovery of leaf node；
(5) each N-1 level via nodes are received from " the network recovery response report for being subordinated to all leaf nodes of itself Literary R " or timer expiry, " network recovery remittance is generated according to the network recovery situation for being subordinated to all N levels leaf nodes of itself Total message S ", and transmission should " network recovery collects the superior node that message S " is subordinated to itself；
(6) each non-N-1 levels via node receive from be subordinated to the via node of itself " network recovery collects message After S ", judge whether to complete to the network recovery for the via node for being subordinated to itself：
If having completed, complete to " network recovery collects the network recovery of the interdependent node in message S "；
If not completing, to the via node transmission of itself is subordinated to, " network recovery command message P ", waits its reply " after network recovery response message R ", be sent to " network recovery confirmation message V ", and complete to " network recovery collects message S " In interdependent node network recovery；
(7) each non-N-1 levels via node receive from be subordinated to all via nodes of itself " network recovery collects Message S " or timer expiry, collect all network recovery information, generate it is new " network recovery collects message S ", and by its It is sent to the superior node itself being subordinated to；
(8) Centroid receive from be subordinated to all one-level via nodes of itself " network recovery collects message S " Or timer expiry, complete the recovery to whole network.
The present invention has advantages below：
1. the present invention actively initiates network recovery using via nodes at different levels and orderly management is subordinated to the subordinate section of itself The differentiated control mechanism of point, it is compared with networking again, while higher network resource utilization is kept, reduces because step by step Seek, register and receive flow to cause the waste of Internet resources, finally reduce network recovery time, improve network recovery effect Rate.
2. the present invention improves the independence of network recovery because via nodes at different levels can actively initiate network recovery, Realize the fast quick-recovery of network.
Brief description of the drawings
Fig. 1 is the implementation process figure of the present invention；
Fig. 2 is the tree-network topology scene graph that the present invention uses.
Embodiment
Embodiments of the invention are further elaborated below in conjunction with the accompanying drawings.
Reference picture 2, the tree topology network structure of this example is described as follows：
A two one-level via node B1, B2 and one-level leaf node B3 are set under Centroid A, at first one Two two levels via node C1 and C2 are set under level via node B1, the 3rd two is set under second one-level via node B2 A level via node C3 and two level leaf node C4；
Two three-levels leaf node D1 and D2 are set under first two level via node C1, in second two level relaying section Two three-levels leaf node D3 and D4 are set under point C2, two three-level leaf nodes are set under the 3rd two level via node C3 D5 and D6.
Give above-mentioned tree topology network settings mark, and to slave nodes at different levels set respectively it is respective identify, level and The interstitial content of oneself is subordinated to, wherein：
Tree topology network identity is NID；
Centroid A node identification is MA, Centroid A level is LA；
The interstitial content for being subordinated to Centroid A is NA；
First one-level via node B1 node identification is MB1, first one-level via node B1 level is LB1；
The interstitial content for being subordinated to first one-level via node B1 is NB1；
Second one-level via node B2 node identification is MB2, second one-level via node B2 level is LB2；
The interstitial content for being subordinated to second one-level via node B2 is NB2；
One-level leaf node B3 node identification is MB3, one-level leaf node B3 level is LB3；
The interstitial content for being subordinated to one-level leaf node B3 is NB3；
First two level via node C1 node identification is MC1, second two level via node C1 level is LC1；
The interstitial content for being subordinated to first two level via node C1 is NC1；
Second two level via node C2 node identification is MC2, second two level via node C2 level is LC2；
The interstitial content for being subordinated to second two level via node C2 is NC2；
3rd two level via node C3 node identification is MC3, two level via node C3 level is LC3；
The interstitial content for being subordinated to the 3rd two level via node C3 is NC3；
Two level leaf node C4 node identification is MC4, two level leaf node C4 level is LC4；
The interstitial content for being subordinated to two level leaf node C4 is NC4；
First three-level leaf node D1 node identification is MD1, first three-level leaf node D1 level is LD1；
The interstitial content for being subordinated to first three-level leaf node D1 is ND1；
Second three-level leaf node D2 node identification is MD2, second three-level leaf node D2 level is LD2；
The interstitial content for being subordinated to second three-level leaf node D2 is ND2；
3rd three-level leaf node D3 node identification is MD3, the 3rd three-level leaf node D3 level is LD3；
The interstitial content for being subordinated to the 3rd three-level leaf node D3 is ND3；
4th three-level leaf node D4 node identification is MD4, the 4th three-level leaf node D4 level is LD4；
The interstitial content for being subordinated to the 4th three-level leaf node D4 is ND4；
5th three-level leaf node D5 node identification is MD5, the 5th three-level leaf node D5 level is LD5；
The interstitial content for being subordinated to the 5th three-level leaf node D5 is ND5；
6th three-level leaf node D6 node identification is MD6, the 6th three-level leaf node D6 level is LD6；
The interstitial content for being subordinated to the 6th three-level leaf node D6 is ND6；
The Centroid A preserves history mesh information, and the history mesh information includes network identity, Centroid mark Know and be subordinated to the downstream site mark of Centroid.Via node and leaf node preserve history mesh information, including net The superior node that network mark, this node identification, this node are subordinated to identifies and is subordinated to the downstream site mark of this node.
Reference picture 1, this example realize that step is as follows：
Step 1, Centroid or via node send " network recovery command message P ".
Centroid A or via node B1, B2, C1, C2, C3 are after because of power-off fault or restarting, by local wide The mode broadcast sends that " network recovery command message P ", hierarchical arrangement timer duration of the via node according to residing for itself simultaneously open Dynamic timer, wherein：" network recovery command message P " simultaneously starts first timer T for Centroid A transmissionsA, first timer TA Timing be 30 seconds, should " network recovery command message P " include tree topology network identity NID, Centroid A level LAWith Centroid A node identification MA；
" network recovery command message P " simultaneously starts second timer T for first one-level via node B1 transmissionB1, second is fixed When device TB1Timing be 20 seconds, should " network recovery command message P " includes the node identification M of oneselfB1, level LB1With from One's own interstitial content NB1；
" network recovery command message P " simultaneously starts the 3rd timer T for second one-level via node B2 transmissionB2, the 3rd is fixed When device TB2Timing be 20 seconds, should " network recovery command message P " includes the node identification M of oneselfB2, level LB2With from One's own interstitial content NB2；
" network recovery command message P " simultaneously starts the 4th timer T for first two level via node C1 transmissionC1, the 4th is fixed When device TC1Timing be 10 seconds, should " network recovery command message P " includes the node identification M of oneselfC1, level LC1With from One's own interstitial content NC1；
" network recovery command message P " simultaneously starts the 5th timer T for second two level via node C2 transmissionC2, the 5th is fixed When device TC2Timing be 10 seconds, should " network recovery command message P " includes the node identification M of oneselfC2, level LC2With from One's own interstitial content NC2；
" network recovery command message P " simultaneously starts the 6th timer T for 3rd two level via node C3 transmissionC3, the 6th is fixed When device TC3Timing be 10 seconds, should " network recovery command message P " includes the node identification M of oneselfC3, level LC3With from One's own interstitial content NC3。
Step 2, node receive the superior node that itself is subordinated to " network recovery command message P " replys that " network is extensive Complex response message R ".
First one-level via node B1 receives " network recovery command message P ", the reply " network that Centroid A is sent Recover response message R " and give Centroid A, " network recovery response message R ", the node identification M of oneself should be includedB1, level LB1 Be subordinated to the interstitial content N of oneselfB1；
Second one-level via node B2 receives " network recovery command message P ", the reply " network that Centroid A is sent Recover response message R " and give Centroid A, " network recovery response message P ", the node identification M of oneself should be includedB2, level LB2 Be subordinated to the interstitial content N of oneselfB2；
First two level via node C1 receives " the network recovery command message that first one-level via node B1 is sent P ", " network recovery response message R " gives first one-level via node B1, should " network recovery response message R ", comprising certainly for reply Oneself node identification MC1, level LC1Be subordinated to the interstitial content N of oneselfC1；
Second two level via node C2 receives " the network recovery command message that first one-level via node B1 is sent P ", " network recovery response message R " gives first one-level via node B1, should " network recovery response message R ", comprising certainly for reply Oneself node identification MC2, level LC2Be subordinated to the interstitial content N of oneselfC2；
3rd two level via node C3 receives " the network recovery command message that second one-level via node B2 is sent P ", " network recovery response message R " gives second one-level via node B2, should " network recovery response message R ", comprising certainly for reply Oneself node identification MC3, level LC3Be subordinated to the interstitial content N of oneselfC3；
First three-level leaf node D1 receives " the network recovery command message that first two level via node C1 is sent P ", " network recovery response message R " gives first two level via node C1, should " network recovery response message R ", comprising certainly for reply Oneself node identification MD1, level LD1Be subordinated to the interstitial content N of oneselfD1；
Second three-level leaf node D2 receives " the network recovery command message that first two level via node C1 is sent P ", " network recovery response message R " gives first two level via node C1, should " network recovery response message R ", comprising certainly for reply Oneself node identification MD2, level LD2Be subordinated to the interstitial content N of oneselfD2；
3rd three-level leaf node D3 receives " the network recovery command message that second two level via node C2 is sent P ", " network recovery response message R " gives second two level via node C2, should " network recovery response message R ", comprising certainly for reply Oneself node identification MD3, level LD3Be subordinated to the interstitial content N of oneselfD3；
4th three-level leaf node D4 receives " the network recovery command message that second two level via node C2 is sent P ", " network recovery response message R " gives second two level via node C2, should " network recovery response message R ", comprising certainly for reply Oneself node identification MD4, level LD4Be subordinated to the interstitial content N of oneselfD4；
5th three-level leaf node D5 receives " the network recovery command message that the 3rd two level via node C3 is sent P ", " network recovery response message R " gives the 3rd two level via node C3, should " network recovery response message R ", comprising certainly for reply Oneself node identification MD5, level LD5Be subordinated to the interstitial content N of oneselfD5；
6th three-level leaf node D6 receives " the network recovery command message that the 3rd two level via node C3 is sent P ", " network recovery response message R " gives the 3rd two level via node C3, should " network recovery response message R ", comprising certainly for reply Oneself node identification MD6, level LD6Be subordinated to the interstitial content N of oneselfD6。
Step 3, via node or Centroid receive be subordinated to the child node of itself " network recovery response message R ", " network recovery confirmation message V " gives the node, and completes the network recovery to the node for reply.
What Centroid A received that first one-level via node B1 send " network recovery response message R ", judges that first is fixed When device TAIt is whether overtime：If first timer TAHave not timed out, then " network recovery confirmation message V " is in first one-level for reply After node B1, and complete the network recovery to first one-level via node B1；If first timer TAHave timed out, then abandon Should " network recovery response message R "；
What Centroid A received that second one-level via node B2 send " network recovery response message R ", judges that first is fixed When device TAIt is whether overtime：If first timer TAHave not timed out, then " network recovery confirmation message V " is in second one-level for reply After node B2, and complete the network recovery to second one-level via node B2；If first timer TAHave timed out, then abandon Should " network recovery response message R "；
Centroid A receives " the network recovery response message R ", judgement first timer T that one-level leaf node B3 is sentA It is whether overtime：If first timer TAHave not timed out, then reply " network recovery confirmation message V " gives one-level leaf node B3, and Complete the network recovery to one-level leaf node B3；If first timer TAHave timed out, then abandoning should " network recovery response report Literary R "；
First one-level via node B1 receives " the network recovery response message that first two level via node C1 is sent R ", judge second timer TB1It is whether overtime：If second timer TB1Have not timed out, then reply " network recovery confirmation message V " To first two level via node C1, and complete the network recovery to two level via node C1；If second timer TB1Surpass When, then abandoning should " network recovery response message R "；
First one-level via node B1 receives " the network recovery response message that second two level via node C2 is sent R ", judge second timer TB1It is whether overtime：If second timer TB1Have not timed out, then reply " network recovery confirmation message V " To second two level via node C2, and complete the network recovery to second two level via node C2；If second timer TB1Have timed out, then abandoning should " network recovery response message R "；
Second one-level via node B2 receives " the network recovery response message that the 3rd two level via node C3 is sent R ", judge the 3rd timer TB2It is whether overtime：If the 3rd timer TB2Have not timed out, then reply " network recovery confirmation message V " To the 3rd two level via node C3, and complete the network recovery to the 3rd two level via node C3；If the 3rd timer TB2Have timed out, then abandoning should " network recovery response message R "；
Second one-level via node B2 receives " network recovery response message R ", the judgement that two level leaf node C4 is sent 3rd timer TB2It is whether overtime：If the 3rd timer TB2Have not timed out, then " network recovery confirmation message V " gives two level for reply Leaf node C4, and complete the network recovery to two level leaf node C4；If the 3rd timer TB2Have timed out, then abandoning should " network recovery response message R "；
First two level via node C1 receives " the network recovery response message that first three-level leaf node D1 is sent R ", judge the 4th timer TC1It is whether overtime：If the 4th timer TC1Have not timed out, then reply " network recovery confirmation message V " To first three-level leaf node D1, and complete the network recovery to first three-level leaf node D1；If the 4th timer TC1Have timed out, then abandoning should " network recovery response message R "；
First two level via node C1 receives " the network recovery response message that second three-level leaf node D2 is sent R ", judge the 4th timer TC1It is whether overtime：If the 4th timer TC1Have not timed out, then reply " network recovery confirmation message V " To second three-level leaf node D2, and complete the network recovery to second three-level leaf node D2；If the 4th timer TC1Have timed out, then abandoning should " network recovery response message R "；
Second two level via node C2 receives " the network recovery response message that the 3rd three-level leaf node D3 is sent R ", judge the 5th timer TC2It is whether overtime：If the 5th timer TC2Have not timed out, then reply " network recovery confirmation message V " To the 3rd three-level leaf node D3, and complete the network recovery to the 3rd three-level leaf node D3；If the 5th timer TC2Have timed out, then abandoning should " network recovery response message R "；
Second two level via node C2 receives " the network recovery response message that the 4th three-level leaf node D4 is sent R ", judge the 5th timer TC2It is whether overtime：If the 5th timer TC2Have not timed out, then reply " network recovery confirmation message V " To the 4th three-level leaf node D4, and complete the network recovery to the 4th three-level leaf node D4；If the 5th timer TC2Have timed out, then abandoning should " network recovery response message R "；
3rd two level via node C3 receives " the network recovery response message that the 5th three-level leaf node D5 is sent R ", judge the 6th timer TC3It is whether overtime：If the 6th timer TC3Have not timed out, then reply " network recovery confirmation message V " To the 5th three-level leaf node D5, and complete the network recovery to the 5th three-level leaf node D5；If the 6th timer TC3Have timed out, then abandoning should " network recovery response message R "；
3rd two level via node C3 receives " the network recovery response message that the 6th three-level leaf node D6 is sent R ", judge the 6th timer TC3It is whether overtime：If the 6th timer TC3Have not timed out, then reply " network recovery confirmation message V " To the 6th three-level leaf node D6, and complete the network recovery to the 6th three-level leaf node D6；If the 6th timer TC3Have timed out, then abandoning should " network recovery response message R ".
Step 4, each N-1 levels via node receives " the network recovery response report for being subordinated to all leaf nodes of itself Literary R ", by the network recovery situation generation for the leaf node for being subordinated to itself, " network recovery collects message S ", and sends and be somebody's turn to do " net Network recovers to collect the superior node that message S " is subordinated to itself.
First two level via node C1 receives first three-level leaf node D1's and second three-level leaf node D2 " network recovery response message R " or the 4th timer TC1Time-out, according to the network recovery situation for being subordinated to the leaf node of itself " network recovery collects message S ", and transmission should " network recovery collects message S " to first one-level via node B1 for generation；
Second two level via node C2 receives the 3rd three-level leaf node D3 and the 4th three-level leaf node D4's " network recovery response message R " or the 5th timer TC2Time-out, according to the network recovery situation for being subordinated to the leaf node of itself " network recovery collects message S ", and transmission should " network recovery collects message S " to first one-level via node B1 for generation；
3rd two level via node C3 receives the 5th three-level leaf node D5 and the 6th three-level leaf node D6's " network recovery response message R " or the 6th timer TC3Time-out, according to the network recovery situation for being subordinated to the leaf node of itself " network recovery collects message S ", and transmission should " network recovery collects message S " to second one-level via node B2 for generation.
Step 5, each non-N-1 levels via node receive from be subordinated to the via node of itself " network recovery collects After message S ", as the case may be, the network recovery to interdependent node is completed.
First one-level via node B1 receive first two level via node C1 " after network recovery collects message S ", " network recovery confirmation message V ", judge whether to complete to first two according to whether first two level via node C1 receives Level via node C1 network recovery：" network recovery confirmation message V ", show to have completed to first if had been received by Two level via node C2 network recovery, then complete to first three-level leaf node D1's and second three-level leaf node D2 Network recovery；" network recovery confirmation message V ", show not complete to first two level via node C2 if be not received by Network recovery, then send that " network recovery command message P ", waiting it to reply, " network is extensive to first two level via node C1 After complex response message R ", be sent to " network recovery confirmation message V ", and complete to first three-level leaf node D1 and second Individual three-level leaf node D2 network recovery；
First one-level via node B1 receive second two level via node C2 " after network recovery collects message S ", Judge whether to complete the network recovery to second two level via node C2：If have been received by " network recovery confirmation message V ", show to have completed the network recovery to second two level via node C2, then complete to the 3rd three-level leaf node D3 With the 4th three-level leaf node D4 network recovery；" network recovery confirmation message V ", show not complete if be not received by Paired second two level via node C2 network recovery, then send " network recovery order to second two level via node C2 Message P ", wait it to reply and " after network recovery response message R ", be sent to " network recovery confirmation message V ", and completing to the Three three-level leaf node D3 and the 4th three-level leaf node D4 network recovery；
Second one-level via node B2 receive the 3rd two level via node C3 " after network recovery collects message S ", " network recovery confirmation message V ", judge whether to complete to the 3rd two according to whether the 3rd two level via node C1 receives Level via node C3 network recovery：" network recovery confirmation message V ", show to have completed to second if had been received by Two level via node C2 network recovery, then complete to the 5th three-level leaf node D5 and the 6th three-level leaf node D6's Network recovery；" network recovery confirmation message V ", show not complete to the 3rd two level via node C2 if be not received by Network recovery, then send that " network recovery command message P ", waiting it to reply, " network is extensive to the 3rd two level via node C3 After complex response message R ", be sent to " network recovery confirmation message V ", and complete to the 5th three-level leaf node D5 and the 6th Individual three-level leaf node D6 network recovery；
Step 6, each non-N-1 levels via node receive be subordinated to all via nodes of itself " network recovery collects Message S ", collect all network recovery information, generate that new " network recovery collects message S ", and sends the transmission " network is extensive Collect superior nodes of the message S " belonging to itself again.
First one-level via node B1 receives first two level via node C1's and second two level via node C2 " network recovery collects message S " or second timer TB1Time-out, generates that new " network recovery collects message S ", and sending should " network Recovery collects message S " to Centroid A；
First one-level via node B2 receive the 3rd two level via node C3 " network recovery collects message S " or Three timer TB2Time-out, generates that new " network recovery collects message S ", and send should " network recovery collects message S " to center Node A.
Step 7, Centroid A completes the network recovery to all slave nodes.
Centroid receives first one-level via node B1 for being subordinated to oneself and second one-level via node B2 " network recovery collects message S " or first timer TATime-out, complete to recover whole network.
Above description is only example of the present invention, does not form any limitation of the invention, it is clear that for this , all may be without departing substantially from the principle of the invention, structure after present invention and principle has been understood for the professional in field In the case of, the various modifications and changes in form and details are carried out, but these modifications and variations based on inventive concept are still Within the claims of the present invention.

Claims (8)

1. a kind of network recovery method based on self-organizing differentiated control, including：
(1) one Centroid K of setting, one-level to N-1 levels via node and N level leaf nodes in tree topology network, N >= 2；
(2) Centroid in network and each via node send " network recovery command message by way of spot broadcasting P ", each via node set timer according to the level of itself；
(3) each via node or leaf node receive " the network recovery order report from the superior node itself being subordinated to After literary P ", " superior node that network recovery response message R " is subordinated to itself is replied；
(4) Centroid or each via node receive from be subordinated to itself via node or leaf node " network is extensive After complex response message R ", " network recovery confirmation message V " gives the node, completes the via node or leaf to being subordinated to itself for reply The network recovery of child node；
(5) each N-1 level via nodes are received from " the network recovery response message R " for being subordinated to all leaf nodes of itself Or timer expiry, according to be subordinated to all N levels leaf nodes of itself network recovery situation generate " network recovery collects report Literary S ", and transmission should " network recovery collects the superior node that message S " is subordinated to itself；
(6) each non-N-1 levels via node receive from be subordinated to the via node of itself " network recovery collects message S " Afterwards, judge whether to complete to the network recovery for the via node for being subordinated to itself：
If having completed, complete to " network recovery collects the network recovery of the interdependent node in message S "；
If not completing, " network recovery command message P ", its is waited to reply " net to the via node transmission for being subordinated to itself After network recovers response message R ", be sent to " network recovery confirmation message V ", and complete to " network recovery collects in message S " Interdependent node network recovery；
(7) each non-N-1 levels via node receive from be subordinated to all via nodes of itself " network recovery collects message S " or timer expiry, collect all network recovery information, generate that new " network recovery collects message S ", and is sent to The superior node being subordinated to itself；
(8) Centroid receive from be subordinated to all one-level via nodes of itself " network recovery collects message S " or fixed When device time-out, complete the recovery to whole network.
2. a centromere according to the method for claim 1, is set in tree topology network wherein described in step (1) Point K, one-level to N-1 levels via node and N level leaf nodes, it is first to set one or more one-levels to relay under Centroid K Node and one-level leaf node, one or more two level via nodes and two level leaf section are set again under each one-level via node Point, by that analogy, one or more N levels leaf nodes are set under each N-1 levels via node.
3. according to the method for claim 1, the wherein network recovery command message P in step (2), comprising network identity, Send the node identification of the message node and the level of the node.
4. according to the method for claim 1, the wherein network recovery response message R in step (3), comprising network identity, Send the node identification of the message node, the node level, be subordinated to the interstitial content of the node and the node of destination node Mark.
5. according to the method for claim 1, the wherein network recovery confirmation message V in step (4), comprising network identity, Send the node identification of the message node, the level of the node, the node identification of destination node and the level of destination node.
6. according to the method for claim 1, wherein the network recovery in step (5) collects message S, comprising network identity, All node identifications for being subordinated to the leaf node for sending the message node recovered.
7. according to the method for claim 1, wherein completed in step (6) to the network for the via node for being subordinated to itself Recover, refer to that this node " network recovery command message P ", waits its to reply " net to the via node transmission for being subordinated to itself After network recovers response message R ", " network recovery confirmation message V " is sent to.
8. according to the method for claim 1, wherein the network recovery in step (7) collects message S, comprising network identity, The node identification of all slave nodes recovered.
CN201710522625.8A 2017-06-30 2017-06-30 Tree topology network recovery method based on self-organizing differentiated control Withdrawn CN107395480A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710522625.8A CN107395480A (en) 2017-06-30 2017-06-30 Tree topology network recovery method based on self-organizing differentiated control

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710522625.8A CN107395480A (en) 2017-06-30 2017-06-30 Tree topology network recovery method based on self-organizing differentiated control

Publications (1)

Publication Number Publication Date
CN107395480A true CN107395480A (en) 2017-11-24

Family

ID=60334716

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710522625.8A Withdrawn CN107395480A (en) 2017-06-30 2017-06-30 Tree topology network recovery method based on self-organizing differentiated control

Country Status (1)

Country Link
CN (1) CN107395480A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114020520A (en) * 2020-11-23 2022-02-08 北京八分量信息科技有限公司 Method for rapidly recovering system operation by optimizing node communication
CN114866403A (en) * 2021-01-18 2022-08-05 株洲中车时代电气股份有限公司 Method and device for recovering fault of backbone network node of train based on TTDP protocol

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101741674A (en) * 2009-12-22 2010-06-16 上海自动化仪表股份有限公司 Method for realizing redundant ring and network recovery in Ethernet
CN106941422A (en) * 2017-04-07 2017-07-11 西安电子科技大学 Tree topology network recovery method based on Centroid master control

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101741674A (en) * 2009-12-22 2010-06-16 上海自动化仪表股份有限公司 Method for realizing redundant ring and network recovery in Ethernet
CN106941422A (en) * 2017-04-07 2017-07-11 西安电子科技大学 Tree topology network recovery method based on Centroid master control

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114020520A (en) * 2020-11-23 2022-02-08 北京八分量信息科技有限公司 Method for rapidly recovering system operation by optimizing node communication
CN114020520B (en) * 2020-11-23 2024-10-18 北京八分量信息科技有限公司 Method for quickly recovering system operation by optimizing node communication
CN114866403A (en) * 2021-01-18 2022-08-05 株洲中车时代电气股份有限公司 Method and device for recovering fault of backbone network node of train based on TTDP protocol
CN114866403B (en) * 2021-01-18 2023-05-30 株洲中车时代电气股份有限公司 Train backbone network node fault recovery method and device based on TTDP protocol

Similar Documents

Publication Publication Date Title
US7443833B2 (en) Ad hoc network topology discovery
EP2811697A1 (en) Method and device for determining establishment of multi-protocol label switching traffic engineering tunnel
CN103634873B (en) The wireless networking method and electricity meter-reading device systems of power meter reading system
CN102497679B (en) Static clustering algorithm for wireless sensor network
CN101635975A (en) Method for collecting and routing data in wireless sensor network and device thereof
CN104506438B (en) The method and system that a kind of DCN leads to certainly
CN103312532B (en) The automatic method for removing of fault for things-internet gateway and system
CN103078969A (en) Method and equipment for announcing media access control (MAC) address information
CN103582065A (en) Efficient ad hoc network routing method for wireless sensor network
CN101453413A (en) Method and apparatus for automatic topology discovery and resource management in PBB network
CN106487558A (en) A kind of method and apparatus realizing the scalable appearance of access device
CN108200628B (en) Wireless ad hoc networking method of linear topological structure
CN106357302A (en) Wideband carrier networking method and multifunctional communication module
CN107395480A (en) Tree topology network recovery method based on self-organizing differentiated control
CN104935513A (en) Method and apparatus of clearing link state advertisement
CN106454997A (en) Wireless sensor network topology improving method
CN105359591A (en) Method and device for processing network failure
CN106941422B (en) Tree topology network recovery method based on central node master control
CN107623585A (en) For the mthods, systems and devices for the size for reducing routing update
CN103945567B (en) The constructing communication network method of inverter system
CN106302351A (en) Collect to access and control the method for list, Apparatus and system
CN109120657A (en) A kind of business collocation method and node
CN104837166B (en) The method for building up of virtual backbone network in a kind of heterogeneous ad hoc network
CN103763172A (en) Network topology building method
JP2004530387A5 (en)

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
WW01 Invention patent application withdrawn after publication

Application publication date: 20171124

WW01 Invention patent application withdrawn after publication