CN114760207A - Ring network damage method and system of Ethernet - Google Patents
Ring network damage method and system of Ethernet Download PDFInfo
- Publication number
- CN114760207A CN114760207A CN202210478203.6A CN202210478203A CN114760207A CN 114760207 A CN114760207 A CN 114760207A CN 202210478203 A CN202210478203 A CN 202210478203A CN 114760207 A CN114760207 A CN 114760207A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- topology
- nodes
- loop
- 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
Links
Images
Classifications
-
- 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
- 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
- H04L41/0659—Management of faults, events, alarms or notifications using network fault recovery by isolating or reconfiguring faulty entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
Abstract
The invention discloses a ring network damage method of an Ethernet, which comprises the following steps: when the network nodes change, each node in the network knows the topology of the whole network through topology learning; and judging whether a loop is generated when the network data stream is abnormal, and if the loop is generated, carrying out ring network destruction. In the invention, each node knows the topology of the whole network at ordinary times and also knows the position of the node in the network, when the ring network appears, a certain node can know the position of the loop and the newly added port immediately, and the node can be broken by only disconnecting the newly added port, so that the ring breaking speed is high and the stability is high. When the network is stable at ordinary times, no extra message is required to be sent, and no load exists basically. The invention also provides a ring network damage system of the Ethernet, which comprises a plurality of nodes, and when the network data flow is abnormal, the ring network is damaged by adopting a ring network damage method of the Ethernet.
Description
Technical Field
The present invention belongs to the field of communication technologies, and in particular, to a method and a system for ring network disruption of an ethernet network.
Background
Ethernet connection errors or network device configuration errors may cause the ethernet to form a loop, which may cause a broadcast storm, so that a large amount of broadcast messages exist in the network, and the operation of the entire network is seriously affected. Under the traditional condition, each node does not know the network condition, only can know that a large number of messages cause resource exhaustion, and cannot judge the message from which the message comes or whether the message is a broadcast storm or not.
Disclosure of Invention
The technical problem to be solved is as follows: in the network, each node does not know the topology condition of the node, and when receiving a large amount of data, the node cannot judge whether a loop is formed to cause a broadcast storm. In order to reduce the influence caused by the occurrence of the loop fault, the invention can ensure that the node acquires the topology of the whole network in a topology learning mode after the power-on is finished, and can timely block the loop when the looped network occurs and recover the network.
To achieve the above object, according to an aspect of the present invention, there is provided a method for ring network disruption of an ethernet network, including:
when the network nodes change, each node in the network knows the topology of the whole network through topology learning;
and judging whether a loop is generated when the network data stream is abnormal, and if the loop is generated, carrying out ring network destruction.
In an embodiment of the present invention, each node in the network knows the topology of the whole network, specifically:
when a node is added, or a node is newly accessed or another network is accessed, or a node or another network is deleted, network topology learning is carried out so that each node in the network knows the topology of the whole network.
In one embodiment of the present invention, when there is a ring network, it is determined whether a loop is generated when the network data stream is abnormal, and if the loop is generated, the ring network is destroyed, specifically:
When topology learning succeeds, a loop appears, mac of all nodes is on at least two ports of all nodes in the loop, whether the node is in the loop or not is known through the regular node, and then destruction is carried out according to a rule that a newly-added connection is firstly disconnected or a port is disconnected by a node closest to a network management system.
In one embodiment of the present invention, when there is a ring network, it is determined whether a loop is generated when the network data stream is abnormal, and if the loop is generated, the ring network is destroyed, specifically:
if the node of the newly added port supports the protocol or the topology is not learned, the ring is broken by the mode that the node breaks the newly added port, and if the node of the newly added port does not support the protocol or the topology is not learned, the ring is broken by other rules.
In one embodiment of the invention, only one node in the loop needs to support the protocol, so that the loop can be broken.
In one embodiment of the invention, when a newly added node is newly added to a node which is just powered on, a newly added node system actively broadcasts a topology request message of the newly added node to the whole network after being started, other nodes send topology messages of all ports except the port of the newly added node and a node mac on the corresponding port to the node after receiving the topology request message of the newly added node, the newly added node refines all macs to all ports after receiving the topology messages of all other nodes, the topology of the whole network is drawn, the own topology information point is distributed to the other nodes, and the other nodes update the topology according to the topology messages sent by the newly added node.
In one embodiment of the invention, when a node or another network is newly accessed, two newly-added and connected nodes discover a new connecting port and immediately broadcast the topology of the nodes, the two nodes receive a topology message of the other side at the moment, the network topology is directly updated according to the local end of the topology message of the other side, all the nodes except the two nodes receive two topology messages, one is the node in the original topology, the node is known to be added with a new node or network after receiving the message, the other node is an external node, and the topology of the new network is directly drawn according to the topology message.
In one embodiment of the invention, when a node or another network is deleted, after the network finds that an arp of a certain node is aged, an adjacent node firstly inquires the port state of the adjacent node, if the connection is disconnected, a topology message of the deleted node is sent, other nodes delete the corresponding node after receiving the topology message of the deleted node, if the connection is still in the network, the node is possible to be just restarted or do other things in the system, the message is not sent externally, and no processing is needed.
In one embodiment of the invention, when the network is stable, that is, any node in the network is not changed, the arp information of the whole network on each node is not changed, and at this time, the nodes in the network do not need to update the topology and do not need to additionally send any message.
According to another aspect of the present invention, there is provided an ethernet ring network disruption system, including a plurality of nodes, wherein when an abnormal network data flow occurs, the ethernet ring network disruption method is adopted to perform ring network disruption.
In general, compared with the prior art, the technical scheme conceived by the invention has the following beneficial effects:
in the invention, each node knows the topology of the whole network at ordinary times and also knows the position of the node in the network, when the ring network appears, a certain node can know the position of the loop and the newly added port immediately, and the node can break the loop only by disconnecting the newly added port, so that the loop breaking speed is high and the stability is high. When the network is stable at ordinary times, no extra message is required to be sent, and no load exists basically.
Drawings
Fig. 1 is an overall flowchart of a ring network disruption method for ethernet in an embodiment of the present invention;
fig. 2 is a schematic flowchart of a ring network disruption method for ethernet in an embodiment of the present invention;
FIG. 3 is a flowchart of a topology message when a node is newly added in the embodiment of the present invention;
fig. 4 is a flowchart of a topology packet when a connection is added or deleted in the embodiment of the present invention;
FIG. 5 is a flow chart and a flow chart of a broadcast packet with a known topology according to an embodiment of the present invention;
Fig. 6 is a walking diagram and a flow chart of a broadcast packet when topology is unknown in the embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and do not limit the invention. In addition, the technical features involved in the respective embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
Aiming at the problems in the prior art, in order to reduce the influence caused by the occurrence of the loop fault as much as possible, a method is needed to be used for enabling each node to know the topology of the whole network, and when the network data flow is abnormal, whether the data flow is normal or not, whether the data flow participates in the generation of the loop or not, and whether the data flow needs to take measures to block the loop or not can be automatically judged.
In order to achieve the above object, as shown in fig. 1, the present invention provides a method for ring network disruption of ethernet, including:
when the network nodes change, each node in the network knows the topology of the whole network through topology learning;
And judging whether a loop is generated when the network data stream is abnormal, and if the loop is generated, carrying out ring network destruction.
Wherein, each node in the network knows the topology of the whole network, which specifically comprises: when the network is added with a node, or is newly accessed into a node or another network, or is deleted, the network topology learning is carried out, so that each node in the network can know the topology of the whole network.
Specifically, the whole process is shown in fig. 2:
when the network is stable, that is, any node in the network has no change, the arp information of the whole network on each node is not changed, and at the moment, the nodes in the network do not need to update the topology and do not need to additionally send any message.
Network node changes are generally new nodes; a new access node or another network; three situations, namely node deletion or another network, require network topology learning:
when a newly added node is newly added to a node which is just powered on, the newly added node system actively broadcasts a topology request message of the newly added node to the whole network after being started, other nodes send topology messages of all ports except the port of the newly added node and a node mac on a corresponding port to the node after receiving the topology request message of the newly added node, the newly added node refines all macs to all ports after receiving the topology messages of all other nodes, the topology of the whole network is drawn, the self topology information point-to-point is sent to other nodes, and the other nodes update the topology according to the topology messages sent by the newly added node.
When a node or another network is newly accessed, two newly-added and connected nodes discover a new connecting port and immediately broadcast own topology, the two nodes receive a topology message of the other side at the moment, the network topology is directly updated according to the local end of the topology message of the other side, all the nodes except the two nodes receive the two topology messages, one is the node in the original topology, the new node or the network is added outside the node can be known after the message is received, the other node is an external node, and the topology of the new network can be directly drawn according to the topology message.
When a node or another network is deleted, after the network finds that the arp of a certain node is aged, an adjacent node firstly inquires the port state of the adjacent node, if the connection is disconnected, a topology message of the deleted node is sent, other nodes delete the corresponding node after receiving the topology message of the deleted node, if the connection is still in, the node can be just restarted or does other things in the system, the message is not sent externally, and no processing is needed.
It should be noted that: the newly added node is a node newly added to the network, and the node is a station which is not configured or is configured and is just powered on; the new access refers to the merging of the network and another network, and the access node is a station which is powered on and operates for a period of time. The two modes need to be distinguished because the trigger conditions for sending the topology learning message to the outside are inconsistent. In addition, for the case where the network is just powered on, it can be understood that a plurality of new access nodes are added to the network.
Therefore, after one round of learning of the network, all nodes update the whole network topology, and the network is recovered to be stable. Judging whether a loop is generated when the network data flow is abnormal, and if the loop is generated, carrying out ring network damage, wherein the method comprises two conditions:
when topology learning succeeds, a loop occurs (the situation is generally caused by adding a link between two sites after a network operates stably), mac of all nodes are arranged on at least two ports of all nodes in the loop, and through the rule, the nodes can know whether the nodes are in the loop or not, and then the loop is broken according to the rule that the added connection is firstly broken or the node closest to a network management system is cut off one port;
there is also a case where a loop occurs when topology learning is unsuccessful (this case is generally that a newly added node has two or more links to connect to the original network, the newly added node does not know which link should be broken, which is easy to break, and there is no error when links are broken by nodes in the original network), at least one node in the loop should be able to know mac of all nodes learned on two ports, and at this time, it is necessary to distinguish various cases, if a node of the newly added port supports the protocol or knows the topology of the whole network, the node can break the loop by breaking the newly added port, and if the node of the newly added port does not support the protocol or does not learn the topology, another rule such as a way of breaking a path by a node closest to the network management system is used to break the loop.
The invention is described in detail below with reference to the accompanying drawings:
the situation of the newly added node is shown in fig. 3: 2-1 is a new node, which will actively send broadcast message to other nodes as shown by red line arrow after the power-on system is started, and the broadcast message is used to request other nodes to send their own topology information. After receiving the topology request message of the power-on node, the other nodes send topology messages of all other ports except the port of the power-on node 2-1 and the node mac on the port to 2-1, for example, 2-2 receives the topology request message sent from 2-1, and sends topology messages containing the port 2-2-2 and the nodes 2-3, 2-4, 2-5, 1-3, 1-2, 1-1, 1-4, 3-3, 3-2 and 3-1 on the port 2-2-2; 2-3 will send the topology message containing the port 2-3-2 and the node 2-4, 2-5, 1-3, 1-2, 1-1, 1-4, the port 2-3-3 and the node 3-3, 3-2, 3-1 to 2-1; 2-4 will send the topology message containing port 2-4-3 and its node 2-5, 2-4-2 and its node 1-3, 1-2, 1-1, 1-4 to 2-1; 3-3 will send the topology message containing port 3-3-2 and node 3-2, 3-1 on it to 2-1; other nodes also send topology messages to 2-1 according to the rule, as shown by the blue line. 2-1, after receiving all the messages, calculating the positions of all the nodes according to the topology messages, wherein the node with the most mac on the same port is nearest to the node, the node with the second most mac is beside the nearest node, and the branch port is recalculated additionally, for example, the node 2-2 is the most, which means that it is closest to the node 2-1, the node 2-3 is the second most, which is the 2-2 neighbor, the node 2-3 has two ports 2-3-2 and 2-3-3, so the following 3-3, 3-2, 3-1 and 2-4, 2-5, 1-3, 1-2, 1-1, 1-4 need to be calculated separately according to the rules of the same port, and the node on 3-3 is the most, so it is the 2-1 nearest on 2-3-3 port. By analogy, 2-1 can calculate the topology of the mesh point. After the topologies of all the nodes are drawn, the topology of the node is sent out according to the same rule, in this example, because all the nodes are on 2-1-1 and 2-1 has no other port, only the topology message of the empty mac needs to be sent, as shown by the purple line, if the node originally is 2-1 and 2-3 connected in this example and 2-2 is a newly added node, all the node macs on the 2-2-2 port need to be sent to 2-1, and the topology message of the 2-1 node mac on the 2-2-1 port needs to be sent to other nodes. After receiving the topology message, other nodes update the newly added node, so that the network topology learning can be completed.
When newly adding connection, all the original nodes know the topology of the nodes, so that the complexity of adding the nodes which are just electrified is not needed, and only two nodes which are newly added and connected need to broadcast the topology of the nodes. As in fig. 4, 2-3 and 2-4 originally are two networks, and when they are connected together, 2-3 and 2-4 find themselves with a connection on the new port and then broadcast the topology of their original network, as shown by the blue line and the red line. 2-3 directly adding the topology of 2-4 to the port 2-3-2 after receiving the broadcast packet of 2-4; 2-4 directly adding the topology of 2-3 to the port 2-4-1 after receiving the broadcast packet of 2-3; 2-5 receives two topology messages of 2-3 and 2-4, 2-4 is originally in the topology of itself, it is known that 2-4-1 on 2-4 has new connection through the topology message, 2-3 is not in the topology of itself, it is known that the topology of network connected to new connection is according to the topology message, and it is sufficient to add the topology to 2-4-1.
When a node is deleted, as in fig. 4, the original connections of 2-4 and 2-3 are deleted, 2-4 finds that all the arps except 2-4-1 are not aged, inquires about the port state of 2-4-1 and is not connected, broadcasts and sends topology messages for deleting all the nodes except the 2-4-1 port, and notifies other nodes of deletion. If the 2-4-1 connection is still in place, nothing is done for the time being.
In the present invention, a loop may appear after the topology learning is successful, or a loop may appear when the topology learning is unsuccessful.
As in fig. 5, after the network has stabilized for a period of time, each node has learned the network topology. At the moment, the 2-1-2 port of the node 2-1 and the 3-1-2 port of the node 3-1 are connected, a loop is formed among the nodes 2-1, 2-2, 2-3, 3-1, 3-2 and 3-3, the broadcast message of the node in the loop can form flooding, the broadcast message of the node outside the loop enters the loop from the 2-3-2 port, goes out from the two ports 2-3-1 and 2-3-3, and returns to the ports 2-3-3 and 2-3-1 through the loop, so that mac of all nodes can appear on at least two ports on each node in the loop, the node in the loop can know that the node is in the loop according to the abnormality, and the node 2-1 and the node 3-1 respectively close the newly added ports 2-1-2 and 3-1-2 according to the ring breaking rule, or the newly added port 2-1-2 is closed only by the node 2-1 nearest to the network pipe, and the network can be recovered normally after being closed without extra action or extra topology learning again.
As shown in fig. 6, nodes 2-2 and 2-1 are simultaneously connected to the network through two paths 2-2-2 to 2-3-1 and 2-2-3 to 1-1-3, and then loops 1-1, 1-2, 1-3, 2-2, 2-3 and 2-4 are formed. 2-1 and 2-2 are newly introduced into the network, other nodes have not learned the topology of 2-1 and 2-2 and broadcast storm, and at the moment, other nodes do not know the positions of 2-1 and 2-2 and whether the two sites participate in the ring, and 2-2 and 2-1 do not know the specific positions of the other nodes in the network, so that the 2-2 ring is not broken, but the positions of the other nodes in the network and the positions of the other nodes in the network are known, and the positions of the other nodes in the network are 1-1 and 2-3, but the 1-1-3 and the 2-3-1 are closed, the 2-2 is not connected into the network through paths, and the 2-2 is not expected to be connected into the network, so that two rules are combined, the newly added port of the nearest network management node is closed, i.e. 1-1-3 ports are switched off.
Here, the simplest and most effective destruction rule is to disconnect the newly added links, but the network exception is caused by all the newly added links being disconnected by all the nodes in the ring due to various reasons, so a limit is added, only the new link of the node nearest to the network manager is disconnected every time, and if the new link is not recovered, one link is disconnected again.
And only one node in the loop needs to support the protocol, so that the loop can be broken. As shown in fig. 5, 2-1, 2-2, 2-3, 3-1, 3-2, 3-3 form a loop, even if only 2-3 supports the protocol, when it is stable in normal times, 2-3 knows that five other stations do not respond to the topology message and that none of them supports the protocol, when it finds that there is a whole network mac on itself 2-3-1 and 2-3-3, it judges that itself is in the loop and other 5 nodes in the loop do not support the protocol of the present invention, then directly 2-3 shuts down any one of the ports to complete the loop breaking, and after the loop breaking is completed, the topology needs to be learned again.
Furthermore, the invention also provides a ring network damage system of the Ethernet, which comprises a plurality of nodes, and when the network data flow is abnormal, the ring network damage method of the Ethernet is adopted to carry out ring network damage.
It will be understood by those skilled in the art that the foregoing is only an exemplary embodiment of the present invention, and is not intended to limit the invention to the particular forms disclosed, since various modifications, substitutions and improvements within the spirit and scope of the invention are possible and within the scope of the appended claims.
Claims (10)
1. A ring network damage method of Ethernet is characterized by comprising the following steps:
when the network nodes change, each node in the network knows the topology of the whole network through topology learning;
and judging whether a loop is generated when the network data stream is abnormal, and if the loop is generated, carrying out ring network destruction.
2. The method according to claim 1, wherein each node in the network knows the topology of the entire network, and specifically comprises:
when a node is added, or a new access node or another network is accessed, or a node or another network is deleted, network topology learning is carried out so that each node in the network knows the topology of the whole network.
3. The method according to claim 1 or 2, wherein when there is a ring network, it is determined whether a loop is generated when the network data stream is abnormal, and if the loop is generated, the ring network is destroyed, specifically:
when the topology learning is successful, a loop appears, the mac of all nodes on at least two ports of all nodes in the loop is known whether the node is in the loop or not through the rule. And then according to the rule that the newly added connection is firstly disconnected or the node closest to the network management system is disconnected with a port, the damage is carried out.
4. The method for ring network disruption of ethernet network as claimed in claim 1 or 2, wherein when there is a ring network, it is determined whether a loop is generated when the network data stream is abnormal, if a loop is generated, the ring network is disrupted, specifically:
if the node of the newly added port supports the protocol or the topology is not learned, the ring is broken by the mode that the node breaks the newly added port, and if the node of the newly added port does not support the protocol or the topology is not learned, the ring is broken by other rules.
5. The method as claimed in claim 4, wherein only one node in the ring network is required to support the protocol for ring network disruption.
6. The ring network fragmentation method of ethernet according to claim 2, wherein when a newly added node is newly added to a node which has just been powered on, the newly added node system actively broadcasts its topology request packet to the whole network after starting up, after receiving the topology request packet of the newly added node, other nodes send the topology packets of all ports except the port of the newly added node and the mac of the node on the corresponding port to the node, after receiving the topology packets of all other nodes, the newly added node refines all macs to each port, draws the topology of the whole network, and sends its topology information point-to-point to other nodes, and other nodes update the topology according to the topology packet sent by the newly added node.
7. The method as claimed in claim 2, wherein when a node or another network is newly accessed, two newly added nodes find a new connection port, and immediately broadcast their own topology, and at this time, the two nodes receive the topology message of the other side, and directly update the network topology according to the local end of the topology message of the other side, all nodes except the two nodes receive two topology messages, one is the node in the original own topology, and the node is known to be added with a new node or network after receiving the message, and the other is the external node, and the topology of the new network is directly drawn according to the topology message.
8. The method as claimed in claim 2, wherein when deleting a node or another network, after the network finds that an arp of a node is aged, the neighboring node first queries the port status of itself, if the connection is broken, the topology packet of the deleted node is sent, and after receiving the topology packet of the deleted node, the other node deletes the corresponding node, if the connection is still in the middle, the node may be just at system restart or doing other things, and does not send packets to the outside, and does not need any processing.
9. The method as claimed in claim 1 or 2, wherein when the network is stable, that is, any node in the network has no change, the arp information of the whole network on each node is unchanged, and at this time, the node in the network does not need to update the topology and send any extra message.
10. A ring network damage system of Ethernet is characterized in that the system comprises a plurality of nodes, and when the network data flow is abnormal, the ring network is broken by adopting a ring network damage method of the Ethernet from right 1 to right 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210478203.6A CN114760207A (en) | 2022-05-05 | 2022-05-05 | Ring network damage method and system of Ethernet |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210478203.6A CN114760207A (en) | 2022-05-05 | 2022-05-05 | Ring network damage method and system of Ethernet |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114760207A true CN114760207A (en) | 2022-07-15 |
Family
ID=82333534
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210478203.6A Withdrawn CN114760207A (en) | 2022-05-05 | 2022-05-05 | Ring network damage method and system of Ethernet |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114760207A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115102660A (en) * | 2022-08-26 | 2022-09-23 | 深圳市英特瑞半导体科技有限公司 | Method, device, equipment and storage medium for breaking damage based on synchronous Ethernet |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000278309A (en) * | 1999-03-26 | 2000-10-06 | Nec Corp | Point-to-point communication network system and communication control method |
| CN101771593A (en) * | 2008-12-29 | 2010-07-07 | 迈普通信技术股份有限公司 | Ethernet ring network interconnecting method |
| WO2011023123A1 (en) * | 2009-08-28 | 2011-03-03 | 迈普通信技术股份有限公司 | Method and system for monitoring ethernet automatic protection switching (eaps) ring network topology |
| CN102118291A (en) * | 2011-03-25 | 2011-07-06 | 华为技术有限公司 | Ring network link failure processing method, device and ring network |
| CN102938737A (en) * | 2012-11-22 | 2013-02-20 | 华为技术有限公司 | Layer-2 ring network proxy method and equipment |
| US20130279366A1 (en) * | 2012-04-20 | 2013-10-24 | Sachin Surendran | Self-healing communications network |
| CN103475583A (en) * | 2012-06-07 | 2013-12-25 | 华为技术有限公司 | Method and equipment for removing media access control forwarding table entries |
| CN107968753A (en) * | 2016-10-20 | 2018-04-27 | 华为技术有限公司 | The method and apparatus for changing Media Access Control Address forwarding table |
| CN110832453A (en) * | 2017-05-16 | 2020-02-21 | 甲骨文国际公司 | Distributed version control of applications using cloud-based systems |
| WO2020052687A1 (en) * | 2018-09-14 | 2020-03-19 | 中兴通讯股份有限公司 | Network element anti-looping method and apparatus, device, and readable storage medium |
| CN112737938A (en) * | 2020-11-30 | 2021-04-30 | 北京东土军悦科技有限公司 | DRP switching method, device, equipment and medium |
-
2022
- 2022-05-05 CN CN202210478203.6A patent/CN114760207A/en not_active Withdrawn
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000278309A (en) * | 1999-03-26 | 2000-10-06 | Nec Corp | Point-to-point communication network system and communication control method |
| CN101771593A (en) * | 2008-12-29 | 2010-07-07 | 迈普通信技术股份有限公司 | Ethernet ring network interconnecting method |
| WO2011023123A1 (en) * | 2009-08-28 | 2011-03-03 | 迈普通信技术股份有限公司 | Method and system for monitoring ethernet automatic protection switching (eaps) ring network topology |
| CN102118291A (en) * | 2011-03-25 | 2011-07-06 | 华为技术有限公司 | Ring network link failure processing method, device and ring network |
| US20130279366A1 (en) * | 2012-04-20 | 2013-10-24 | Sachin Surendran | Self-healing communications network |
| CN103475583A (en) * | 2012-06-07 | 2013-12-25 | 华为技术有限公司 | Method and equipment for removing media access control forwarding table entries |
| CN102938737A (en) * | 2012-11-22 | 2013-02-20 | 华为技术有限公司 | Layer-2 ring network proxy method and equipment |
| CN107968753A (en) * | 2016-10-20 | 2018-04-27 | 华为技术有限公司 | The method and apparatus for changing Media Access Control Address forwarding table |
| CN110832453A (en) * | 2017-05-16 | 2020-02-21 | 甲骨文国际公司 | Distributed version control of applications using cloud-based systems |
| WO2020052687A1 (en) * | 2018-09-14 | 2020-03-19 | 中兴通讯股份有限公司 | Network element anti-looping method and apparatus, device, and readable storage medium |
| CN112737938A (en) * | 2020-11-30 | 2021-04-30 | 北京东土军悦科技有限公司 | DRP switching method, device, equipment and medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115102660A (en) * | 2022-08-26 | 2022-09-23 | 深圳市英特瑞半导体科技有限公司 | Method, device, equipment and storage medium for breaking damage based on synchronous Ethernet |
| CN115102660B (en) * | 2022-08-26 | 2022-11-04 | 深圳市英特瑞半导体科技有限公司 | Method, device, equipment and storage medium for breaking based on synchronous Ethernet |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9461841B2 (en) | Communication system, communication method, node, and program for node | |
| US7636299B2 (en) | Packet repeater | |
| US6717922B2 (en) | Network configuration protocol and method for rapid traffic recovery and loop avoidance in ring topologies | |
| CN101610193B (en) | Method for automatically discovering Ethernet ring and generating ring | |
| US7724644B2 (en) | Node redundancy method, interface card, interface device, node device, and packet ring network system | |
| US8203932B2 (en) | Method and system for protection switching in ethernet ring | |
| US20100110881A1 (en) | Method for protection switching in ethernet ring network | |
| CN101582834B (en) | Updating method and system of forwarding table during service transmission of Ethernet | |
| CN101741673B (en) | Address refreshing method of Ethernet ring | |
| EP2493116A1 (en) | Topology management method of ether multi-ring network, and system thereof | |
| US9450830B2 (en) | Node apparatus and communication method | |
| US20120224471A1 (en) | Method and system for ring protection switching | |
| CN109525445B (en) | Link switching method, link redundancy backup network and computer readable storage medium | |
| CN107968753B (en) | Method and device for modifying media access control address forwarding table | |
| US9509523B2 (en) | Method for protection switching in ethernet ring network | |
| JP5580787B2 (en) | Network relay device and control method thereof | |
| CN114760207A (en) | Ring network damage method and system of Ethernet | |
| CN112995002B (en) | Switch ring network design method, switch and storage medium | |
| US10135715B2 (en) | Buffer flush optimization in Ethernet ring protection networks | |
| JP5491623B2 (en) | Address refresh method and system | |
| US10489236B2 (en) | Method and system for managing a communication network | |
| CN100550812C (en) | Improve method, system and the node device of dependability of fast looped network | |
| CN107196832B (en) | Rapid ring network protection method | |
| CN107547330B (en) | Method and node equipment for transmitting service data | |
| CN102238056B (en) | Automatic ring network protection topology structure discovery method and device |
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: 20220715 |
|
| WW01 | Invention patent application withdrawn after publication |