WO2024021535A1 - 一种双环倒换实现方法及系统 - Google Patents

一种双环倒换实现方法及系统 Download PDF

Info

Publication number
WO2024021535A1
WO2024021535A1 PCT/CN2023/071837 CN2023071837W WO2024021535A1 WO 2024021535 A1 WO2024021535 A1 WO 2024021535A1 CN 2023071837 W CN2023071837 W CN 2023071837W WO 2024021535 A1 WO2024021535 A1 WO 2024021535A1
Authority
WO
WIPO (PCT)
Prior art keywords
ring
node
intersecting
switching
reachability information
Prior art date
Application number
PCT/CN2023/071837
Other languages
English (en)
French (fr)
Inventor
张晶
朱晓艺
姚清
余理
周宇昂
张思杨
卢春
Original Assignee
烽火通信科技股份有限公司
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 烽火通信科技股份有限公司 filed Critical 烽火通信科技股份有限公司
Publication of WO2024021535A1 publication Critical patent/WO2024021535A1/zh

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

  • This application relates to the technical field of automatic protection switching of PTN networks, and in particular to a method and system for implementing dual-ring switching.
  • Protection switching technology is one of the important means to ensure network reliability.
  • the traditional protection switching idea is mainly linear protection.
  • ring network protection has many advantages, especially the support for multi-point fault switching function.
  • the dual-ring switching function of cross-ring services is to realize the multi-point switching function of ring network.
  • the principles and methods of ring network protection are standardized and formally formed into a standard in 2017.
  • the standard describes both the single-ring switching function and the intersecting ring switching function.
  • the realization of the ring network protection multi-point fault switching function includes two methods: (1) Different parts of the same ring-bound service are bound to different single rings, and each ring is switched through its own single-ring switching logic, and the combination It can realize the multi-point fault switching function in specific scenarios; (2)
  • the same ring-bound service is bound to intersecting rings, which not only supports the switching scenario in (1), but also can realize other multi-point faults in the same ring when single-ring switching fails. Service protection switching.
  • the cross-ring LSP (Label Switching Path, label switching path) service dual-ring switching function is implemented at the intersecting node.
  • the label forwarding process that when the cross-ring LSP service reaches the intersecting node, it has POP (removed) the upper ring label and PUSH (added) the lower ring label, that is, it has entered the lower ring.
  • the description of the ring logical layer in G.8132 is on the outer layer of the LSP logical layer.
  • the switching action of the ring network should occur at the ring network layer, thereby achieving ring LSP binding.
  • Batch switching of services, and the dual-ring switching method of refreshing the ring-binding relationship table with cross-ring LSP services as a unit conflicts with the batch switching principle of the ring network logical layer established on the outer layer of the LSP layer; secondly, using cross-ring LSP
  • the dual-ring switching method in which the ring binding relationship table is refreshed for each business unit the switching time will be positively correlated with the number of cross-ring LSP service entries, so that when the number of cross-ring LSP service entries is too large, the switching time will be too long, and may even reach Second level, for example, the average service switching time of each cross-ring LSP is about 1ms, so the service switching time of 2K cross-ring LSPs will be as long as 2s or more.
  • This application provides a dual-ring switching implementation method and system to solve the problems in related technologies that batch switching cannot be performed and cross-ring service switching takes too long.
  • a dual-ring switching implementation method is provided.
  • the dual-ring switching implementation method is applied to each uplink node.
  • the method includes the following steps:
  • the reachability information is used to identify whether the intersecting link node is reachable
  • Path switching is performed based on the cross-ring service protection path group information corresponding to the unreachable intersecting ring node.
  • the method further includes:
  • path switching is performed based on the status information of the single-ring switching
  • obtaining the reachability information of each intersecting link node sent by the intersecting node includes:
  • the received reachability information is valid, and based on the valid reachability information, the step of determining the unreachable intersecting link node based on the reachability information of each intersecting link node is performed;
  • the received reachability information is invalid, and the reachability status of all intersecting ring nodes in the reachability information is updated to reachable, and new reachability information is obtained. Based on the new reachability The information executes the step of determining unreachable intersecting ring nodes based on the reachability information of each intersecting ring node.
  • the intersecting node implements the transmission of reachability information based on the PDU extension field.
  • the method before the step of obtaining the reachability information of each intersecting ring node sent by the intersecting node, the method further includes:
  • the intersecting node writes the reachability status of each intersecting ring node into the PDU extension field of the ring where the uplink node is located to form reachability information.
  • each cross-ring service protection path group information includes the ID of the ring where the uplink node is located, the ID of the intersecting ring, the ID of the downstream node, and the direction from the uplink node to the intersecting ring.
  • the number of cross-ring service protection path group information is 2 ⁇ N, including N cross-ring service protection path information in the first direction and N cross-ring service protection path information in the second direction, where, N is a positive integer, and the value of N is determined based on the number of intersecting ring nodes.
  • a dual-ring switching implementation system including multiple uplink nodes.
  • Each uplink node includes:
  • the acquisition module is used to obtain the cross-ring service protection path group information corresponding to each intersecting link node; obtain the reachability information of each intersecting link node sent by the intersecting node, and the reachability information is used to identify whether the intersecting link node is reachable;
  • a determination module which is used to determine unreachable intersecting link nodes based on the reachability information of each intersecting link node
  • a switching module which is used to perform path switching based on the cross-ring service protection path group information corresponding to the unreachable intersecting ring node.
  • the switching module is also used to:
  • path switching is performed based on the status information of the single-ring switching
  • the acquisition module is specifically used to:
  • the determination module is caused to perform the step of determining unreachable intersecting link nodes based on the reachability information of each intersecting link node based on the valid reachability information;
  • the new reachability information executes the step of determining unreachable intersection link nodes based on the reachability information of each intersection link node.
  • This application provides a dual-ring switching implementation method and system.
  • the dual-ring switching implementation method is applied to each uplink node, including obtaining the cross-ring service protection path group information corresponding to each intersecting link node; obtaining each intersecting link sent by the intersecting node.
  • the reachability information of the ring node The reachability information is used to identify whether the intersecting link nodes are reachable; the unreachable intersecting link nodes are determined based on the reachability information of each intersecting link node; and path switching is performed based on the cross-ring service protection path group information corresponding to the unreachable intersecting link nodes.
  • the upper link node can learn whether each intersecting link node is reachable based on the node reachability information of each intersecting link node sent by the intersecting node, and perform the following operations based on the reachability status of the intersecting link node and the cross-ring service protection path group information.
  • Dual-ring switching in units of ring channels thereby realizing batch switching of services bound to the same ring path, which not only shortens the cross-ring service switching time, but also realizes dual-ring switching without the need for the intersecting nodes to refresh the ring-binding relationship table, solving the problem of intersecting nodes.
  • the defect in the principle of dual-ring switching for cross-ring services makes the switching time independent of the number of bound ring service entries, achieving an order of magnitude performance improvement.
  • Figure 1 is a schematic flowchart of a dual-ring switching implementation method provided by an embodiment of the present application
  • Figure 2 is a schematic diagram of a multi-ring intersection topology provided by an embodiment of the present application.
  • Figure 3 is a schematic diagram of a cross-ring service path provided by an embodiment of the present application.
  • Figure 4 is a schematic diagram of the cross-ring service escape path provided by the embodiment of the present application.
  • Figure 5 is a logical schematic diagram of node reachability information transmission provided by the embodiment of the present application.
  • Figure 6 is a schematic diagram of cross-ring service switching group switching logic provided by an embodiment of the present application.
  • Embodiments of the present application provide a dual-ring switching implementation method and system, which can solve the problems in related technologies that batch switching cannot be performed and cross-ring service switching takes too long.
  • FIG. 1 is a dual-ring switching implementation method provided by an embodiment of the present application.
  • the dual-ring switching implementation method is applied to each uplink node and includes the following steps:
  • Step S10 Obtain cross-ring service protection path group information corresponding to each intersecting ring node; wherein, each cross-ring service protection path group information includes the ID of the ring where the uplink node is located, the ID of the intersecting ring, and the ID of the downstream node. and the direction from the uplink node to the intersecting ring; the number of cross-ring service protection path group information is 2 ⁇ N, including N cross-ring service protection path information in the first direction and N cross-ring service protection in the second direction. Path information, where N is a positive integer, and the value of N is determined based on the number of intersecting ring nodes.
  • ring 1 i.e. RING1
  • ring 2 i.e. RING2
  • a ring composed of six nodes E, F, G, H, and I
  • Ring 3 i.e., RING3
  • the intersecting nodes are nodes D and Node I, configure ring 1 and ring 3 to intersect, and the intersecting nodes are node I and node H.
  • This embodiment takes each node on ring 1 as an example to illustrate the grouping rules of the cross-ring service protection path group.
  • this embodiment will allocate a group with the maximum number of ring nodes for an intersecting ring; assuming that the maximum number of ring nodes is 16, on ring 1, except for the intersection
  • each intersecting ring of the cross-ring service will be allocated 16 westward cross-ring service protection path groups and 16 eastward cross-ring service protection path groups to manage the dual rings of the cross-ring service corresponding to the downstream node. Switch.
  • the command rules for the cross-ring service protection path group can follow the following rules: GROUP_W_1_2_1 represents the management of "the upper ring is ring 1, the exit is ring 1 west exit, the lower ring is ring 2, and the destination node (i.e., the downstream node) is ring Switching of cross-ring services "node with node ID 1 on 2", and GROUP_E_1_2_6 represents the management of "the upper ring is ring 1 and the egress is ring 1" Switching of cross-ring services in which the east exit of Ring 1, the lower ring is Ring 2, and the destination node is the node with node ID 6 on Ring 2;
  • the cross-ring service protection path groups that need to be allocated are:
  • node D which is the intersection node of ring 1 and ring 2
  • the cross-ring service protection path groups that need to be allocated are:
  • cross-ring service protection path groups that need to be allocated are:
  • node I it is not only the intersection node of ring 1 and ring 2, but also the intersection node of ring 1 and ring 3. Therefore, there is no need to allocate a cross-ring service protection path group for the intersection ring 2 or the intersection ring 3.
  • Step S20 Obtain the reachability information of each intersecting link node sent by the intersecting node.
  • the reachability information is used to identify whether the intersecting link node is reachable; wherein, the intersecting node implements the transmission of the reachability information based on the PDU extension field.
  • the cross-ring service path is A-B-C-G-H-I, where W represents the west direction, E represents the east direction, and ring 1 (i.e., the upper ring) is a ring composed of six nodes A, B, C, D, E, and F.
  • Ring 2 i.e., the lower ring
  • Its label forwarding rules are detailed in the G.8132 standard and will not be described in detail here.
  • the switching effect that this embodiment needs to achieve is when failures occur simultaneously between the intersecting node C and the intersecting node D and between the uplink node G and the uplink node H, that is, in ring 2 , when the intersecting node C and the downstream node I are unreachable, this embodiment can directly switch at the uplink node A, and the service enters the ring 2 from the intersecting protection node-intersecting node D, thereby realizing normal forwarding of the service to the downstream node.
  • the purpose of conversation node I is when failures occur simultaneously between the intersecting node C and the intersecting node D and between the uplink node G and the uplink node H, that is, in ring 2 , when the intersecting node C and the downstream node I are unreachable, this embodiment can directly switch at the uplink node A, and the service enters the ring 2 from the intersecting protection node-intersecting node D, thereby realizing normal forwarding of the service to the downstream node.
  • this embodiment extends the corresponding fields of the intersecting link node reachability information based on the RPS PDU described in G.8132, that is, by extending the RPS (Ring Protection Switch) PDU (Protocol Data Unit) Field, the reachability information of each intersecting link node on the lower ring is transmitted to each uplink node on the upper ring, so that the dual-ring switching status can be recognized at the uplink of the cross-ring service to implement switching.
  • the extension field can be transmitted in the spare field after the original four-byte PDU field.
  • each intersecting ring node on each intersecting ring is allocated a bit, which can be represented by 0 to indicate reachability and 1 to indicate unavailable. Of course, it can also be set according to actual needs.
  • the specific length of the extension field is related to the number of intersecting ring specifications (M) and the number of node specifications on the ring (N).
  • the reachability information of each node on each intersecting ring is represented by 1 bit, then the extension field
  • step of obtaining the reachability information of each intersecting link node sent by the intersecting node it also includes:
  • the intersecting node writes the status of whether each intersecting link node is reachable into the location of the previous link node.
  • the PDU extension field of the ring forms reachability information.
  • the intersecting node after collecting the intersecting link node reachability information, it sends it in the direction of the non-intersecting node, and does not need to process the node reachability information received from other nodes. Specifically, since the ring state machine calculates the reachability status of each intersecting ring node based on the alarm information and ring protection switching messages of each intersecting ring node; therefore, at the intersecting node, it can be obtained from the intersecting ring that intersects with this ring.
  • the ring state machine obtains the reachability status of each intersecting ring node and combines it into the RPS PDU extension field on the ring to form reachability information, which is then sent to the non-shared fiber direction, and the station does not perform other logical processing.
  • node C of ring 1 is an intersecting node. It can extract the state of whether the intersecting ring node on ring 2 is reachable from the intersecting ring, that is, the ring state machine of ring 2, and add it to Combined into the RPS PDU extension field of ring 1, it is sent in the direction of the non-shared fiber, that is, the direction of uplink node B.
  • obtaining the reachability information of each intersecting link node sent by the intersecting node includes:
  • the received reachability information is valid, and based on the valid reachability information, the step of determining the unreachable intersecting link node based on the reachability information of each intersecting link node is performed;
  • the received reachability information is invalid, and the reachability status of all intersecting ring nodes in the reachability information is updated to reachable, and new reachability information is obtained. Based on the new reachability The information executes the step of determining unreachable intersecting ring nodes based on the reachability information of each intersecting ring node.
  • this embodiment since the reachability information sending and processing logic of the upper link node and the lower link node is similar, for the sake of simplicity of description, this embodiment combines Figure 3 and Figure 5 and combines the reachability information of the upper link node.
  • the information sending and processing logic is explained as follows:
  • the uplink node of type intersecting node After extracting the intersecting link node reachability information from the ring state machine that intersects with the current ring, it sends it in the direction of the uplink node of type non-intersecting node (that is, to the non-intersecting node). shared fiber direction), and there is no need to process node reachability information received from other nodes;
  • the uplink node needs to be combined with the single-ring switching status to extract and forward node reachability information:
  • the status of whether the intersecting link node received in the east direction is extracted to the local, and the information is sent from the west direction to the next node, and whether the intersecting link node received in the west direction is reached is extracted.
  • the reachable status is transferred to the local node, and the information is sent from the east to the next node.
  • uplink node B that is, the status of whether the intersecting ring node on ring 2 is reachable, and save it locally, and save it locally. It is combined into the RPS PDU extension field of ring 1 and sent to the uplink node F.
  • the intersecting ring received from the uplink node F is extracted, that is, the status of whether the intersecting ring node on ring 2 is reachable is saved locally, and it is Combined into the RPS PDU extension field of ring 1 and sent to the uplink node B.
  • the westbound intersecting link node reachability information is cleared and restored to the initialization state, that is, all nodes are reachable, and forwarded to the east in this state, and the intersecting link node received in the east is extracted. Whether the status is reachable to the local, and the information is sent from the west to the next node.
  • the reachability information of the intersecting link nodes sent from the direction of uplink node B is cleared, and the reachability status of all intersecting link nodes is restored to the initialized state, and It is combined into the RPS PDU extension field of ring 1 and sent to the uplink node F; at the same time, the intersection received from the uplink node F is extracted.
  • the ring that is, the status of whether the intersecting ring node on ring 2 is reachable is saved locally, and is combined into the RPS PDU extension field of ring 1 and sent to the uplink node B.
  • the reachability information of the intersecting link nodes sent from the direction of uplink node F is cleared, and the reachability status of all intersecting link nodes is restored to the initialized state, and Combine it into the RPS PDU extension field of ring 1 and send it to the uplink node B; at the same time, extract the intersecting ring received from the uplink node B, that is, the status of whether the intersecting ring node on ring 2 is reachable, save it locally, and It is combined into the RPS PDU extension field of ring 1 and sent to the uplink node F.
  • Step S30 Determine unreachable intersecting link nodes based on the reachability information of each intersecting link node
  • the uplink node can determine whether the intersecting link node is reachable based on the specific value of the RPS PDU extension field in the reachability information, that is, when 0 is detected in the RPS PDU extension field, 0 indicates The intersection link node corresponding to the ID is reachable, and if 1 is detected in the RPS PDU extension field, the intersection link node corresponding to the ID indicated by 1 is unreachable.
  • Step S40 Perform path switching based on the cross-ring service protection path group information corresponding to the unreachable intersecting ring node.
  • the step of obtaining the reachability information of each intersecting link node sent by the intersecting node it also includes:
  • path switching is performed based on the status information of the single-ring switching
  • the next step that needs to be explained is the establishment of the dual-ring switching model and the implementation of the switching logic.
  • each uplink node is assigned two basic ring switching groups, namely the west switching group and the east switching group.
  • the west switching group management service outlet is the batch switching of ring-bound services at the west exit of the ring.
  • the switching group management service outlet is the batch switching of ring-bound services at the eastbound outlet of the ring, while the ring network protection state machine is used to calculate the status of the westbound switching group and the eastbound switching group based on alarms and received RPS messages. RPS information about to be sent.
  • cross-ring service grouping and switching logic are added, which can be compatible with the single-ring switching function of the original solution, and at the same time, the implementation logic of the dual-ring switching function is added.
  • the single-ring switching function is sufficient for the services that are initiated at the intersecting nodes. There is no requirement for the dual-ring switching function for cross-ring services, so there is no need for grouping processing;
  • the ring ID of the lower ring and the destination node ID of the lower ring (that is, the lower ring node ID) of the cross-ring service need to be combined as the KEY value in the upper ring configuration model.
  • the time required for the dual-ring switching function of cross-ring services is the running time of the two ring state machines. Calculated according to the standard that the instantaneous interruption of one ring switching service does not exceed 50ms, this The dual-ring switching service interruption time of the embodiment can be controlled within 100 ms.
  • switching can be performed based on the following switching rules:
  • the reachability information of the westbound intersecting link node can be obtained from the locally stored information. Get the reachability information of the next node on the intersecting ring corresponding to this node. If it is unreachable, it will be switched directly; if it is reachable, it will be consistent with the status of the westbound basic ring switching group;
  • the reachability information of the downstream node on the intersecting ring corresponding to this node can be extracted from the locally stored eastward intersecting ring node reachability information. , if it is unreachable, it will be switched directly; if it is reachable, it will be consistent with the status of the eastbound basic ring switching group.
  • the intersecting link node when it is determined that an intersecting link node is unreachable, the intersecting link node is used as the uplink node of the downstream node, and the cross-ring service protection corresponding to the unreachable intersecting link node can be
  • the path group information is used for path switching in the form of ring channels, that is, batch dual-ring switching is performed on all cross-ring LSPs on the uplink node with the intersecting ring node as the downlink node, the same egress direction, the same uplink and downlink; and After it is determined that an intersecting link node is reachable, the intersecting link node is used as the uplink node of the downstream node, and whether to perform path switching can be determined based on the status of the westbound basic ring switching group.
  • this embodiment conveys the reachability status of intersecting ring nodes through the extraction and forwarding of the new RPS PDU field, and implements batch dual-ring switching of the same bound ring path services through the newly allocated cross-ring service protection path group.
  • Node reachability information and local ring status are used to control the cross-ring service dual-ring switching state; and according to the above analysis of the switching process, it can be seen that the service switching time is only related to the operation of the ring state machine and switching efficiency, and is no longer related to the number of cross-ring service specifications. Relevantly, the switching time is twice the ring network switching time.
  • this embodiment solves the principle defect of dual-ring switching using cross-ring LSP as an entry at the intersecting node, and realizes batch dual-ring switching of services on a ring channel basis; and the switching time is reduced from the highest second level to less than 100 ms, effectively The cross-ring service switching time is shortened, and the switching performance is improved by orders of magnitude in large-scale cross-ring service scenarios.
  • the embodiment of the present application also provides a dual-ring switching implementation system, which includes multiple uplink nodes, and each uplink node includes:
  • the acquisition module is used to obtain the cross-ring service protection path group information corresponding to each intersecting link node; obtain the reachability information of each intersecting link node sent by the intersecting node, and the reachability information is used to identify whether the intersecting link node is reachable;
  • a determination module which is used to determine unreachable intersecting link nodes based on the reachability information of each intersecting link node
  • a switching module which is used to perform path switching based on the cross-ring service protection path group information corresponding to the unreachable intersecting ring node.
  • the switching module is also used for:
  • path switching is performed based on the status information of the single-ring switching
  • the acquisition module is specifically used for:
  • the determination module is caused to perform the step of determining unreachable intersecting link nodes based on the reachability information of each intersecting link node based on the valid reachability information;
  • the new reachability information executes the step of determining unreachable intersection link nodes based on the reachability information of each intersection link node.
  • the intersecting node implements the transmission of reachability information based on the PDU extension field.
  • the intersecting node determines whether each intersecting ring node is reachable based on the alarm information and ring protection switching messages of each intersecting ring node in the ring state machine of the intersecting ring; the intersecting node determines whether each intersecting ring node is reachable.
  • the status is written into the PDU extension field of the ring where the uplink node is located to form reachability information.
  • each cross-ring service protection path group information includes the ID of the ring where the uplink node is located, the ID of the intersecting ring, the ID of the downstream node, and the direction from the uplink node to the intersecting ring.
  • the number of cross-ring service protection path group information is 2 ⁇ N, including N cross-ring service protection path information in the first direction and N cross-ring service protection path information in the second direction, where N is a positive integer, and the value of N is determined according to the number of intersecting ring nodes.

