WO2009111954A1 - 一种防止以太多环网络中出现网络风暴的方法和系统 - Google Patents

一种防止以太多环网络中出现网络风暴的方法和系统 Download PDF

Info

Publication number
WO2009111954A1
WO2009111954A1 PCT/CN2009/070027 CN2009070027W WO2009111954A1 WO 2009111954 A1 WO2009111954 A1 WO 2009111954A1 CN 2009070027 W CN2009070027 W CN 2009070027W WO 2009111954 A1 WO2009111954 A1 WO 2009111954A1
Authority
WO
WIPO (PCT)
Prior art keywords
ring
link
logical area
logical
network
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.)
Ceased
Application number
PCT/CN2009/070027
Other languages
English (en)
French (fr)
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.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to US12/921,435 priority Critical patent/US8565072B2/en
Priority to EP09718861A priority patent/EP2254282A4/en
Publication of WO2009111954A1 publication Critical patent/WO2009111954A1/zh
Anticipated expiration legal-status Critical
Ceased 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/42—Loop networks
    • H04L12/437—Ring fault isolation or reconfiguration

Definitions

  • the present invention relates to the field of data communications, and more particularly to a method and system for preventing network failures in too many ring networks.
  • NTN Next Generation Network
  • IPTV Internet Protocol Television
  • RFC3619 defines an Ethernet automatic protection switching method. This method solves the problem that the network equipment converges slowly when the Ethernet device is in the ring network topology. This method can make the convergence time within 50ms.
  • the RFC3619 ring is composed of multiple nodes connected, one of which is defined as the primary node. In some technologies, the primary node is also called the node to which the ring protection link belongs, and the other nodes are defined as the transmission node.
  • the two ports on the ring of the master node are defined as the master port and the slave port respectively.
  • the link directly connected to the slave port can be called a ring protection link.
  • a ring protection link is an on-ring link that blocks traffic communication data when there is no fault or request in the Ethernet ring to prevent closed loop.
  • the master node blocks the service data forwarding function of the slave port, that is, the ring protection link is blocked, so that the service data cannot pass through the slave port of the master node, ensuring the service VLAN (Virtual Local Area Network , Virtual Local Area Network) does not form a closed loop, preventing "broadcast storms" caused by closed loops.
  • the master node opens the service data forwarding function of the slave port, that is, the ring protection link is opened, so that the service data can pass through the slave port of the master node, ensuring the communication of service data without interruption. .
  • Figure la is a topological diagram of the RFC3619 ring, consisting of nodes S1, S2, S3, and S4, where the master node (MASTER) is S2, and the remaining nodes S1, S3, and S4 are transit nodes (TRANSIT).
  • the two ring ports of the master node S2 are the master port and the slave port, respectively, where port 2 is the master port (P) and port 1 is the slave port (S).
  • port 2 is the master port (P)
  • port 1 is the slave port (S).
  • Figure lb when the link on the ring is intact, the primary node S2 is blocked. The service data forwarding function of port 1 prevents a closed loop in the network and forms a "network storm".
  • the master node S2 opens the service data forwarding function from port 1. Make business data reconnect.
  • RFC3619 solves the problem of fast convergence of a single physical ring network.
  • the actual networking is usually complicated, and multiple physical rings are tangent.
  • FIG 2a there is a topology structure in which a plurality of RFC3619 rings intersect.
  • S1, S2, S3, and S4 form a ring 1
  • S2 is a master node
  • port 2 of node S2 is a master port
  • port 1 is a slave port
  • S4, S5, and S6 form a ring 2
  • S6 is the master node
  • port 2 of node S6 is the master port
  • port 1 is the slave port.
  • the master nodes S2 and S6 respectively block their respective ports. From the port.
  • the port is blocked. After the port is blocked, the service data cannot be forwarded. If the port is opened, the port can be forwarded and the service data can be forwarded. The blocked or opened port does not affect the protocol frame forwarding of the Ethernet loop protection. If the link is blocked, one of the two ports adjacent to the link is blocked or both ports are blocked. The service data cannot be forwarded through one of the two adjacent ports of the link and cannot pass the blocking. Link; When the link is opened, both ports adjacent to the link are opened, and service data can be forwarded through two adjacent ports of the link.
  • the technical problem to be solved by the present invention is to provide a method and system for preventing network storms in an Ethernet ring network, which can effectively prevent network storms in the Ethernet ring network and improve the fault resistance capability of the Ethernet network.
  • the present invention provides a method for preventing network storms from occurring in a network with too many rings, including: when a fault occurs in one of the many ring networks, at most one ring protection link is opened.
  • the loop protection link is in the same logical area as the fault link.
  • each link in the too many ring networks uniquely belongs to one logical area. When a link in a too many ring networks fails, the primary node of the logical area where the faulty link is located will be ring protected. The link is open.
  • Ethernet multi-ring network is divided into multiple single rings, and the shared link between adjacent single rings is divided into one single ring, and the closed single ring is the main ring, A closed single loop is a sub-ring, and both the primary ring and the sub-ring are referred to as logical regions.
  • each link in the too many ring networks belongs to one or more logical areas, and each logical area is set with a priority.
  • each logical area is set with a priority.
  • the ring protection link of one logical area with the highest priority of the link is opened by the primary node of the logical area.
  • each single ring in the Ethernet multi-ring network is a logical area, and each logical area has a different priority.
  • the primary node of the logical area where the faulty link is located does not operate.
  • the present invention also provides a system for preventing network storms from occurring in a network with too many rings, including a plurality of nodes, each of which is connected by a link, wherein
  • Each node records its own logical area
  • the master node in the logical area where the faulty link is located only opens a ring protection link in the logical area.
  • each link in the too many ring networks uniquely belongs to one logical area, and two nodes connected by the link record the logical area in which the link is located; when a link in too many ring networks fails, The primary node of the logical area where the faulty link is located opens the ring protection link.
  • Ethernet multi-ring network is divided into multiple single rings, and the shared link between adjacent single rings is divided into one single ring, and the closed single ring is the main ring, A closed single loop is a sub-ring, and both the primary ring and the sub-ring are referred to as logical regions.
  • each link in the too many ring networks belongs to one or more logical areas, and each logical area sets a priority, and two nodes connected by the link record the logical area where the link is located. And the priority of the logical area; when a link in the too many ring networks fails, the primary node of the logical area containing the highest priority of the faulty link opens the ring protection link of the logical area.
  • each single ring in the Ethernet multi-ring network is a logical area, and each logical area has a different priority.
  • the method and system of the present invention are applicable to both a simple multi-ring network and a complex multi-ring network, which fundamentally solves the problem that multiple ring protection links are opened due to a link failure.
  • the fault of the "hyper loop" improves the anti-fault capability of the network with too many rings.
  • Figure la is a topography of the RFC3619 ring
  • Figure lb is a topology diagram when the link on the RFC3619 ring is not faulty
  • Figure lc is a topology diagram when the uplink link of the RFC3619 ring fails
  • Figure 2a is a topography diagram when multiple RFC3619 rings intersect
  • Figure 2b is a topological diagram of a failure of a shared link of multiple RFC3619 rings
  • Figure 3 is a flow chart showing the implementation of preventing network storms in a network with too many rings
  • 4a and 4b are specific applications of the primary ring-sub-ring logical definition method in two intersecting ring topologies according to the first embodiment of the present invention
  • 5a and 5b illustrate a specific application of a primary ring-sub-ring logical definition method in a complex multi-ring topology structure according to a second embodiment of the present invention
  • FIG. 7 is a specific application of a priority logic definition method in a complex multi-ring topology structure according to a fourth embodiment of the present invention.
  • the analysis of the prior art shows that the cause of the fault is that the logical area protected by too many rings is unclear.
  • the shared road segment is divided into multiple Ethernet ring protection areas. When the shared road segment fails, the shared road segment belongs to multiple The Ethernet protection zone opens the originally blocked ring protection link, resulting in a "hyper ring".
  • the core of the present invention is that when a link in a too many ring networks fails, at most one ring protection link is opened, and the ring protection link is in the same logical area as the faulty link.
  • the link in the too many ring networks belongs to only one logical area, or the links in the too many ring networks belong to multiple logical areas, but the logical areas have different priorities.
  • a logical area definition of a physical loop with too many ring networks is first performed, so that one link in a too many ring networks is logically protected only by one logical area, or the shared link belongs to multiple a logical area, but each logical area has a priority difference, the link is protected by the highest priority logical area (step 301), so that when a link fails, the link has the most failure
  • the ring protection link of the logical area to which the link belongs is opened. If the faulty link belongs to multiple logical areas, only the ring protection link of the logical area with the highest priority belongs to the faulty link. Step 302), and a link does not belong to multiple logical areas, and the failure of the link causes the ring protection link of multiple logical areas to be opened to cause a "hypercyclic" situation.
  • the Ethernet multi-ring network is divided into multiple single rings, and the shared link between adjacent single rings is divided into one single ring, the closed single ring is the primary ring, and the unclosed single ring is the sub-ring.
  • the primary ring and the sub-ring are both referred to as logical regions.
  • the logical area definition principle is: There will be no shared road segments between the two areas. If there is a shared road segment, the shared road segment will be assigned to one of the areas. For example, if the second area has a shared road segment with the first area, the shared road section belongs to the first area, and the second area is after the shared road section is removed.
  • the set of road segments connects the intersecting nodes of the first area and the second area, and belongs to the first area and the second area together.
  • the order in which the regions are selected is not necessarily in time or order.
  • the second region may be selected first, and then the first region may be selected.
  • each region is a logically complete single ring (ie, single ring) or a logically incomplete single ring (ie, chain), each link is unique.
  • a logical area has only one ring protection link.
  • each link may also belong to one or more regions as in the prior art, but there should be a prioritization between the regions.
  • a link fails, and the link belongs to multiple logical areas, only the ring protection link in the high-priority logical area is opened, so that the ring protection link of multiple logical areas does not open. And the situation of "super ring" appears.
  • the system for preventing the occurrence of network storms in a too many ring networks by the above method includes a plurality of nodes, each node is connected by a link, and each node records its own logical area; when a link in a too many ring networks is used When a fault occurs, the master node in the logical area where the faulty link is located only opens a ring protection link in the logical area.
  • each link in a too many ring networks may uniquely belong to one logical area, and two nodes connected by the link record their own logical area; when a link in too many ring networks fails, The primary node of the logical area where the faulty link is located opens the ring protection link.
  • each link in the too many ring networks belongs to one or more logical areas, and each logical area sets a priority, and two nodes connected by the link record the logical area where the user is located and the priority of the logical area;
  • the master node of the logical area containing the highest priority of the faulty link opens the ring protection link of the logical area.
  • the first embodiment and the second embodiment define a logical region with too many rings to define a primary ring-subring Method;
  • the third embodiment uses the definition method of the sub-ring;
  • the fourth embodiment uses the method of defining the area priority which is further changed by the present invention.
  • An application example 1 of the present invention is two intersecting ring topologies as shown in Figure 4a.
  • ring 1 is selected as the primary ring.
  • the primary ring can also be called the ring, that is, the first logical area.
  • the logical area of the primary ring includes S1-S2-S4-S3-S1, which is logically complete.
  • the single ring; the part of the ring 2 that is removed from the shared segment in the ring 1 is the sub-ring, that is, the second area, and the logical area of the sub-ring includes S3-S5-S6-S4, which is not a complete single logically.
  • each link is protected by a unique logical area.
  • the link It belongs to the primary ring instead of the sub-ring, so it only causes the ring protection link of the primary ring to be opened, and does not cause the ring protection link of the sub-ring to be opened to cause "hyper ring".
  • the second application example of the present invention is a complex intersecting ring topology as shown in FIG. 5a.
  • ring 0 is selected as the primary ring.
  • the primary ring can also be called a ring, that is, the first logical area.
  • the primary ring is S1-S2-S3-S6-S5-S4-S1.
  • the second logical area is defined. That is, subring 1 and subring 1 are the parts of ring 1 after the shared section with the primary ring is removed, that is, S4-S9-S10-S11-S6; the third logical area is defined, that is, subring 2, and subring 2 is a ring.
  • the part after the shared section with the primary ring is removed that is, S4-S12-S13-S6; the fourth logical area is defined, that is, the sub-ring 3, and the sub-ring 3 is the part of the ring 3 after the shared section with the primary ring is removed.
  • sub-ring 4 that is, S1-S7-S8-S3; define a fifth logical region, that is, sub-ring 4, and sub-ring 4 is a portion of ring 4 connected to sub-ring 1, that is, S9-S14-S15-S16-S11;
  • the logical region, that is, the sub-ring 5, the sub-ring 5 is the portion of the ring 5 connected to the sub-ring 2, that is, S12-S17-S13;
  • the seventh logical region is defined, that is, the sub-ring 6 is connected, and the sub-ring 6 is connected to the ring 6
  • the portion on the ring 2, that is, S3-S18-S13, the ring 6 and the main ring, and the shared link portion of the sub-ring 2 do not belong to the sub-ring 6.
  • each link is protected by a unique logical area.
  • the link of the ring for example, the link between S4-S5 fails, the link belongs to Main ring instead of subring 1 or 2, so Only the ring protection link of the primary ring is opened, and the ring protection link of the subring is not opened, resulting in "hyper ring”.
  • S1 is the master node in the primary ring
  • the primary node may also be referred to as the node to which the ring protection link belongs, and S1-S4 is the ring protection link
  • S9 is the master node
  • S4-S9 is Ring protection link
  • S12 is the master node
  • S4-S12 is the ring protection link
  • S7 is the master node
  • S1-S7 is the ring protection link
  • S14 is The primary node
  • S9-S14 is a ring protection link
  • S17 is the master node
  • S13-S17 is the ring protection link
  • S18-S13 is the ring protection link.
  • the nodes S1 to S17 have service data transmission, and the only path of the service data transmission is Sl-S2-S3-S6-S13-S12-S17.
  • the neighboring node of the faulty link sends a message to the master node to notify the link fault.
  • the master node determines that the failed link belongs to the same logical area as the master node, and then opens the slave port. That is, the ring protection links S1-S4 are opened, and the only path of service data transmission from S1 to S17 is S1-S4-S5-S6-S13-S12-S17.
  • link S6-S13 fails, the link belongs to subring 2 only, and the primary node S12 of subring 2 opens ring protection link S4-S12.
  • the only path of service data transmission from S1 to S17 is Sl-S2. -S3-S6-S5-S4-S12-S17.
  • This embodiment is a specific application of the sub-ring logical definition method in a complex multi-ring topology.
  • the logical division method of the sub-ring is used, but the sub- The ring segment does not consider the hierarchical relationship.
  • the shared segment belongs to any one of the subrings connected to it.
  • the link contained in subring 0 is S1-S2-S3-S6-S5-S4- S1;
  • the sub-ring 1 contains the links S4-S9 and S6-S11, and the shared segment S4-S5-S6 with sub-ring 0 belongs to ring 0, and the shared segment S9-S10-S11 with sub-ring 4 belongs to the sub-ring.
  • subring 4 contains links S9-S10-S11-S16-S15 -S14-S9; sub-ring 3 contains the link S1-S7-S8-S3; sub-ring 6 contains the link S3-S18-S13; sub-ring 2 contains the link S4-S12, S6-S13
  • the shared link S4-S5-S6 with the sub-ring 0 belongs to the sub-ring 0, the shared link S12-S13 with the sub-ring 5 belongs to the sub-ring 5, and the sub-ring 5 includes the link S12-S17-S13-S12.
  • the links included in each loop in the figure are represented by different dashed lines or solid lines.
  • the nodes S1 to S17 have service data transmission, and the only path of the service data transmission is Sl-S2-S3. -S6-S13-S12-S17.
  • the link S3-S6 is faulty, the link belongs to sub-ring 0 only, and the primary node S1 of sub-ring 0 opens the ring protection link S1-S4.
  • the only path that the service data is transmitted from S1 to S17 is Sl-S4. -S5-S6-S13-S12-S17.
  • a priority logic definition method is used.
  • each logical area is a complete single ring, and different priorities are defined.
  • each link can belong to multiple logical areas.
  • Priority The ring protection link of the logical area of the level is opened without causing the ring protection link of multiple logical areas to be opened to form a "hyper ring".
  • ring 0 has a priority of 0 and is a complete single ring.
  • Ring 1 has a priority of 1 and is a complete single ring.
  • Ring 2 has a priority of 2 and is a complete single.
  • ring 3 has a priority of 3 and is a complete single ring;
  • ring 4 has a priority of 4 and is a complete single ring;
  • ring 5 has a priority of 5 and is a complete single ring;
  • ring 6 The priority is 6, which is a complete single ring.
  • Link S4-S5 belongs to ring 0, ring 1, and ring 2.
  • link S4-S5 fails, if the link is open before the fault occurs, ring 0 has the highest priority, so it only The ring protection link that causes ring 0 is opened without causing the ring protection link of ring 1 and ring 2 to open to form a "hyper ring".
  • the present embodiment is apparently inconsistent with the principle of the present invention that "only one logical region per link" does not actually correspond to the present invention. In the event of a failure, only one ring protection link in one logical area is opened, and there is no case where a ring protection link of multiple logical areas is opened and a 'hypercyclic ring' occurs.
  • the priority division in this embodiment is only an example, and the division of priorities is performed as needed, as long as the priorities of the respective logical areas are different.
  • the present invention is applicable to both a simple multi-ring network and a complex multi-ring network, and fundamentally solves the problem of "super-ring" caused by multiple ring protection links being opened due to one link failure. , improved the ability to resist failure with too many ring networks.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)

