CN108551408A - A kind of ring redundancy network - Google Patents
A kind of ring redundancy network Download PDFInfo
- Publication number
- CN108551408A CN108551408A CN201810754109.2A CN201810754109A CN108551408A CN 108551408 A CN108551408 A CN 108551408A CN 201810754109 A CN201810754109 A CN 201810754109A CN 108551408 A CN108551408 A CN 108551408A
- Authority
- CN
- China
- Prior art keywords
- node
- weight vectors
- information
- port
- announcement 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.)
- Pending
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/42—Loop networks
-
- 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/42—Loop networks
- H04L12/437—Ring fault isolation or reconfiguration
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of ring redundancy network, solution is after faulty link is repaired, and network restores slow technical problem, by using including at least two node, node includes 2 central ports, is connected with each other by central port between adjacent node, all nodes are connected as a closed loop；All node original states are ordinary node, and each node sends the notification packet for carrying own node weight vectors information by the central port of its UP, and weight vectors information includes node link cost value and node identification information；Any node compares the weight vectors information of itself weight vectors information and other nodes received, and forwards the larger corresponding notification packet of weight vectors information；The corresponding node of weight limit amount information is picked out in ring redundancy network and is defined as host node；The weight vectors information of the corresponding node includes node link cost value and the technical solution of node identification information, preferably resolves the problem, in redundant network application.
Description
Technical field
The present invention relates to network technique fields, and in particular to a kind of ring redundancy network.
Background technology
Existing looped network redundancy technology will pass through passive waiting-timeout mechanism instauration net when network failure is repaired
Network cannot meet the commercial Application scene needs highly reliable to network.
Therefore it provides it is a kind of can in network failure Quick-return network ring redundancy network with regard to necessary.This
The purpose of invention is to be directed to existing ring redundancy network since multilink/multipoint fault leads to network fragment, in failure chain
After road is repaired, the recovery of network is slow, cannot be satisfied the fast quick-recovery high reliability demand at commercial Application scene, it is proposed that one
The implementation method of kind redundant network, can be fast in fault restoration after ring redundancy network forms network fragment due to failure
Quick-recovery network.
Invention content
After being repaired the technical problem to be solved by the present invention is to faulty link existing in the prior art, the recovery ratio of network
Slower technical problem.A kind of new ring redundancy network is provided, which has fast quick-recovery high reliability
Feature.
In order to solve the above technical problems, the technical solution used is as follows：
A kind of ring redundancy network, the ring redundancy network include at least two node, and each node includes 2 central ports, phase
It is connected with each other by central port between neighbors, all nodes are connected as a closed loop；All node original states are common section
Point, each node send the notification packet for carrying own node weight vectors information, weight vectors letter by the central port of its UP
Breath includes node link cost value and node identification information；Any node compare itself weight vectors information and receive other
The weight information of node, and forward the larger corresponding notification packet of weight vectors information；It is selected in ring redundancy network
Go out the corresponding node of weight limit amount information and is defined as host node；The weight vectors information of the corresponding node includes node chain
Road cost value and node identification information.
The forwarding state of central port is BLOCK in the present invention, is not that can forward notification packet of the present invention, but not
Forward customer service message.When the weight vectors information of node changes, is sent by the central port of its UP and carry the section
The notification packet of the weight vectors information of point.
In said program, for optimization, further, the determination method of the weight vectors information is：
First, the determination method according to node link cost value compares the node link cost value in weight vectors information, link
The big person of cost value is defined as excellent；
Second step when link cost value is identical, compares the node identification information in weight vectors information, and node identification information value is big
Person is defined as excellent.
Further, the determination method of the node link cost value is：
Step 1, the cost value of the corresponding central link in the first central port of present node, the cost of link and the bandwidth of link are determined
It is inversely proportional, when link failure, link cost is infinitely great, and link bandwidth value is bigger, and link cost value is smaller；
Step 2, the cost value of the corresponding central link in the second central port of node, the corresponding chain in two central ports of comparison node are taken
The cost on road, using the link cost value of larger ring as the link cost of present node.
Further, the node identification information is MAC Address and wantonly 1 or 2 in node device sequence number arrangement
Combination.
Node in loop network receives the weight vectors information announcement message in this loop network, is carried by message
Weight vectors information in node identification information judge the notification packet whether come from this node：
1, the weight vectors information announcement message received comes from this node：
（1）If carrying host node mark in notification packet, do not handle；
（2）If not carrying reflective marker in notification packet, corresponding looped network is to be closed, the weight vectors information of this node
It is preferable over the weight vectors information of other nodes in looped network, this node is preferably the host node of loop network, then by this node
The forwarding state of the corresponding central port of larger link cost be set as BLOCK；It is sent and is carried by two central ports simultaneously
There is the weight vectors information announcement message of host node mark.
（3）If carrying reflective marker in notification packet,
（3.1）If it is first notification packet for carrying reflective marker received from one of central port, then illustrate
The weight vectors of this node this node receive carry reflective marker notification packet central port connection network this
The weight vectors of side relatively in preferably win,
（a）If another central port of this node is DOWN, this node is preferably the host node of current network, and passes through
The port for receiving the notification packet for carrying reflective marker sends the weight vectors information announcement message for carrying host node mark；
（b）Otherwise, another central port of this node is UP, and the port for receiving reflection notification packet is master port,
The weight vectors information announcement message of this node is sent from another central port of this node；
（3.2）If it is second notification packet for carrying reflective marker received from another central port, then this node
The preferably host node of network, since looped network is open loop situations, so the forwarding state that the central port of this node is arranged all is
FORWARD, and the weight vectors information announcement message for carrying host node mark is sent by two central ports；
2, the weight vectors information announcement message received comes from other nodes in looped network, and the weight vectors carried in message are believed
It ceases and is compared with local weight vectors information：
（1）If the node for receiving notification packet is ordinary node,
（1.1）If the weight vectors information in the message received keeps this node better than local weight vectors information
Ordinary node state,
（a）If another central port of node for receiving weight vectors information announcement message is UP, from receive weight to
Another central port for measuring the node of infomational message forwards the weight vectors information announcement message received,
（a.1）If host node mark is carried in the weight vectors information announcement message received, if this node is deposited
In the central port that forwarding state is BLOCK, be then forwarded state and be set as FORWARD, at the same by the forwarding table of this node into
Row empties, and sends clear statistical tables and reports text from two central ports of this node；
（a.2）Otherwise, the forwarding state of the central port of this node is kept；
（b）If another central port for receiving the node of weight vectors information announcement message is DOWN, reported in notice
Increase reflective marker in text, and the notification packet is reflected from the central port for receiving weight vectors information announcement message, if received
The port of weight vectors information announcement message is BLOCK, then it is FORWARD that port forwarding state, which is arranged, and to this node
Forwarding table empties, while sending clear statistical tables and reports text by receiving the port of weight vectors information announcement message；
（1.2）If local weight vectors information is preferable over the weight vectors information in the message received,
（a）If another central port of this node is UP, the notification packet received is stopped forwarding, and pass through this node
Another central port send carry this node weight vector information notification packet；
（b）If another port of this node is DOWN, sent out from the port for receiving weight vectors information announcement message
Send the notification packet for the weight vectors information for carrying this node；
（2）If the node for receiving weight vectors information announcement message is host node,
（2.1）If the weight vectors information in the notification packet received is preferable over the weight vectors information of this node,
This node is converted to ordinary node from host node,
（a）If another central port of this node is UP, the notification packet is forwarded from another central port of this node；
（b）If another central port of this node is DOWN, increase reflective marker in notification packet, and weigh from receiving
The central port of weight vector information notification packet sends modified notification packet；
（2.2）If local weight vectors information is preferable over the weight vectors information carried in the notification packet received, from
The port for receiving notification packet sends the notification packet for the weight vectors information for carrying this node.
Beneficial effects of the present invention：The present invention compares by using node weight vector information, reflects and weighs in malfunctioning node
The mode of weight vector information notification packet, can quickly select network host node, restore the forwarding of network, while repairing ring
When the multipoint fault of l network, quickly restore the state of network, carries out data forwarding.
Description of the drawings
Present invention will be further explained below with reference to the attached drawings and examples.
Fig. 1 is the structural schematic diagram of the loop network of the specific embodiment of the invention.
Fig. 2 is the structural schematic diagram that one link failure of looped network of the specific embodiment of the invention is realized.
Fig. 3 is the structural schematic diagram that the looped network both links failure of the specific embodiment of the invention is realized.
Fig. 4 is that the looped network of the specific embodiment of the invention repairs the structure that a link in a plurality of faulty link is realized
Schematic diagram.
Fig. 5 is that the looped network of the specific embodiment of the invention repairs the structural schematic diagram that fault network is realized.
Specific implementation mode
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to embodiments, to the present invention
It is further elaborated.It should be appreciated that described herein, specific examples are only used to explain the present invention, is not used to limit
The fixed present invention.
Embodiment 1
The present embodiment provides a kind of ring redundancy network, such as Fig. 1, the ring redundancy network has 6 nodes, each node to include
2 central ports are connected with each other by central port between adjacent node, and all nodes are connected as a closed loop；All nodes are initial
State is ordinary node, and each node sends the notice report for carrying own node weight vectors information by the central port of its UP
Text, weight vectors information include node link cost value and node identification information；Any node compares itself weight vectors information
With the weight information of other nodes received, and the larger corresponding notification packet of weight vectors information is forwarded；In annular
The corresponding node of weight limit amount information is picked out in redundant network and is defined as host node；The weight vectors of the corresponding node
Information includes node link cost value and node identification information.
Wherein, the determination method of weight vectors information is：
First, the determination method according to node link cost value compares the node link cost value in weight vectors information, link
The big person of cost value is defined as excellent；
Second step when link cost value is identical, compares the node identification information in weight vectors information, and node identification information value is big
Person is defined as excellent.
Specifically, the determination method of the node link cost value is：
Step 1, the cost value of the corresponding central link in the first central port of present node, the cost of link and the bandwidth of link are determined
It is inversely proportional, when link failure, link cost is infinitely great, and link bandwidth value is bigger, and link cost value is smaller；
Step 2, the cost value of the corresponding central link in the second central port of node, the corresponding chain in two central ports of comparison node are taken
The cost on road, using the link cost value of larger ring as the link cost of present node.
Specifically, the node identification information is MAC Address and wantonly 1 or wantonly 2 combinations in node device sequence number.
In this implementation, in BLOCK states, node does not pursue one's vocational study the source addresses MAC of message, and abandons arrival for port
The service message of port, but forward process is done between loop network node for the protocol massages of the present invention.
Each node sends the notification packet for carrying own node weight vectors information by the central port of its UP.Each section
Point sends the notification packet for carrying own node weight vectors information by the central port of its UP.Receive the weight of other nodes
Vector information notification packet compares the weight vectors of the weight vectors carried in notification packet and this node：If connect
The weight vectors carried in the weight vectors information announcement message received are preferable over the weight vectors of own node, then from another
The central port of UP forwards the weight vectors information announcement message received；It is received if the weight vectors of own node are preferable over
Weight vectors information announcement message in the weight vectors that carry, from the central port of another UP send the weight of own node to
Measure information announcement message.Weight vectors are compared by each node, preferably go out the host node of loop network, host node passes through two
Central port sends the weight vectors information announcement message for carrying host node mark.
As shown in Fig. 1：It is assumed that the link cost between node A and node B is higher, and then the weight vectors of node A are excellent
The weight vectors in other nodes are selected, then the ports RA1 of node A are BLOCK.
Node A, node B, node C and node D, node E, node F are ordinary nodes, and the central port of each node turns
Hair-like state is set as BLOCK.
Node A, node B, node C and node D, node E, node F are logical by two central port Transmit weight vector informations
Accuse message.
Node B receives the weight vectors information announcement message that node A is sent out in the ports RB2, compares the weight received
The weight vectors of weight vectors and node B in vector information notification packet, the weight vectors of node A are preferred, pass through the ports RB1
Forward the weight vectors information announcement message of the node A received.
Node A receives the weight vectors information announcement message of node B in the ports RA1, compares the weight vectors letter received
The weight vectors of the weight vectors and node A in notification packet are ceased, the weight vectors of node A are preferred, stop forwarding the power of node B
Weight vector notification packet, passes through the weight vectors information announcement message of the ports RA2 sending node A.
The weight vectors of node C and node D, node E, node F the node A that a central port receives forwarding wherein are believed
Notification packet is ceased, the weight vectors of the weight vectors and this node in the weight vectors information announcement message received are compared, is saved
The weight vectors of point A are preferred, pass through the weight vectors information announcement message for the node A that the forwarding of another central port receives.
Node A receives the weight vectors information announcement message of this node of other nodes forwarding in the port port RA1, RA2,
Node A is selected as host node, and since the corresponding link cost value in the ports RA1 is larger, the forwarding state of the ports setting RA1 is BLOCK,
Be arranged the ports RA2 forwarding state be FORWARD, and by central port RA1, RA2 send carry host node mark weight to
Information announcement message is measured, and clear statistical tables and reports text is sent by central port RA1, RA2.
If Fig. 2 is the structural schematic diagram that one link failure of looped network in embodiment 1 is realized, due to node in loop network
Link failure between A and node B causes node A and the weight vectors of node B to change, for node A, before link failure
The forwarding state of the ports RA1 is BLOCK, since the weight vectors information of node A changes, the ends RA2 that node A passes through its UP
Mouth Transmit weight vector information notification packet.
For node B, the forwarding state of setting port RB2 is BLOCK, since central port forwarding state changes, passes through RB1
Port sends clear statistical tables and reports text, simultaneously because the weight vectors information of node B changes, passes through the ports RB1 Transmit weight vector
Information announcement message.
Node F, node E, node D, node C receive the weight vectors information announcement report for carrying node A that node A is sent out
After text, with the weight vectors comparison of own node, the weight vectors of the node A received are preferred, continue what forward node A was sent out
Weight vectors information announcement message.
It is logical that node C, node D, node E, node F are sequentially received the weight vectors information for carrying node B that node B is sent out
Message is accused, after the weight vectors comparison of own node, the weight vectors of the node B received are preferred, continue forward node B hairs
The weight vectors information announcement message gone out.
The weight vectors information announcement message that Node-B receiver is sent out to node A, by the node A's carried in notification packet
The weight vectors of weight vectors and node B are compared, and the weight vectors of node A are preferable over the weight vectors of node B, and node
The ports RB2 of B are DOWN, therefore increase reflective marker in the weight vectors information announcement message received, from receiving
The ports RB1 for the weight vectors information announcement message that node A is sent out are sent out.
Node A receives the weight vectors information announcement message that node B is sent out, by the node B's carried in notification packet
The weight vectors of weight vectors and node A are compared, and the weight vectors of node A are preferable over the weight vectors of node B, and node
The ports the RA1 DOWN of A abandons the weight vectors information announcement message that the node B received is sent out, is sent out from node B is received
The port RA2 of weight vectors information announcement message send out the weight vectors information announcement message of node A.
The weight vectors information for carrying node A that node C, node D, node E, node F are sequentially received node B reflections is logical
Message is accused, the port for continuing through another UP forwards what is received to carry reflective marker weight vectors information announcement message.
Node A receives the weight vectors information announcement message for the node A for carrying reflective marker, due to another port
RA1 is DOWN, and node A is preferably host node, and node A sends the weight vectors letter for carrying host node mark by the ports RA2
Cease notification packet.
Node F, node E, node D, node C are sequentially received the power of the node A for the carrying host node mark that node A is sent out
Weight vector information notification packet, by the weight of the weight vectors of the node A in notification packet and the node for receiving notification packet
After vector comparison, the weight vectors of node A are preferred, continue the weight vectors information announcement message that forward node A is sent out.
The weight vectors information announcement message that Node-B receiver is sent out to node A, by the node A's carried in notification packet
The weight vectors of weight vectors and node B are compared, and the weight vectors of node A are preferable over the weight vectors of node B, and node
The ports the RB2 DOWN of B increases reflective marker in the weight vectors information announcement message received, is sent out from node A is received
The port of weight vectors information announcement message send out.
It is the structural schematic diagram that looped network both links failure is realized in the present embodiment such as Fig. 3：Between node C and node D
Link failure, for node C, the forwarding state of setting port RC1 is BLOCK, since the forwarding state of port changes, is led to
It crosses the ports RC2 and sends clear statistical tables and reports text, the weight vectors information of node C changes, and passes through the ports RC2 Transmit weight vector information
Notification packet.
The weight vectors information announcement message that node B receives node C in port RB1, compares the weight vectors received
The weight vectors of weight vectors and this node in information announcement message, the weight vectors of node C are preferred, then due to the ports RB2
It is DOWN, reflection message is sent from the port RB1 for receiving weight vectors information announcement message.
Node C receives the weight vectors information announcement message for the node C that node B is reflected back, since the ports RC1 are DOWN
, node C is preferably network host node, and the weight vectors information announcement message for carrying host node mark is sent by the ports RC2.
The port RD2 of node D is set as BLOCK, since the forwarding state of port changes, is sent by the ports RD1
Clear statistical tables and reports text, the weight vectors information of node D change, and pass through the ports RD1 Transmit weight vector information notification packet.
Node E, node F receive the weight vectors information announcement message that node D is sent out, and compare the weight vectors received
The weight vectors of weight vectors and this node in information announcement message, the weight vectors of node D are preferably won, another is passed through
The weight vectors information announcement message that the node D that port forwarding receives is sent out.
Node A receives the weight vectors information announcement message that node D is sent out, and it is logical to compare the weight vectors information received
The weight vectors of the weight vectors and this node in message are accused, the weight vectors of node A are preferably won, and the node received is abandoned
The weight vectors information announcement message of D passes through the weight vectors information of port RA2 sending nodes since the ports RA1 are DOWN
Notification packet.
Node F, node E receive the weight vectors information announcement message that node A is sent out, and compare the weight vectors received
The weight vectors of weight vectors and this node in information announcement message, the weight vectors of node A are preferably won, another is passed through
The weight vectors information announcement message for the node A that port forwarding receives.
Node D receives the weight vectors information announcement message that node A is sent out, and it is logical to compare the weight vectors information received
The weight vectors of the weight vectors and this node in message are accused, the weight vectors of node A are preferably won, since the ports RD2 are
DOWN's, increase reflective marker in the weight vectors information announcement message received, and logical by receiving weight vectors information
The port for accusing message is sent out.
Node F, node E receive the weight vectors information announcement message of the node A of node D reflections, pass through another end
The weight vectors information announcement message that mouth forwarding receives.
Node A receives the weight vectors information announcement message of the node A of node D reflections, since port RA1 is DOWN
, node A is preferably the host node of network, and the weight vectors information announcement for carrying host node mark is sent by the ports RA2
Message.
If Fig. 4 is the structural schematic diagram that looped network repairs the realization of a link in a plurality of faulty link, node C and node D
Between link failure it is standby repair, the weight vectors information of node C changes, and passes through RC1 Transmit weight vector informations and notices
Message.
The weight vectors information of node D changes, and passes through port RD2 Transmit weight vector information notification packets.
On the one hand, node D receives the weight vectors information announcement message that node C is sent out, compare the weight that receives to
The weight vectors of the weight vectors and node D of the node C in information announcement message are measured, the weight vectors of node D are preferably won, and are led to
It crosses port RD1 and forwards the weight vectors information announcement message received.
Node E, node F receive the weight vectors information announcement message that the node D of forwarding is sent out, and will be taken in notification packet
The weight vectors of node D and the weight vectors of own node of band are compared, and the weight vectors of node D are preferable over own node
Weight vectors, pass through the weight vectors information announcement message of node D that the forwarding of another port receives.
Node A receives the weight vectors information announcement message that node D is sent out, and it is logical to compare the weight vectors information received
The weight vectors of the weight vectors and this node of the node D in message are accused, the weight vectors of node A are preferably won, due to the ends RA1
Mouth is DOWN, passes through the weight vectors information announcement message of the ports the RA2 sending node A of node A.
Node F, node E, node D, node C receive the weight vectors information announcement message that node A is sent out, and comparison receives
To weight vectors information announcement message in node A weight vectors and this node weight vectors, the weight vectors of node A
It is preferred that winning, pass through the power of another central port forwarding node A received of the node for receiving notification packet
Weight vector information notification packet.
It is logical to compare the weight vectors information received for the weight vectors information announcement message that Node-B receiver is sent out to node A
The weight vectors of the weight vectors and node B of the node A in message are accused, the weight vectors of node A are preferably won, due to node B
Central port RB2 be DOWN, the weight vectors information announcement message sent out to the node A received increases reflection mark
Will sends out modified notification packet by the port RB1 of node B.
On the other hand, node C receives the weight vectors information announcement message that node D is sent out, and compares the weight received
The weight vectors of the weight vectors and node C of node D in vector information notification packet, the weight vectors of node D are preferably won,
The weight vectors information announcement message received is forwarded by port RC2.
Node-B receiver to the weight vectors information announcement message of the node C node D forwarded, compare the weight that receives to
The weight vectors of the node D weight vectors and node B in information announcement message are measured, the weight vectors of node B are preferably won, due to
The ports RB2 are DOWN, pass through the weight vectors information announcement message of port RB1 sending nodes B.
Node C, node D, node E, node F receive the weight vectors information announcement message that the node B of forwarding is sent out, will
The weight vectors of node B and the weight vectors of own node carried in notification packet are compared, and the weight vectors of node B are excellent
The weight vectors in own node are selected, the weight vectors information announcement message for the node B that the forwarding of another port receives is passed through.
Node A receives the weight vectors information announcement message that node B is sent out, and it is logical to compare the weight vectors information received
The weight vectors of the weight vectors and this node in message are accused, the weight vectors of node A are preferably won, since the ports RA1 are
DOWN's, pass through the weight vectors information announcement message of port RA2 sending nodes A.
Further, node C, node D, node E, node F receive the node A of node B reflection weight vectors information it is logical
Message is accused, the weight vectors information announcement message received is forwarded by another port.
Node A receives the weight vectors information announcement message of the node A of node B reflections, due to the central port of node A
RA1 is DOWN, and node A is preferably network host node, and the weight vectors letter for carrying host node mark is sent by central port RA2
Cease notification packet.
Node F, node E receive the weight vectors information announcement message for the carrying host node mark that node A is sent out, and pass through
Another port forwards the weight vectors information announcement message received.
Node D receives the weight vectors information announcement message of the node A for the carrying host node mark that node A is sent out, will
The forwarding state of the port RD2 of BLOCK is set as FORWARD, and sends clear statistical tables and reports text by two central ports.
Node C receives the weight vectors information announcement message of the node A for the carrying host node mark that node A is sent out, will
The forwarding state of the port RD2 of BLOCK is set as FORWARD, and sends clear statistical tables and reports text by two central ports.
If Fig. 5 is the structural schematic diagram that looped network repairs that fault network is realized, the link repair between node A and node B, section
Point B is by the weight vectors information announcement message of port RB2 sending nodes B, the weight that node A passes through port RA1 sending nodes A
Vector information notification packet.
Node A receives the weight vectors information announcement message that node B is sent out, by the node B's carried in notification packet
The weight vectors of weight vectors and node A are compared, and the weight vectors of node A are preferable over the weight vectors of node B, node A
The weight vectors information announcement message that the node B received is sent out is stopped forwarding, and passes through the weight vectors of RA2 sending nodes A
Information announcement message.
Node B, node C, node D, node E, node F receive the weight vectors information announcement message that node A is sent out, will
The weight vectors of node A carried in notification packet are compared with the weight vectors of this node, and the weight vectors of node A are preferred
In the weight vectors information announcement message that the weight vectors of this node, the node A received by the forwarding of another port are sent out.
Node A receives the weight vectors information announcement message that the node A of other nodes forwarding is sent out, and node A is preferably
Host node sends the weight vectors information announcement message for the node A for carrying host node mark by two central ports.
The weight vectors information announcement message that Node-B receiver is sent out to the node A for carrying host node mark, by BLOCK
Port be set as FORWARD, and pass through two central ports and send clear statistical tables and reports text.
Other nodes, which receive, carries the weight vectors information announcement message that the node A of host node mark is sent out, comparison
The weight vectors of weight vectors and this node in the weight vectors information announcement message received, the weight vectors letter received
The weight vectors ceased in notification packet are preferred, and the weight vectors information announcement message received is forwarded by another central port.
Although the illustrative specific implementation mode of the present invention is described above, in order to the technology of the art
Personnel are it will be appreciated that the present invention, but the present invention is not limited only to the range of specific implementation mode, to the common skill of the art
For art personnel, as long as long as various change the attached claims limit and determine spirit and scope of the invention in, one
The innovation and creation using present inventive concept are cut in the row of protection.
Claims (11)
1. a kind of ring redundancy network, it is characterised in that：The ring redundancy network includes at least two node, each node packet
2 central ports are included, are connected with each other by central port between adjacent node, all nodes are connected as a closed loop；
All node original states are ordinary node, each node sent by the central port of its UP carry own node weight to
Measure the notification packet of information；
Any node compares the weight vectors information of itself weight vectors information and other nodes received, in ring redundancy net
The corresponding node of weight limit amount information is picked out in network and is defined as host node.
2. ring redundancy network according to claim 1, it is characterised in that：The weight vectors information includes node link
Cost value and node identification information.
3. ring redundancy network according to claim 1, it is characterised in that：The determination method of the weight vectors information
For：
The first step, the determination method according to node link cost value compare the node link cost value in weight vectors information, chain
Cost value big person in road is defined as excellent；
Second step when link cost value is identical, compares the node identification information in weight vectors information, and node identification information value is big
Person is defined as excellent.
4. ring redundancy network according to claim 3, it is characterised in that：The determination method of the node link cost value
For：
Step 1, the cost value of the corresponding central link in the first central port of present node, the cost of link and the bandwidth of link are determined
It is inversely proportional, when link failure, link cost is infinitely great, and link bandwidth value is bigger, and link cost value is smaller；
Step 2, the cost value of the corresponding central link in the second central port of node, the corresponding chain in two central ports of comparison node are taken
The cost on road, using the link cost value of larger ring as the link cost of present node.
5. ring redundancy network according to claim 2, it is characterised in that：The node identification information be MAC Address with
Wantonly 1 or 2 permutation and combination in node device sequence number.
6. ring redundancy network according to claim 1, it is characterised in that：It is described to receive weight vectors information announcement report
The weight vectors of the node of text are preferable over the weight vectors carried in the weight vectors information announcement message received, then stop turning
The weight vectors information announcement message received is sent out, the weight vectors of this node are sent by another central port of the node
Information announcement message.
7. ring redundancy network according to claim 6, it is characterised in that：The node, if another central port
It is DOWN, the port by receiving weight vectors information announcement message sends out the weight vectors information announcement report of the node
Text.
8. ring redundancy network according to claim 1, it is characterised in that：The weight vectors information announcement received
The weight vectors carried in message are preferable over the weight vectors of the node for receiving weight vectors information announcement message, then lead to
Another central port for crossing the node forwards the weight vectors information announcement message received.
9. ring redundancy network according to claim 8, it is characterised in that：The node, if another central port is
DOWN's, increase reflective marker in the weight vectors information announcement message received, and by receiving weight vectors letter
The port of breath notification packet is sent out.
10. ring redundancy network according to claim 1, it is characterised in that：The node receives the power oneself sent out
Vector information notification packet is weighed, reflective marker is not carried in the message, then it is network host node to define the node.
11. ring redundancy network according to claim 10, it is characterised in that：The node receives the power oneself sent out
Vector information notification packet is weighed, reflective marker is carried in message, if another central port of the node is DOWN, institute
It is network host node to state node；
If another central port of the node is UP, the ports UP have been marked as master port, then the node is
Network host node；If another central port of the node is UP, label receives the notice report for carrying reflective marker
The central port of text is master port, and by the ports UP, sends the weight vectors information announcement message of the node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810754109.2A CN108551408A (en) | 2018-07-11 | 2018-07-11 | A kind of ring redundancy network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810754109.2A CN108551408A (en) | 2018-07-11 | 2018-07-11 | A kind of ring redundancy network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108551408A true CN108551408A (en) | 2018-09-18 |
Family
ID=63492145
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810754109.2A Pending CN108551408A (en) | 2018-07-11 | 2018-07-11 | A kind of ring redundancy network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108551408A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109327385A (en) * | 2018-10-22 | 2019-02-12 | 智强通达科技（北京）有限公司 | A kind of dual-homed network topology structure |
| CN111541480A (en) * | 2020-04-15 | 2020-08-14 | 燕山大学 | Low-energy-consumption free space optical network restoration method based on reflection characteristics |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102394787A (en) * | 2011-12-14 | 2012-03-28 | 重庆邮电大学 | Dual-link redundancy control method based on EPA switch |
| WO2012162946A1 (en) * | 2011-08-16 | 2012-12-06 | 华为技术有限公司 | Message processing method and system |
| US20170085463A1 (en) * | 2013-10-30 | 2017-03-23 | Futurewei Technologies, Inc. | Network Topology of Hierarchical Ring with Recursive Shortcuts |
-
2018
- 2018-07-11 CN CN201810754109.2A patent/CN108551408A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012162946A1 (en) * | 2011-08-16 | 2012-12-06 | 华为技术有限公司 | Message processing method and system |
| CN102394787A (en) * | 2011-12-14 | 2012-03-28 | 重庆邮电大学 | Dual-link redundancy control method based on EPA switch |
| US20170085463A1 (en) * | 2013-10-30 | 2017-03-23 | Futurewei Technologies, Inc. | Network Topology of Hierarchical Ring with Recursive Shortcuts |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109327385A (en) * | 2018-10-22 | 2019-02-12 | 智强通达科技（北京）有限公司 | A kind of dual-homed network topology structure |
| CN111541480A (en) * | 2020-04-15 | 2020-08-14 | 燕山大学 | Low-energy-consumption free space optical network restoration method based on reflection characteristics |
| CN111541480B (en) * | 2020-04-15 | 2021-03-19 | 燕山大学 | Low-energy-consumption free space optical network restoration method based on reflection characteristics |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101826989B (en) | Method and device for treating fault | |
| CN102299845B (en) | Multilink transparent interconnection multicast frames transmission method and system | |
| JP4072158B2 (en) | Method for testing message path and network element in communication network | |
| CN103684835B (en) | Link fault reporting method and processing method, and transmission node and primary node | |
| TW516290B (en) | Interconnection link redundancy in a modular switch node | |
| WO2006102826A1 (en) | A method for realizing the backup of the data service | |
| JP2004080323A (en) | Lan switching method and lan switch | |
| CN101888307B (en) | The method and apparatus of port selection is realized for this locality | |
| CN108551408A (en) | A kind of ring redundancy network | |
| CN101197733A (en) | Automatic detection method and device for network connectivity | |
| CN102761479A (en) | Method for selecting link and device therefore | |
| CN101094121A (en) | Method, system and device for detecting Ethernet links among not direct connected devices | |
| CN105656715B (en) | Method and apparatus for monitoring the state of cloud computing environment lower network equipment | |
| CN101599898A (en) | The multilink fault environment adopts the method for the avoiding loop for routers of LFA mode down | |
| CN102546430A (en) | Method for redundant backup of network equipment, and routing equipment and system | |
| JP2009516463A5 (en) | ||
| CN104104596B (en) | A kind of IRF divides treating method and apparatus | |
| US20070147231A1 (en) | Path protection method and layer-2 switch | |
| CN103916319A (en) | Link selection method and stacking device in LACP stacked networking | |
| CN102868605B (en) | A kind of looped network data guard method and device | |
| CN107612738B (en) | The uplink traffic fast switching system and method for VPLS dual-homed service model | |
| JP6190281B2 (en) | Relay system and switch device | |
| JP2013211680A (en) | Communication device | |
| CN106533771A (en) | Network device and control information transmission method | |
| CN104954248B (en) | Message transmission pretection switch method, equipment and system |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180918 |
|
| RJ01 | Rejection of invention patent application after publication |