Landscapes

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

Abstract

本申请涉及一种双环倒换实现方法及系统，涉及PTN网络的自动保护倒换技术领域，本方法应用于各个上环节点，包括获取每个相交环节点对应的跨环业务保护路径组信息；获取相交节点发送的各个相交环节点的可达信息，可达信息用于标识相交环节点是否可达；根据各个相交环节点的可达信息确定不可达的相交环节点；基于不可达的相交环节点对应的跨环业务保护路径组信息进行路径倒换。通过本申请，可实现相同绑环路径业务的批量倒换，不仅缩短了跨环业务倒换时间，且无需通过相交节点刷新绑环关系表的方式来实现双环倒换，解决了相交节点处以跨环业务为条目进行双环倒换的原理缺陷，使得倒换时间与绑环业务条目数无关，实现了数量级的性能提升。

Description

一种双环倒换实现方法及系统 技术领域
本申请涉及PTN网络的自动保护倒换技术领域，特别涉及一种双环倒换实现方法及系统。
背景技术
随着网络技术的不断演进，网络对人们工作和日常生活的影响越来越大，网络可靠性的作用也越来越突出，而保护倒换技术是保证网络可靠性的重要手段之一。传统的保护倒换思路以线性保护为主，而环网保护与线性保护相比，存在诸多优势，特别是对多点故障倒换功能的支持，其中，跨环业务的双环倒换功能是实现环网多场景多点断纤倒换的一个亮点；此外，环网保护还可以和线性保护叠加应用，共同为网络可靠性提供保障。
在G.8132共享保护环中对环网保护的原理和方法做了标准化的定义，并于2017年正式形成标准，该标准中对单环倒换功能和相交环倒换功能都进行了说明。其中，环网保护多点故障倒换功能的实现包括两种方式：(1)同一条绑环业务的不同部分绑定不同的单环，每个环通过自己的单环倒换逻辑来倒换，组合起来可以实现特定场景的多点故障倒换功能；(2)同一条绑环业务绑定相交环，支持(1)中倒换场景的同时，也可以实现其他一些同一环内多点故障单环倒换失效时的业务保护倒换。
相关技术中，针对第(2)种环网保护多点故障倒换功能实现方式，其跨环LSP(Label Switching Path，标签交换路径)业务双环倒换功能是在相交节点处实现，根据G.8132中标签转发流程可知，跨环LSP业务到达相交节点时，已POP(去掉)上环标签并PUSH(加上)下环标签，也就是已经进入下环，此时如果发现下环的下话节点不可达，那么结合绑环配置模型和芯片标签封装及倒换原理，只能以跨环LSP 业务为单位来刷新绑环关系表，让跨环LSP业务再次进入上环，从而实现双环倒换。
但是，以上过程存在两方面问题：第一，G.8132中对环逻辑层的描述是在LSP逻辑层外层，原理上来说环网的倒换动作应该发生在环网层，从而实现绑环LSP业务的批量倒换，而以跨环LSP业务为单位刷新绑环关系表的双环倒换方式与环网逻辑层建立在LSP层外层的批量倒换原理存在一定程度的冲突；第二，以跨环LSP业务为单位刷新绑环关系表的双环倒换方式，其倒换时间会与跨环LSP业务条目数成正相关关系，以致当跨环LSP业务条目数过大时，倒换所需时间过长，甚至可能达到秒级，比如，平均每条跨环LSP业务倒换时间实测为1ms左右，那么2K条跨环LSP业务倒换时间将长达2s甚至更多。
发明内容
本申请提供一种双环倒换实现方法及系统，以解决相关技术中存在的无法进行批量倒换以及跨环业务倒换时间过长的问题。
第一方面，提供了一种双环倒换实现方法，所述双环倒换实现方法应用于各个上环节点，所述方法包括以下步骤：
获取每个相交环节点对应的跨环业务保护路径组信息；
获取相交节点发送的各个相交环节点的可达信息，可达信息用于标识相交环节点是否可达；
根据各个相交环节点的可达信息确定不可达的相交环节点；
基于不可达的相交环节点对应的跨环业务保护路径组信息进行路径倒换。
一些实施例中，在所述获取相交节点发送的各个相交环节点的可达信息的步骤之后，还包括：
根据各个相交环节点的可达信息确定可达的相交环节点；
检测可达的相交环节点对应的上环节点所在的环是否发生单环倒换；
若发生单环倒换，则基于单环倒换的状态信息进行路径倒换；
若未发生单环倒换，则不进行路径倒换。
一些实施例中，所述获取相交节点发送的各个相交环节点的可达信息，包括：
当接收到相交节点发送的各个相交环节点的可达信息时，判断上环节点所在的环是否发生单环倒换；
若未发生单环倒换，则接收到的可达信息有效，并基于有效的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤；
若发生单环倒换，则接收到的可达信息无效，并将所述可达信息中所有的相交环节点的可达状态均更新为可达，得到新的可达信息，基于新的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤。
一些实施例中，所述相交节点基于PDU扩展字段实现可达信息的传递。
一些实施例中，在所述获取相交节点发送的各个相交环节点的可达信息的步骤之前，还包括：
使相交节点基于相交环的环状态机中的各个相交环节点的告警信息和环保护倒换报文确定出各个相交环节点是否可达的状态；
相交节点将各个相交环节点是否可达的状态写入上环节点所在的环的PDU扩展字段，形成可达信息。
一些实施例中，每个跨环业务保护路径组信息包括上环节点所在的环的ID、相交环的ID、下话节点的ID以及上环节点到相交环的方向。
一些实施例中，所述跨环业务保护路径组信息的数量为2×N，包括N个第一方向的跨环业务保护路径信息和N个第二方向的跨环业务保护路径信息，其中，N为正整数，且N的数值根据相交环节点的数量确定。
第二方面，提供了一种双环倒换实现系统，包括多个上环节点，每个上环节点包括：
获取模块，其用于获取每个相交环节点对应的跨环业务保护路径组信息；获取相交节点发送的各个相交环节点的可达信息，可达信息用于标识相交环节点是否可达；
确定模块，其用于根据各个相交环节点的可达信息确定不可达的相交环节点；
倒换模块，其用于基于不可达的相交环节点对应的跨环业务保护路径组信息进行路径倒换。
一些实施例中，所述倒换模块还用于：
根据各个相交环节点的可达信息确定可达的相交环节点；
检测可达的相交环节点对应的上环节点所在的环是否发生单环倒换；
若发生单环倒换，则基于单环倒换的状态信息进行路径倒换；
若未发生单环倒换，则不进行路径倒换。
一些实施例中，所述获取模块具体用于：
当接收到相交节点发送的各个相交环节点的可达信息时，判断上环节点所在的环是否发生单环倒换；
若未发生单环倒换，则接收到的可达信息有效，并使确定模块基于有效的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤；
若发生单环倒换，则接收到的可达信息无效，并将所述可达信息中所有的相交环节点的可达状态均更新为可达，得到新的可达信息，且使确定模块基于新的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤。
本申请提供了一种双环倒换实现方法及系统，所述双环倒换实现方法应用于各个上环节点，包括获取每个相交环节点对应的跨环业务保护路径组信息；获取相交节点发送的各个相交环节点的可达信息， 可达信息用于标识相交环节点是否可达；根据各个相交环节点的可达信息确定不可达的相交环节点；基于不可达的相交环节点对应的跨环业务保护路径组信息进行路径倒换。通过本申请，上环节点可以基于相交节点发送的各个相交环节点的节点可达信息来获悉各个相交环节点是否可达，并根据相交环节点可达状态和跨环业务保护路径组信息进行以环通道为单位的双环倒换，进而实现相同绑环路径业务的批量倒换，不仅缩短了跨环业务倒换时间，且无需通过相交节点刷新绑环关系表的方式来实现双环倒换，解决了相交节点处以跨环业务为条目进行双环倒换的原理缺陷，使得倒换时间与绑环业务条目数无关，实现了数量级的性能提升。
附图说明
为了更清楚地说明本申请实施例中的技术方案，下面将对实施例描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。
图1为本申请实施例提供的一种双环倒换实现方法的流程示意图；
图2为本申请实施例提供的多环相交拓扑示意图；
图3为本申请实施例提供的跨环业务路径示意图；
图4为本申请实施例提供的跨环业务逃生路径示意图；
图5为本申请实施例提供的节点可达信息传递逻辑示意图；
图6为本申请实施例提供的跨环业务倒换组切换逻辑示意图。
具体实施方式
为使本申请实施例的目的、技术方案和优点更加清楚，下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例是本申请的一部分实施例，而不是全部的实施例。基于本申请中的实施例，本领域普通技术人员在没 有做出创造性劳动的前提下所获得的所有其他实施例，都属于本申请保护的范围。
本申请实施例提供了一种双环倒换实现方法及系统，其能解决相关技术中存在的无法进行批量倒换以及跨环业务倒换时间过长的问题。
图1是本申请实施例提供的一种双环倒换实现方法，该双环倒换实现方法应用于各个上环节点，包括以下步骤：
步骤S10：获取每个相交环节点对应的跨环业务保护路径组信息；其中，每个跨环业务保护路径组信息包括上环节点所在的环的ID、相交环的ID、下话节点的ID以及上环节点到相交环的方向；所述跨环业务保护路径组信息的数量为2×N，包括N个第一方向的跨环业务保护路径信息和N个第二方向的跨环业务保护路径信息，其中，N为正整数，且N的数值根据相交环节点的数量确定。
示范性的，在本实施例中，参见图2所示，环1(即RING1)为A、B、C、D、I、J六个节点组成的环，环2(即RING2)为D、E、F、G、H、I六个节点组成的环，环3(即RING3)为J、I、H三个节点组成的环，并配置环1和环2相交，相交节点为节点D和节点I，配置环1和环3相交，相交节点为节点I和节点H。本实施例以环1上的各个节点为例来说明跨环业务保护路径组的分组规则。
由于无法在非相交节点获取到相交环的节点个数信息，所以本实施例针对一个相交环会分配最大环节点个数的组；假设环节点个数最大为16，在环1上，除相交节点之外，会为跨环业务的每个相交环分配16个西向跨环业务保护路径组和16个东向跨环业务保护路径组，以用来管理对应下话节点的跨环业务的双环倒换。
具体的，跨环业务保护路径组的命令规则可遵循以下规律：GROUP_W_1_2_1代表管理“上环为环1、出口为环1西向出口、下环为环2、目的节点(即下话节点)为环2上的节点ID为1的节点”的跨环业务的倒换，而GROUP_E_1_2_6代表管理“上环为环1、出口为 环1东向出口、下环为环2、目的节点为环2上节点ID为6的节点”的跨环业务的倒换；
其中，对于节点A、B、C为非相交节点，需要分配的跨环业务保护路径组有：
GROUP_W_1_2_1、GROUP_W_1_2_2、......、GROUP_W_1_2_16；
GROUP_E_1_2_1、GROUP_E_1_2_2、......、GROUP_E_1_2_16；
GROUP_W_1_3_1、GROUP_W_1_3_2、......、GROUP_W_1_3_16；
GROUP_E_1_3_1、GROUP_E_1_3_2、......、GROUP_E_1_3_16；
对于节点D，其为环1和环2的相交节点，需要分配的跨环业务保护路径组有：
GROUP_W_1_3_1、GROUP_W_1_3_2、......、GROUP_W_1_3_16；
GROUP_E_1_3_1、GROUP_E_1_3_2、......、GROUP_E_1_3_16；
对于节点J，其为环1和环3的相交节点，需要分配的跨环业务保护路径组有：
GROUP_W_1_2_1、GROUP_W_1_2_2、......、GROUP_W_1_2_16；
GROUP_E_1_2_1、GROUP_E_1_2_2、......、GROUP_E_1_2_16；
对于节点I，其既是环1和环2的相交节点，也是环1和环3的相交节点，因此无需针对相交环2或者相交环3分配跨环业务保护路径组。
步骤S20：获取相交节点发送的各个相交环节点的可达信息，可达信息用于标识相交环节点是否可达；其中，所述相交节点基于PDU扩展字段实现可达信息的传递。
示范性的，对于跨环业务的上环内所有节点(即各个上环节点)来说，只有和下环相交的节点(即相交节点)可以获取到下环(即相交环)下话节点的可达信息，而跨环LSP到达相交节点处，已经POP出上环标签，并且PUSH上下环标签，进入了下环，如果此时发现下话节点不可达，只能刷新绑环关系表，才能重新回到上环通道，实现双环倒换功能，而其业务瞬断时间会是以环通道为单位进行倒换的单 环倒换的业务瞬断时间的数倍甚至数十倍。
参见图3所示，跨环业务路径为A-B-C-G-H-I，其中，W代表西向，E代表东向，环1(即上环)为A、B、C、D、E、F六个节点组成的环，环2(即下环)为C、G、H、I、J、D六个节点组成的环，其标签转发规则详见G.8132标准，在此不做赘述。
同时，参见图4所示，本实施例需要达到的倒换效果是当相交节点C和相交节点D之间以及上环节点G和上环节点H之间同时发生故障的时候，即在环2中，从相交节点C到下话节点I是不可达时，本实施例可在上环节点A处直接发生倒换，业务从相交保护节点-相交节点D处进入环2，从而实现业务正常转发到下话节点I的目的。
因此，本实施例在G.8132中描述的RPS PDU基础上，扩展了相交环节点可达信息的对应字段，即通过扩展RPS(Ring Protection Switch环保护倒换)PDU(Protocol Data Unit协议数据单元)字段，将下环上各个相交环节点的可达信息传递到上环中的每个上环节点，以使得在跨环业务上环处识别双环倒换状态实现倒换。其中，扩展字段可在原来的四字节的PDU字段之后的备用字段中实现传递，比如，给每个相交环上的每个相交环节点分配一个bit，可通过0表示可达、1表示不可达，当然也可根据实际需求进行设置。需要说明的是，扩展字段的具体长度与相交环规格数(M)和环上节点规格数(N)相关，每个相交环上的每个节点的可达信息用1bit来表示，则扩展字段的字节数为M*N/8，比如M＝8，N＝16，则扩展字段的字节数为16字节。
此外，由于本实施例重点需要传递的是不可达信息，因此在没有收到确切的节点可达信息时，默认相交环节点可达。
进一步的，在所述获取相交节点发送的各个相交环节点的可达信息的步骤之前，还包括：
使相交节点基于相交环的环状态机中的各个相交环节点的告警信息和环保护倒换报文确定出各个相交环节点是否可达的状态；
相交节点将各个相交环节点是否可达的状态写入上环节点所在的 环的PDU扩展字段，形成可达信息。
示范性的，在本实施例中，对于相交节点，其在搜集相交环节点可达信息之后，往非相交节点的方向发送，并且对于从其他节点收到的节点可达信息无需处理。具体的，由于环状态机会根据各个相交环节点的告警信息和环保护倒换报文来计算出各个相交环节点的可达状态；因此，在相交节点处，可从与本环相交的相交环的环状态机获取各个相交环节点的可达状态，并组合到本环上的RPS PDU扩展字段中，形成可达信息，再发往非共享纤方向，且本站不做其它逻辑处理。
具体的，参见图3所示，环1的节点C为相交节点，其可以从相交环也就是环2的环状态机中提取到环2上的相交环节点是否可达的状态，并将其组合到环1的RPS PDU扩展字段中，往非共享纤方向也就是上环节点B的方向发送。
进一步的，所述获取相交节点发送的各个相交环节点的可达信息，包括：
当接收到相交节点发送的各个相交环节点的可达信息时，判断上环节点所在的环是否发生单环倒换；
若未发生单环倒换，则接收到的可达信息有效，并基于有效的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤；
若发生单环倒换，则接收到的可达信息无效，并将所述可达信息中所有的相交环节点的可达状态均更新为可达，得到新的可达信息，基于新的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤。
示范性的，在本实施例中，由于上环节点和下环节点的可达信息发送和处理逻辑相似，为了描述的简洁性，本实施例结合图3和图5并以上环节点的可达信息发送和处理逻辑进行如下说明：
将所有上环节点所记载的相交环节点的可达信息(即RPS PDU扩展字段)初始化为全部相交环节点可达；
对于类型为相交节点的上环节点而言，在从与本环相交的环状态机中提取相交环节点可达信息之后，往类型为非相交节点的上环节点的方向发送(即发往非共享纤方向)，并且对于从其他节点收到的节点可达信息无需处理；
而对于类型为非相交节点的上环节点而言，在上环节点处需结合单环倒换状态来实现节点可达信息的提取和转发：
(1)当某个方向没有因为各种原因发生倒换的情况下，认为收到的节点可达信息有效，并保存至本地且从另一方向转发至下一节点；
具体的，当单环无倒换的时候，提取东向收到的相交环节点是否可达的状态到本地，同时将该信息从西向发往下一节点，且提取西向收到的相交环节点是否可达的状态到本地，同时将该信息从东向发往下一节点。例如，假设图3中的上环节点A没有发生单环倒换，则提取从上环节点B收到的相交环也就是环2上的相交环节点是否可达的状态保存到本地，并将其组合到环1的RPS PDU扩展字段中发往上环节点F，同时提取从上环节点F收到的相交环也就是环2上的相交环节点是否可达的状态保存到本地，并将其组合到环1的RPS PDU扩展字段中发往上环节点B。
(2)当某个方向因为各种原因发生倒换，认为收到的节点可达信息无效，本地节点可达信息回到初始化状态，并且将初始化状态从另一方向转发至下一节点。
(3)具体的，根据单环倒换的方向存在以下两种情况：
1)当发生单环西向倒换时，清除西向相交环节点可达信息并恢复至初始化状态，也就是所有节点可达，并以此状态向东向转发，同时提取东向收到的相交环节点是否可达的状态到本地，并将该信息从西向发往下一节点。例如，假设图3中的上环节点A发生西向倒换，那么清除从上环节点B方向发送过来的相交环节点可达信息，并将所有相交环节点的可达状态恢复至初始化状态，且将其组合到环1的RPS PDU扩展字段中发往上环节点F；同时提取从上环节点F收到的相交 环也就是环2上的相交环节点是否可达的状态保存到本地，并将其组合到环1的RPS PDU扩展字段中发往上环节点B。
2)当发生单环东向倒换时，清除东向相交环节点可达信息并恢复至初始化状态，也就是所有节点可达，并以此状态向西向转发，同时提取西向收到的相交环节点是否可达的状态到本地，并将该信息从东向发往下一节点。例如，假设图3中的上环节点A发生东向倒换，那么清除从上环节点F方向发送过来的相交环节点可达信息，并将所有相交环节点的可达状态恢复至初始化状态，且将其组合到环1的RPS PDU扩展字段中发往上环节点B；同时提取从上环节点B收到的相交环也就是环2上的相交环节点是否可达的状态保存到本地，并将其组合到环1的RPS PDU扩展字段中发往上环节点F。
步骤S30：根据各个相交环节点的可达信息确定不可达的相交环节点；
示范性的，在本实施例中，上环节点可以根据可达信息中的RPS PDU扩展字段的具体值判定相交环节点是否可达，即当在RPS PDU扩展字段中检测到0，则0指示的ID对应的相交环节点可达，而若在RPS PDU扩展字段中检测到1，则1指示的ID对应的相交环节点不可达。
步骤S40：基于不可达的相交环节点对应的跨环业务保护路径组信息进行路径倒换。
进一步的，在所述获取相交节点发送的各个相交环节点的可达信息的步骤之后，还包括：
根据各个相交环节点的可达信息确定可达的相交环节点；
检测可达的相交环节点对应的上环节点所在的环是否发生单环倒换；
若发生单环倒换，则基于单环倒换的状态信息进行路径倒换；
若未发生单环倒换，则不进行路径倒换。
示范性的，在相交节点可达信息实现传递之后，下一步需要说明的是双环倒换模型的建立以及倒换逻辑的实现。
在原环网保护方案中，每个上环节点分配两个基本环倒换组，即西向倒换组和东向倒换组，西向倒换组管理业务出口为环西向出口的绑环业务的批量倒换，东向倒换组管理业务出口为环东向出口的绑环业务的批量倒换，而环网保护状态机的作用则是根据告警和收到的RPS报文计算出西向倒换组和东向倒换组的状态以及即将发送的RPS信息。而在本实施例中，在原环网保护方案的基础上，增加了对跨环业务的分组以及倒换逻辑，可以兼容原方案的单环倒换功能，同时增加双环倒换功能的实现逻辑。
其中，关于双环倒换模型的建立，主要有以下几点：
(1)在相交节点处上话的业务，单环倒换功能即可满足，没有跨环业务双环倒换功能需求，因此不需要做分组处理；
(2)在非相交节点上话的业务，需要在上环配置模型中，针对该条跨环业务的下环的环ID和下环的目的节点ID(即下话节点ID)组合作为KEY值，分配跨环业务保护路径组，用于管理相同出口方向、相同上环、下环以及下话节点的跨环LSP的双环倒换。
关于双环倒换逻辑的实现，需要综合目的节点(即下话节点)的可达信息以及单环状态共同实现：
(1)若目的节点不可达，则跨环业务保护路径组直接倒换；
(2)若目的节点可达，则根据对应方向的基本单环倒换组的状态来实现倒换。
根据以上两点说明可知，在本实施例中，跨环业务进行双环倒换功能所需要的时间是2个环状态机运行的时间，按照一个环倒换业务瞬断不超过50ms的标准来算，本实施例的双环倒换业务瞬断时间可以控制在100ms以内。
具体的，参见图6所示，对于步骤S10中所分配的跨环业务保护路径组，可基于以下倒换规则进行倒换：
若FRR(Fast Reroute，快速重路由)的方向为西向，则对于西向跨环业务保护路径组，可从本地存储的西向相交环节点可达信息中提 取与本节点对应的相交环上的下话节点的可达信息，如果是不可达，则直接倒换；而如果为可达，则和西向基本环倒换组的状态保持一致；
若FRR的方向为东向，则对于东向跨环业务保护路径组，可从本地存储的东向相交环节点可达信息中提取与本节点对应的相交环上的下话节点的可达信息，如果是不可达，则直接倒换；而如果为可达，则和东向基本环倒换组的状态保持一致。
由此可见，基于上述倒换规则，当确定某一相交环节点不可达后，以该相交环节点为下话节点的上环节点，就可以根据该不可达的相交环节点对应的跨环业务保护路径组信息以环通道的形式进行路径倒换，即该上环节点上以该相交环节点为下话节点、具有相同出口方向、相同上环、下环的所有跨环LSP进行批量双环倒换；而当确定某一相交环节点可达后，以该相交环节点为下话节点的上环节点，就可以根据西向基本环倒换组的状态确定是否进行路径倒换。
综上，本实施例通过新增RPS PDU字段的提取和转发来传递相交环节点的可达状态，并通过新分配的跨环业务保护路径组来实现相同绑环路径业务的批量双环倒换，结合节点可达信息和本地环状态来控制跨环业务双环倒换状态；且根据以上倒换过程的分析可知，业务倒换时间只与环状态机的运行和倒换效率相关，与跨环业务规格数不再成相关关系，倒换时间为两倍的环网倒换时间。因此，本实施例解决了相交节点处以跨环LSP为条目进行双环倒换的原理缺陷，实现了以环通道为单位对业务进行批量双环倒换；且倒换时间从最高秒级以上下降到100ms以内，有效缩短了跨环业务倒换时间，在跨环业务大规格场景下实现了对倒换性能数量级程度的提升。
本申请实施例还提供了一种双环倒换实现系统，包括多个上环节点，每个上环节点包括：
获取模块，其用于获取每个相交环节点对应的跨环业务保护路径组信息；获取相交节点发送的各个相交环节点的可达信息，可达信息用于标识相交环节点是否可达；
确定模块，其用于根据各个相交环节点的可达信息确定不可达的相交环节点；
倒换模块，其用于基于不可达的相交环节点对应的跨环业务保护路径组信息进行路径倒换。
进一步的，所述倒换模块还用于：
根据各个相交环节点的可达信息确定可达的相交环节点；
检测可达的相交环节点对应的上环节点所在的环是否发生单环倒换；
若发生单环倒换，则基于单环倒换的状态信息进行路径倒换；
若未发生单环倒换，则不进行路径倒换。
所述获取模块具体用于：
当接收到相交节点发送的各个相交环节点的可达信息时，判断上环节点所在的环是否发生单环倒换；
若未发生单环倒换，则接收到的可达信息有效，并使确定模块基于有效的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤；
若发生单环倒换，则接收到的可达信息无效，并将所述可达信息中所有的相交环节点的可达状态均更新为可达，得到新的可达信息，且使确定模块基于新的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤。
进一步的，所述相交节点基于PDU扩展字段实现可达信息的传递。
进一步的，相交节点基于相交环的环状态机中的各个相交环节点的告警信息和环保护倒换报文确定出各个相交环节点是否可达的状态；相交节点将各个相交环节点是否可达的状态写入上环节点所在的环的PDU扩展字段，形成可达信息。
进一步的，每个跨环业务保护路径组信息包括上环节点所在的环的ID、相交环的ID、下话节点的ID以及上环节点到相交环的方向。
进一步的，所述跨环业务保护路径组信息的数量为2×N，包括N 个第一方向的跨环业务保护路径信息和N个第二方向的跨环业务保护路径信息，其中，N为正整数，且N的数值根据相交环节点的数量确定。
需要说明的是，所属本领域的技术人员可以清楚地了解到，为了描述的方便和简洁，上述描述的系统和各模块的具体工作过程，可以参考前述双环倒换实现方法实施例中的对应过程，在此不再赘述。
需要说明的是，在本文中，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、物品或者系统不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、物品或者系统所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括该要素的过程、方法、物品或者系统中还存在另外的相同要素。
以上所述仅是本申请的具体实施方式，使本领域技术人员能够理解或实现本申请。对这些实施例的多种修改对本领域的技术人员来说将是显而易见的，本文中所定义的一般原理可以在不脱离本申请的精神或范围的情况下，在其它实施例中实现。因此，本申请将不会被限制于本文所示的这些实施例，而是要符合与本文所申请的原理和新颖特点相一致的最宽的范围。