Description

一种防止以太多环网络中出现网络风暴的方法和系统
技术领域
本发明涉及数据通信领域， 更具体地涉及一种防止以太多环网络中发生 网络故障的方法和系统。
背景技术
随着 IP网络向着多业务承载方向的发展， 下一代网络（ Next Generation Network, 简称 NGN ) 、 网络电视（ Internet Protocol Television, 简称 IPTV ) 等业务对于网络的可靠性、 实时性要求越来越高， 接入网二层网络的传统环 网保护 STP (生成树， Spanning Tree Protocol )技术逐渐不能满足快速收敛、 链路切换的要求。
RFC3619定义了一种以太网自动保护切换方法， 该方法解决了以太网设 备在环状网络拓朴时网络故障收敛慢的问题， 利用该方法能够使得收敛时间 在 50ms以内。 RFC3619环由多个节点相连组成， 其中一个节点定义为主节 点， 在有些技术中主节点也称为环保护链路所属节点， 其他节点定义为传输 节点。 主节点在环上的两个端口分别定义为主端口和从端口， 与从端口直连 的链路可以称为环保护链路。 环保护链路是当以太环网中没有任何故障或者 请求时被阻塞业务通信数据以防止闭环的一条环上链路。 当环上链路都没有 故障时， 主节点阻塞从端口的业务数据转发功能， 即阻塞了环保护链路， 使 得业务数据不能从主节点的从端口通过， 保证了业务 VLAN ( Virtual Local Area Network, 虚拟局域网）不会形成闭环， 防止了由于闭环引起的 "广播风 暴" 。 当环上链路出现故障时， 主节点打开从端口的业务数据转发功能， 即 打开环保护链路， 使得业务数据可以从主节点的从端口通过， 保证了业务数 据的连通， 不会出现中断。
如图 la是 RFC3619环的拓朴图， 由节点 Sl、 S2、 S3和 S4组成， 其中 主节点 （MASTER )是 S2, 其余节点 Sl、 S3、 S4是传输节点 (TRANSIT)。 主节点 S2的两个环上端口分别是主端口和从端口，其中端口 2是主端口（P ), 端口 1是从端口 （S )。 如图 lb所示， 当环上链路完好时， 主节点 S2阻塞了 从端口 1的业务数据转发功能， 防止网络中存在闭环， 形成 "网络风暴" ； 如图 lc所示， 当环上链路出现故障时， 主节点 S2打开了从端口 1的业务数 据转发功能， 使得业务数据重新连通。
RFC3619很好地解决了单个物理环网的快速收敛问题， 然而实际组网通 常比较复杂， 存在多个物理环相切的情况。 如图 2a所示为多个 RFC3619环 相交的拓朴结构， 图中 Sl、 S2、 S3、 S4组成环 1 , S2是主节点， 节点 S2的 端口 2为主端口， 端口 1为从端口； S3、 S4、 S5、 S6组成环 2, S6是主节点， 节点 S6的端口 2是主端口， 端口 1是从端口， 当环上链路都没有故障时， 主 节点 S2和 S6分别阻塞了各自的从端口。 当两个环的共享路段， 即节点 S3 和 S4之间的链路发生故障时， 如图 2b所示， 环 1中链路出现了故障， 主节 点 S2打开从端口， 环 2中链路出现了故障， 主节点 S6打开从端口， 整个环 上出现了 "超环" 的闭环， 形成 "网络风暴" ， 网络出现故障。 也会遇到同样的问题， 即共享路段的故障会使得多个环保护链路被打开， 最 终导致整个环上出现 "超环" ， 形成 "网络风暴" 的网络故障。
本文中端口被阻塞指端口被设置阻塞后不能转发业务数据， 端口被打开 是指端口被设置打开后可以转发业务数据， 其中端口被阻塞或者打开都不影 响以太网环路保护的协议帧转发。 链路被阻塞是指链路相邻的两个端口中有 一个端口被阻塞或者两个端口都被阻塞， 业务数据不能通过该链路的两个相 邻端口中的一个转发而无法通过该阻塞链路； 链路被打开是指链路相邻的两 个端口都被打开， 业务数据可以通过该链路的两个相邻端口转发。
发明内容
本发明要解决的技术问题是提供一种防止以太环网中出现网络风暴的方 法和系统， 能够有效防止以太环网中出现网络风暴， 提高以太多环网络的抗 故障能力。
为了解决上述技术问题， 本发明提供了一种防止以太多环网络中出现网 络风暴的方法， 包括： 当以太多环网络中的某一条链路发生故障时， 最多打 开一条环保护链路， 所述环保护链路与所述故障链路处于同一逻辑区域中。 进一步地， 所述以太多环网络中的每条链路唯一属于一个逻辑区域， 当 以太多环网络中的某条链路发生故障， 所述故障链路所在的逻辑区域的主节 点将环保护链路打开。
进一步地， 划分逻辑区域时， 先将所述以太网多环网络划分为多个单环， 将相邻单环间的共享链路划分给其中一个单环， 闭合的单环为主环， 不闭合 的单环为子环， 所述主环和子环均称为逻辑区域。
进一步地，所述以太多环网络中的各链路分别属于一个或多个逻辑区域， 为各逻辑区域设置优先级， 当以太多环网络中的某条链路发生故障时， 包含 所述故障链路的优先级最高的一个逻辑区域的环保护链路被该逻辑区域的主 节点打开。
进一步地， 所述以太网多环网络中每个单环为一个逻辑区域， 每个逻辑 区域的优先级不同。
进一步地， 当所述故障链路为环保护链路时， 所述故障链路所在逻辑区 域主节点不做操作。
为了解决上述技术问题， 本发明还提供了一种防止以太多环网络中出现 网络风暴的系统， 包括多个节点， 各节点之间通过链路相连接， 其中，
各节点记录自己所在的逻辑区域；
当以太多环网络中的某条链路发生故障时， 该故障链路所在逻辑区域的 主节点最多只打开所述逻辑区域中的一条环保护链路。
进一步地， 所述以太多环网络中的每条链路唯一属于一个逻辑区域， 该 链路连接的两个节点记录自己所在的逻辑区域； 当以太多环网络中的某条链 路发生故障， 所述故障链路所在的逻辑区域的主节点打开环保护链路。
进一步地， 划分逻辑区域时， 先将所述以太网多环网络划分为多个单环， 将相邻单环间的共享链路划分给其中一个单环， 闭合的单环为主环， 不闭合 的单环为子环， 所述主环和子环均称为逻辑区域。
进一步地，所述以太多环网络中的各链路分别属于一个或多个逻辑区域， 各逻辑区域设置优先级， 该链路连接的两个节点记录自己所在的逻辑区域以 及此逻辑区域的优先级； 当以太多环网络中的某条链路发生故障时， 包含所 述故障链路的优先级最高的一个逻辑区域的主节点打开该逻辑区域的环保护 链路。
进一步地， 所述以太网多环网络中每个单环为一个逻辑区域， 每个逻辑 区域的优先级不同。
釆用本发明所述方法和系统， 既适用于简单的多环网络， 也适用于复杂 的多环网络， 从根本上解决了由于一条链路故障引起多个环保护链路被打开 而导致 "超环" 的故障， 提高了以太多环网络的抗故障能力。 附图概述
图 la为 RFC3619环的拓朴图；
图 lb为 RFC3619环上链路没有故障时的拓朴图；
图 lc为 RFC3619环上链路出现故障时的拓朴图；
图 2a为多个 RFC3619环相交时的拓朴图；
图 2b为多个 RFC3619环的共享链路出现故障的拓朴图；
图 3为防止以太多环网络中出现网络风暴的实施流程图；
图 4a、 4b为本发明第一实施例釆用主环-子环逻辑定义方法在两个相交 环拓朴结构中的具体应用；
图 5a、 5b为本发明第二实施例釆用主环-子环逻辑定义方法在复杂多环 拓朴结构中的具体应用；
图 6为本发明第三实施例釆用子环逻辑定义方法在复杂多环拓朴结构中 的具体应用；
图 7为本发明第四实施例釆用优先级逻辑定义方法在复杂多环拓朴结构 中的具体应用。
本发明的较佳实施方式 对现有技术分析可知， 出现该故障的原因是对以太多环保护的逻辑区域 不清晰， 共享路段被划分在多个以太环保护区域中， 当共享路段发生故障时， 共享路段所属的多个以太保护区域都打开原来阻塞的环保护链路，导致了 "超 环" 。
本发明的核心在于， 当以太多环网络中的某一条链路发生故障时， 最多 打开一条环保护链路， 且该环保护链路与故障链路处于同一逻辑区域中。
所述以太多环网络中的任一条链路唯一属于一个逻辑区域， 或者所述以 太多环网络中的链路同属于多个逻辑区域， 但各逻辑区域之间有不同的优先 级。
如图 3所示， 首先对以太多环网的物理环路进行逻辑的区域定义， 使得 以太多环网络中的一条链路在逻辑上只唯一由一个逻辑区域所保护， 或者共 享链路属于多个逻辑区域， 但是各逻辑区域之间有优先级的区别， 该链路由 最高优先级的逻辑区域所保护（步骤 301 ) ， 这样， 当某条链路发生故障时， 该链路的故障最多只会导致该链路所属逻辑区域的环保护链路被打开， 若该 故障链路属于多个逻辑区域， 则最多只打开该故障链路所属的优先级最高的 逻辑区域的环保护链路（步骤 302 ) ， 而不会出现一条链路属于多个逻辑区 域， 该链路的故障导致多个逻辑区域的环保护链路被打开而出现 "超环" 的 情况。
对以太多环网的物理环路进行逻辑的区域定义时， 在以太多环中选出一 个单环为第一区域； 按照以太多环的逻辑区域定义原则， 在以太多环中选出 一个单环或者不完整的单环为第二个区域， 以此类推， 依次选出其他区域。 具体实现时， 将以太网多环网络划分为多个单环， 将相邻单环间的共享链路 划分给其中一个单环， 闭合的单环为主环， 不闭合的单环为子环， 所述主环 和子环均称为逻辑区域。 每个逻辑区域中均有一个主节点， 用于控制该逻辑 区域中环保护链路的打开与关闭。
逻辑区域定义原则是： 两个区域之间不会有共享路段， 如果出现了共享 路段， 则将这个共享路段分给其中一个区域。 例如， 如果第二区域与第一区 域有共享路段， 则共享路段属于第一区域， 第二区域为除去这些共享路段后 的路段集合， 连接第一区域和第二区域的相交节点， 共同属于第一区域和第 二区域。
但是选择区域的顺序不一定是时间或者顺序上的， 也可以先选择第二区 域， 再选择第一区域。
在以太多环的逻辑区域定义完毕后， 每个区域都是一个在逻辑上完整的 单环 （即单环状）或者逻辑上不完整的单环（即链状） ， 每条链路只有唯一 所属逻辑区域， 对于连接多个逻辑区域的节点， 则属于多个区域。 一个逻辑 区域只有一条环保护链路。
在其他实施例中， 各链路也可如现有技术一样属于一个或多个区域， 但 是各区域之间应有优先级的区别。 当某条链路发生故障时， 且该链路属于多 个逻辑区域时， 只有高优先级的逻辑区域中的环保护链路被打开， 从而不会 出现多个逻辑区域的环保护链路打开而出现 "超环" 的情况。
实现上述方法的防止以太多环网络中出现网络风暴的系统包括多个节 点， 各节点之间通过链路相连接， 各节点记录自己所在的逻辑区域； 当以太 多环网络中的某条链路发生故障时， 该故障链路所在逻辑区域的主节点最多 只打开所述逻辑区域中的一条环保护链路。
具体实现时， 以太多环网络中的每条链路可以唯一属于一个逻辑区域， 该链路连接的两个节点记录自己所在的逻辑区域； 当以太多环网络中的某条 链路发生故障， 该故障链路所在的逻辑区域的主节点打开环保护链路。
或者， 以太多环网络中的各链路分别属于一个或多个逻辑区域， 各逻辑 区域设置优先级， 该链路连接的两个节点记录自己所在的逻辑区域以及此逻 辑区域的优先级； 当以太多环网络中的某条链路发生故障时， 包含该故障链 路的优先级最高的一个逻辑区域的主节点打开该逻辑区域的环保护链路。
以下对具体实施方式进行详细描述， 但不作为对本发明的限定。
第一实施例和第二实施例的以太多环的逻辑区域定义釆用主环 -子环的 方法； 第三实施例釆用了子环的定义方法； 第四实施例釆用了本发明进一步 变化的区域优先级定义方法。
第一实施例
本发明应用实例一为如图 4a所示的两个相交环拓朴。 在两个环中， 选择 环 1为主环， 主环也可以称为环， 即第一逻辑区域， 则主环的逻辑区域包括 S1-S2-S4-S3-S1 , 在逻辑上是一个完整的单环； 选择环 2中除去与环 1中的共 享路段后的部分为子环， 即第二区域， 子环的逻辑区域包括 S3-S5-S6-S4 , 在 逻辑上不是一个完整的单环， 而是链状， 其中环 1和环 2之间的共享链路， 即 S3-S4之间的链路， 属于主环， 而不是属于子环， 节点 S3和 S4为主环和 子环共同所属， 如图 4b所示。 这样对以太多环进行逻辑区域定义后， 每条链 路都被惟一的逻辑区域所保护， 当两个环的共享链路， 即 S3-S4之间的链路 发生故障时， 由于该链路是属于主环而不是子环， 因此只会导致主环的环保 护链路被打开， 而不会使得子环的环保护链路被打开而导致 "超环" 。
第二实施例
本发明应用实例二为如图 5a所示为复杂的相交环拓朴。 如图 5b所示， 选择环 0 为主环， 主环也可以称为环， 即第一逻辑区域， 主环为 S1-S2-S3-S6-S5-S4-S1 ; 定义第二逻辑区域， 即子环 1 , 子环 1为环 1中除去 与主环的共享路段后的部分， 即 S4-S9-S10-S11-S6; 定义第三逻辑区域， 即 子环 2 ,子环 2为环 2中除去与主环的共享路段后的部分， 即 S4-S12-S13-S6; 定义第四逻辑区域， 即子环 3 , 子环 3为环 3中除去与主环的共享路段后的 部分， 即 S1-S7-S8-S3 ; 定义第五逻辑区域， 即子环 4 , 子环 4为环 4连接在 子环 1上的部分， 即 S9-S14-S15-S16-S11 ; 定义第六逻辑区域， 即子环 5 , 子 环 5为环 5连接在子环 2上的部分， 即 S12-S17-S13 ; 定义第七逻辑区域， 即 子环 6 , 子环 6为环 6连接在子环 2上的部分， 即 S3-S18-S13 , 环 6和主环 以及子环 2的共享路段部分不属于子环 6。 这样对以太多环进行逻辑区域定 义后， 每条链路都被惟一的逻辑区域所保护， 当环的共享链路， 例如 S4-S5 之间的链路发生故障时， 由于该链路是属于主环而不是子环 1或者 2 , 因此 只会导致主环的环保护链路被打开， 而不会使得子环的环保护链路被打开而 导致 "超环" 。
具体的说，假设在主环中 S1为主节点， 主节点也可以称为环保护链路所 属节点， S1-S4为环保护链路； 在子环 1中 S9为主节点， S4-S9为环保护链 路； 在子环 2中 S12为主节点， S4-S12为环保护链路； 在子环 3中 S7为主 节点， S1-S7为环保护链路； 在子环 4中 S14为主节点， S9-S14为环保护链 路； 在子环 5中 S17为主节点， S13-S17为环保护链路； 在子环 6中 S18为 主节点， S18-S13为环保护链路。
当所有链路均正常时， 节点 S1到 S17有业务数据传送， 则业务数据传送 的唯一路径为 Sl-S2-S3-S6-S13-S12-S17。
假设链路 S3-S6发生故障， 故障链路的相邻节点会发送消息给主节点通 知链路故障， 主节点判断发生故障的链路如果属于与该主节点相同的逻辑区 域， 则打开从端口即打开环保护链路 S1-S4, 此时 S1到 S17的业务数据传送 的唯一路径为 Sl-S4-S5-S6-S13-S12-S17。
假设链路 S6-S13发生故障，该链路唯一属于子环 2,子环 2的主节点 S12 打开环保护链路 S4-S12 , 此时 S1 到 S17 的业务数据传送的唯一路径为 Sl-S2-S3-S6-S5-S4-S12-S17。
假设链路 S13-S17发生故障， 由于该链路本身即为环保护链路， 则此时 不需要打开任何链路， S1到 S17的业务数据传送路径与链路正常时相同。
可见， 一个逻辑区域只有一条环保护链路， 当一条链路发生故障时， 最 多只有一条环保护链路被打开， 传送业务数据的两节点之间只有唯——条链 路相通， 不会有超环的出现， 从而有效地避免了网络风暴的形成， 提高了以 太多环网络的抗故障能力。 多条链路发生故障时， 也只打开一条环保护链路， 也就是说一个逻辑区域中当有链路发生故障时，最多只打开一条环保护链路。
第三实施例
本实施例为釆用子环逻辑定义方法在复杂多环拓朴结构中的具体应用。 以太多环的拓朴结构同应用实例二的图 5a, 釆用子环的逻辑划分方法， 但子 环划分时不考虑层次关系， 共享路段属于多个与其相连接的子环中的任意一 个， 如图 6所示， 子环 0包含的链路为 S1-S2-S3-S6-S5-S4-S1 ; 子环 1包含的 链路为 S4-S9、 S6-S11 , 其与子环 0的共享路段 S4-S5-S6属于环 0, 与子环 4 的共享路段 S9-S10-S11属于子环 4,但是节点 S4和 S6同属于子环 0、子环 1 和子环 2, 节点 S9和 S11 同属于子环 1 和子环 4; 子环 4 包含的链路为 S9-S10-S11-S16-S15-S14-S9; 子环 3包含的链路为 S1-S7-S8-S3; 子环 6包含 的链路为 S3-S18-S13; 子环 2包含的链路为 S4-S12、 S6-S13 , 与子环 0的共 享路段 S4-S5-S6属于子环 0,与子环 5的共享路段 S12-S13属于子环 5; 子环 5包含链路 S12-S17-S13-S12。 图中每个环路包含的链路用不同的虚线或实线 表示。
仍然按照第二实施例中所假设的主节点及环保护链路的情况， 当所有链 路均正常时， 节点 S1到 S17有业务数据传送， 则业务数据传送的唯一路径为 Sl-S2-S3-S6-S13-S12-S17。
假设链路 S3-S6发生故障， 该链路唯一属于子环 0, 子环 0的主节点 S1 打开环保护链路 S1-S4 , 此时业务数据从 S1 传送到 S17 的唯一路径为 Sl-S4-S5-S6-S13-S12-S17。
假设链路 S6-S13发生故障，该链路唯一属于子环 2,子环 2的主节点 S12 打开环保护链路 S4-S12 , 此时业务数据从 S1 传送到 S17 的唯一路径为 Sl-S2-S3-S6-S5-S4-S12-S17。
可见， 无论怎样划分逻辑区域， 只需要保证一条链路唯一属于一个逻辑 区域， 当某条链路出现故障时， 该链路所属逻辑区域的环保护链路被打开， 传送业务数据的两节点之间只有唯——条链路相通， 避免了超环的出现。
第四实施例
本实施例釆用了优先级逻辑定义方法， 对以太多环的逻辑区域定义时， 每个逻辑区域都是一个完整的单环， 还定义了不同的优先级。 这样对以太多 环进行逻辑区域定义后， 每条链路可以属于多个逻辑区域， 当某条链路发生 故障时， 如果该链路在发生故障之前为打开状态， 则只会导致所述最高优先 级的逻辑区域的环保护链路被打开， 而不会使得多个逻辑区域的环保护链路 被打开而形成 "超环" 。
以太多环的拓朴结构同应用实例二的图 5a,釆用优先级的逻辑定义方法， 优先级号越大， 则优先级越低。 如图 7所示， 环 0的优先级为 0, 且是一个 完整的单环； 环 1的优先级为 1 , 是一个完整的单环； 环 2的优先级为 2, 是 一个完整的单环；环 3的优先级为 3 ,是一个完整的单环； 环 4的优先级为 4, 是一个完整的单环； 环 5的优先级为 5 , 是一个完整的单环； 环 6的优先级 为 6,是一个完整的单环。链路 S4-S5同时属于环 0、环 1和环 2,当链路 S4-S5 发生故障时， 如果该链路在发生故障前为打开状态， 由于环 0的优先级最高， 因此最多只会导致环 0的环保护链路被打开， 而不会导致环 1和环 2的环保 护链路打开而形成 "超环" 。 本实施用例表面上看与本发明的原则 "每条链 路只有惟一所属逻辑区域"不相符， 实际上还是本发明的一种变化后的应用， 符合本发明的特征 "当某条链路发生故障时， 最多只有一个逻辑区域中的环 保护链路被打开， 而不会出现多个逻辑区域的环保护链路打开而出现 '超环， 的情况" 。
本实施例中的优先级划分仅为一示例， 优先级的划分根据需要进行， 只 要保证各个逻辑区域的优先级不同即可。
当然， 本发明还可有其他多种实施例， 在不背离本发明精神及其实质的 但这些相应的改变和变形都应属于本发明所附的权利要求的保护范围。
工业实用性 本发明既适用于简单的多环网络， 也适用于复杂的多环网络， 从根本上 解决了由于一条链路故障引起多个环保护链路被打开而导致 "超环"的故障， 提高了以太多环网络的抗故障能力。