Claims (10)

  1. 一种双环倒换实现方法，其特征在于，所述双环倒换实现方法应用于各个上环节点，所述方法包括以下步骤：
    获取每个相交环节点对应的跨环业务保护路径组信息；
    获取相交节点发送的各个相交环节点的可达信息，可达信息用于标识相交环节点是否可达；
    根据各个相交环节点的可达信息确定不可达的相交环节点；
    基于不可达的相交环节点对应的跨环业务保护路径组信息进行路径倒换。
  2. 如权利要求1所述的双环倒换实现方法，其特征在于，在所述获取相交节点发送的各个相交环节点的可达信息的步骤之后，还包括：
    根据各个相交环节点的可达信息确定可达的相交环节点；
    检测可达的相交环节点对应的上环节点所在的环是否发生单环倒换；
    若发生单环倒换，则基于单环倒换的状态信息进行路径倒换；
    若未发生单环倒换，则不进行路径倒换。
  3. 如权利要求1所述的双环倒换实现方法，其特征在于，所述获取相交节点发送的各个相交环节点的可达信息，包括：
    当接收到相交节点发送的各个相交环节点的可达信息时，判断上环节点所在的环是否发生单环倒换；
    若未发生单环倒换，则接收到的可达信息有效，并基于有效的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤；
    若发生单环倒换，则接收到的可达信息无效，并将所述可达信息中所有的相交环节点的可达状态均更新为可达，得到新的可达信息，基于新的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤。
  4. 如权利要求1所述的双环倒换实现方法，其特征在于：所述相 交节点基于PDU扩展字段实现可达信息的传递。
  5. 如权利要求4所述的双环倒换实现方法，其特征在于，在所述获取相交节点发送的各个相交环节点的可达信息的步骤之前，还包括：
    使相交节点基于相交环的环状态机中的各个相交环节点的告警信息和环保护倒换报文确定出各个相交环节点是否可达的状态；
    相交节点将各个相交环节点是否可达的状态写入上环节点所在的环的PDU扩展字段，形成可达信息。
  6. 如权利要求1所述的双环倒换实现方法，其特征在于：每个跨环业务保护路径组信息包括上环节点所在的环的ID、相交环的ID、下话节点的ID以及上环节点到相交环的方向。
  7. 如权利要求6所述的双环倒换实现方法，其特征在于：所述跨环业务保护路径组信息的数量为2×N，包括N个第一方向的跨环业务保护路径信息和N个第二方向的跨环业务保护路径信息，其中，N为正整数，且N的数值根据相交环节点的数量确定。
  8. 一种双环倒换实现系统，其特征在于，包括多个上环节点，每个上环节点包括：
    获取模块，其用于获取每个相交环节点对应的跨环业务保护路径组信息；获取相交节点发送的各个相交环节点的可达信息，可达信息用于标识相交环节点是否可达；
    确定模块，其用于根据各个相交环节点的可达信息确定不可达的相交环节点；
    倒换模块，其用于基于不可达的相交环节点对应的跨环业务保护路径组信息进行路径倒换。
  9. 如权利要求8所述的双环倒换实现系统，其特征在于，所述倒换模块还用于：
    根据各个相交环节点的可达信息确定可达的相交环节点；
    检测可达的相交环节点对应的上环节点所在的环是否发生单环倒换；
    若发生单环倒换，则基于单环倒换的状态信息进行路径倒换；
    若未发生单环倒换，则不进行路径倒换。
  10. 如权利要求8所述的双环倒换实现系统，其特征在于，所述获取模块具体用于：
    当接收到相交节点发送的各个相交环节点的可达信息时，判断上环节点所在的环是否发生单环倒换；
    若未发生单环倒换，则接收到的可达信息有效，并使确定模块基于有效的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤；
    若发生单环倒换，则接收到的可达信息无效，并将所述可达信息中所有的相交环节点的可达状态均更新为可达，得到新的可达信息，且使确定模块基于新的可达信息执行所述根据各个相交环节点的可达信息确定不可达的相交环节点的步骤。
PCT/CN2023/071837 2022-07-29 2023-01-12 一种双环倒换实现方法及系统 WO2024021535A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210905745.7A CN115296955B (zh) 2022-07-29 2022-07-29 一种双环倒换实现方法及系统
CN202210905745.7 2022-07-29

Publications (1)

Publication Number Publication Date
WO2024021535A1 true WO2024021535A1 (zh) 2024-02-01

Family

ID=83826244

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/071837 WO2024021535A1 (zh) 2022-07-29 2023-01-12 一种双环倒换实现方法及系统

Country Status (2)

Country Link
CN (1) CN115296955B (zh)
WO (1) WO2024021535A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115296955B (zh) * 2022-07-29 2023-07-25 烽火通信科技股份有限公司 一种双环倒换实现方法及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102546425A (zh) * 2012-01-31 2012-07-04 华为技术有限公司 相交环保护方法、设备和系统
CN103684955A (zh) * 2013-12-18 2014-03-26 华为技术有限公司 环网中发生故障时路径确定方法、装置以及系统
CN103825816A (zh) * 2012-11-16 2014-05-28 中国移动通信集团公司 基于多环结构网络相交环的业务的传输保护方法及装置
WO2022179437A1 (zh) * 2021-02-26 2022-09-01 华为技术有限公司 传输数据的方法和通信装置
CN115296955A (zh) * 2022-07-29 2022-11-04 武汉烽火技术服务有限公司 一种双环倒换实现方法及系统

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102035712B (zh) * 2009-09-29 2013-12-18 华为技术有限公司 多协议标签交换的环网保护方法、装置和系统
CN102148733B (zh) * 2010-02-04 2014-01-01 华为技术有限公司 一种相交环网保护方法、装置和系统
CN102684973B (zh) * 2011-03-09 2017-03-29 中兴通讯股份有限公司 一种环网保护的方法及系统
CN105915371B (zh) * 2016-04-07 2019-03-26 烽火通信科技股份有限公司 一种ptn环网保护的双环逃生实现方法及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102546425A (zh) * 2012-01-31 2012-07-04 华为技术有限公司 相交环保护方法、设备和系统
CN103825816A (zh) * 2012-11-16 2014-05-28 中国移动通信集团公司 基于多环结构网络相交环的业务的传输保护方法及装置
CN103684955A (zh) * 2013-12-18 2014-03-26 华为技术有限公司 环网中发生故障时路径确定方法、装置以及系统
WO2022179437A1 (zh) * 2021-02-26 2022-09-01 华为技术有限公司 传输数据的方法和通信装置
CN115296955A (zh) * 2022-07-29 2022-11-04 武汉烽火技术服务有限公司 一种双环倒换实现方法及系统