Claims

权 利 要 求 书
1、 一种防止以太多环网络中出现网络风暴的方法， 其特征在于， 当以太多环网络中的某一条链路发生故障时，最多打开一条环保护链路， 所述环保护链路与所述故障链路处于同一逻辑区域中。
2、 如权利要求 1所述的方法， 其特征在于，
所述以太多环网络中的每条链路唯一属于一个逻辑区域， 当以太多环网 络中的某条链路发生故障， 所述故障链路所在的逻辑区域的主节点将环保护 链路打开。
3、 如权利要求 2所述的方法， 其特征在于，
划分逻辑区域时， 先将所述以太网多环网络划分为多个单环， 将相邻单 环间的共享链路划分给其中一个单环， 闭合的单环为主环， 不闭合的单环为 子环， 所述主环和子环均称为逻辑区域。
4、 如权利要求 1所述的方法， 其特征在于，
所述以太多环网络中的各链路分别属于一个或多个逻辑区域， 为各逻辑 区域设置优先级， 当以太多环网络中的某条链路发生故障时， 包含所述故障 链路的优先级最高的一个逻辑区域的环保护链路被该逻辑区域的主节点打 开。
5、 如权利要求 4所述的方法， 其特征在于，
所述以太网多环网络中每个单环为一个逻辑区域， 每个逻辑区域的优先 级不同。
6、 如权利要求 1至 5中任一权利要求所述的方法， 其特征在于， 当所述故障链路为环保护链路时， 所述故障链路所在逻辑区域主节点不 做操作。
7、 一种防止以太多环网络中出现网络风暴的系统， 包括多个节点，各节 点之间通过链路相连接， 其特征在于， 各节点记录自己所在的逻辑区域；
当以太多环网络中的某条链路发生故障时， 该故障链路所在逻辑区域的 主节点最多只打开所述逻辑区域中的一条环保护链路。
8、 如权利要求 7所述的系统， 其特征在于，
所述以太多环网络中的每条链路唯一属于一个逻辑区域， 该链路连接的 两个节点记录自己所在的逻辑区域；
当以太多环网络中的某条链路发生故障， 所述故障链路所在的逻辑区域 的主节点打开环保护链路。
9、 如权利要求 8所述的系统， 其特征在于，
划分逻辑区域时， 先将所述以太网多环网络划分为多个单环， 将相邻单 环间的共享链路划分给其中一个单环， 闭合的单环为主环， 不闭合的单环为 子环， 所述主环和子环均称为逻辑区域。
10、 如权利要求 7所述的系统， 其特征在于，
所述以太多环网络中的各链路分别属于一个或多个逻辑区域， 各逻辑区 域设置优先级， 该链路连接的两个节点记录自己所在的逻辑区域以及此逻辑 区域的优先级；
当以太多环网络中的某条链路发生故障时， 包含所述故障链路的优先级 最高的一个逻辑区域的主节点打开该逻辑区域的环保护链路。
11、 如权利要求 10所述的方法， 其特征在于，
所述以太网多环网络中每个单环为一个逻辑区域， 每个逻辑区域的优先 级不同。
PCT/CN2009/070027 2008-03-10 2009-01-05 一种防止以太多环网络中出现网络风暴的方法和系统 Ceased WO2009111954A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US12/921,435 US8565072B2 (en) 2008-03-10 2009-01-05 Method and a system for preventing a network storm from presenting in a multi-ring ethernet
EP09718861A EP2254282A4 (en) 2008-03-10 2009-01-05 METHOD AND SYSTEM FOR PREVENTING NETWORK STOPS IN AN ETHER MULTIRING NETWORK

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200810006577.8 2008-03-10
CN2008100065778A CN101534232B (zh) 2008-03-10 2008-03-10 一种防止以太多环网络中出现网络风暴的方法

Publications (1)

Publication Number Publication Date
WO2009111954A1 true WO2009111954A1 (zh) 2009-09-17

Family

ID=41064745

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2009/070027 Ceased WO2009111954A1 (zh) 2008-03-10 2009-01-05 一种防止以太多环网络中出现网络风暴的方法和系统

Country Status (4)

Country Link
US (1) US8565072B2 (zh)
EP (1) EP2254282A4 (zh)
CN (1) CN101534232B (zh)
WO (1) WO2009111954A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2553881A4 (en) * 2010-03-30 2013-12-04 Ericsson Telefon Ab L M PROCEDURE FOR PROTECTION BEFORE SUPER LOOPS IN AN ETHERNET RING

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101656664B (zh) * 2009-09-09 2012-05-23 杭州华三通信技术有限公司 以太环网系统及其边缘节点和以太环网实现方法
CN102055661B (zh) * 2009-11-06 2014-03-19 中兴通讯股份有限公司 一种多点故障下的以太多环网保护方法和互连节点
CN101984592A (zh) * 2010-10-27 2011-03-09 中兴通讯股份有限公司 一种共享保护环的自动保护倒换方法、装置和系统
KR101720347B1 (ko) * 2011-01-20 2017-03-27 엘에스산전 주식회사 적응성의 다중 링 네트워크 시스템 및 우회경로 설정방법
JP5609995B2 (ja) * 2011-02-04 2014-10-22 富士通株式会社 通信システム、通信方法及び通信装置
US20140301185A1 (en) * 2011-04-15 2014-10-09 Hangzhou H3C Technologies Co., Ltd Handling a fault in an ethernet ring network
CN102170384B (zh) * 2011-04-15 2014-06-11 杭州华三通信技术有限公司 相交以太环网故障处理方法及节点
CN102437957B (zh) * 2011-12-16 2015-07-08 华为技术有限公司 一种多协议标签交换的相交环处理方法及装置
CN103095541B (zh) * 2013-02-05 2015-10-28 江西山水光电科技有限公司 一种通过智能定向实现环形以太网的方法
CN114384878B (zh) * 2021-12-31 2024-09-10 江苏核电有限公司 一种dcs系统网络故障后果的缓解方法

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1976311A (zh) * 2006-11-24 2007-06-06 中兴通讯股份有限公司 多环相切以太环网环路保护切换方法
CN101064632A (zh) * 2006-04-28 2007-10-31 西门子通信技术（北京）有限公司 一种以太网环路的保护方法及系统

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6766482B1 (en) * 2001-10-31 2004-07-20 Extreme Networks Ethernet automatic protection switching
US6717922B2 (en) 2002-03-04 2004-04-06 Foundry Networks, Inc. Network configuration protocol and method for rapid traffic recovery and loop avoidance in ring topologies
WO2004095779A1 (ja) * 2003-04-24 2004-11-04 Fujitsu Limited リング間接続装置、及びデータ転送制御方法
CA2566005C (en) * 2003-05-06 2009-12-15 Overture Networks, Inc. Protected switching ring
US7558205B1 (en) * 2003-08-01 2009-07-07 Foundry Networks, Inc. System and method for detecting and isolating a remote loop
US8520507B1 (en) 2004-03-08 2013-08-27 Extreme Networks, Inc. Ethernet automatic protection switching
JP2005269059A (ja) * 2004-03-17 2005-09-29 Fujitsu Ltd データ中継装置、データ中継方法およびデータ中継プログラム
JP4627205B2 (ja) 2005-03-28 2011-02-09 富士通株式会社 リングネットワークシステムおよび障害復旧方法
US7898942B2 (en) * 2005-03-31 2011-03-01 Nec Corporation Ring network system, failure recovery method, failure detection method, node and program for node
US8050183B2 (en) 2005-05-06 2011-11-01 Cisco Technology, Inc. System and method for implementing reflector ports within hierarchical networks
EP1727313A1 (en) * 2005-05-25 2006-11-29 Siemens Aktiengesellschaft Ring network and method for automatic protection switching
CN1941730A (zh) * 2005-09-26 2007-04-04 华为技术有限公司 实现rpr桥冗余保护的方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101064632A (zh) * 2006-04-28 2007-10-31 西门子通信技术（北京）有限公司 一种以太网环路的保护方法及系统
CN1976311A (zh) * 2006-11-24 2007-06-06 中兴通讯股份有限公司 多环相切以太环网环路保护切换方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2553881A4 (en) * 2010-03-30 2013-12-04 Ericsson Telefon Ab L M PROCEDURE FOR PROTECTION BEFORE SUPER LOOPS IN AN ETHERNET RING