Also Published As

Publication number Publication date
CN115296955A (zh) 2022-11-04
CN115296955B (zh) 2023-07-25

Similar Documents

Publication Publication Date Title
US8565071B2 (en) Protection method, system, and device in packet transport network
CN100558111C (zh) 城域以太网提供多业务组网下的可靠性处理方法及系统
CN102035712B (zh) 多协议标签交换的环网保护方法、装置和系统
CN101317388B (zh) 多协议标签切换的标签切换路径保护切换的装置和方法
US20120236730A1 (en) Method, device and system for processing service traffic based on pseudo wires
EP2467973B1 (en) Method and means for state transition of Ethernet linear protection switching
CA2762924C (en) Method, apparatus and system for two-node cluster hot backup
CN102025541A (zh) 一种实现组播保护的方法及系统
JP6269088B2 (ja) 冗長パス提供方法および伝送装置
CN102480368B (zh) 一种聚合链路的保护方法及系统
CN114285462B (zh) 一种业务保护方法和网络节点
JP2011066564A (ja) データ中継装置、及びリング型通信システム
WO2024021535A1 (zh) 一种双环倒换实现方法及系统
JP2017034463A (ja) プロテクション方法、通信システム、及び、エンドノード
EP3182645B1 (en) Network protection switching method, network device and storage medium
CN102480409A (zh) 实现rrpp环分路上行的方法、rrpp环和装置
CN102148733B (zh) 一种相交环网保护方法、装置和系统
EP2426855B1 (en) Address refresh method and system
CN101646105A (zh) 业务恢复的方法、系统和设备
WO2017173807A1 (zh) 一种ptn环网保护的双环逃生实现方法及系统
JP2010239279A (ja) 通信装置及びその方法並びに通信システム及びその方法
CN101997748A (zh) 无虚拟通道的子环控制信道阻塞协议报文的方法和系统
JP2011510534A (ja) イーサネット（登録商標）仮想専用ルート権限付きマルチポイントサービスのスマートプロテクションのための方法およびシステム
CN102780587B (zh) Mpls-tp中实现环网保护的方法
CN112187634A (zh) 一种vrrp横联保护方法及系统

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: 23844754

Country of ref document: EP

Kind code of ref document: A1