Also Published As

Publication number Publication date
EP2254282A4 (en) 2012-03-14
US20110116365A1 (en) 2011-05-19
US8565072B2 (en) 2013-10-22
EP2254282A1 (en) 2010-11-24
CN101534232B (zh) 2012-12-19
CN101534232A (zh) 2009-09-16

Similar Documents

Publication Publication Date Title
WO2009111954A1 (zh) 一种防止以太多环网络中出现网络风暴的方法和系统
EP2117176B1 (en) Method for implementing intersecting ring network with arbitrary topology, node and intersecting ring network
US8724519B2 (en) Technique for dual homing interconnection between communication networks
US8583833B2 (en) Ring topology discovery
CN101662421B (zh) 基于以太多环网的控制报文的传输方法和装置
CN105324959B (zh) 通信系统、通信装置以及保护方法
EP1983694B1 (en) Method and device for transmitting packet in resilient packet intersect ring
WO2009076885A1 (zh) 以太网故障检测及收敛的方法和节点设备
CN101677267B (zh) 一种跨环转发协议帧的方法及以太网多环中的共享节点
CN101127674A (zh) 以太环网系统传输节点初始化方法
Ryoo et al. Ethernet ring protection for carrier ethernet networks
WO2009111969A1 (zh) 以太环网中边缘端口阻塞的方法、以太环网系统和设备
CN101072237A (zh) 以太环智能保护方法
EP1842342A1 (en) A method of operating a node in a communications network
WO2010060284A1 (zh) 多环以太网的保护方法和装置
WO2012162946A1 (zh) 一种报文处理方法及系统
CN101626335B (zh) 一种双归连接网络的数据保护方法
CN101072154A (zh) 以太环网切换方法
WO2012062097A1 (zh) 多环以太网及其保护方法
CN102111317B (zh) 以太环网中保护控制虚拟局域网的方法、系统及装置
JP5465784B2 (ja) 仮想チャネルのないサブリング制御チャンネルがプロトコルメッセージをブロックする方法及びシステム
CN101815021B (zh) 一种以太网保护中协议通道的实现方法
CN101677281B (zh) 一种以太多环网的控制信道配置及其报文传输方法
CN101883000B (zh) 一种网络保护方法及网络保护架构
WO2011094970A1 (zh) 一种以太网保护中阻塞端口的方法和系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09718861

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2009718861

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 12921435

Country of ref document: US