WO2023116034A1 - 路由更新方法、网络设备和计算机可读存储介质 - Google Patents

路由更新方法、网络设备和计算机可读存储介质 Download PDF

Info

Publication number
WO2023116034A1
WO2023116034A1 PCT/CN2022/115923 CN2022115923W WO2023116034A1 WO 2023116034 A1 WO2023116034 A1 WO 2023116034A1 CN 2022115923 W CN2022115923 W CN 2022115923W WO 2023116034 A1 WO2023116034 A1 WO 2023116034A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
route
routing
message
destination node
Prior art date
Application number
PCT/CN2022/115923
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 WO2023116034A1 publication Critical patent/WO2023116034A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/22—Alternate routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/24—Multipath
    • H04L45/247—Multipath using M:N active or standby paths
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present application relates to the technical field of communications, and in particular to a route updating method, network equipment and computer-readable storage medium.
  • the standard document "draft-ietf-rtgwg-srv6-egress-protection" defines a provider edge (Provider Edge, PE) node protection mechanism based on IPv6 forwarding plane segment routing (Segment Routing IPv6, SRv6).
  • PE Provide Edge
  • IPv6 forwarding plane segment routing Segment Routing IPv6, SRv6
  • the IGP protocol often perceives the event earlier than the Border Gateway Protocol (BGP), and thus notifies other nodes to change the route.
  • BGP Border Gateway Protocol
  • packets transmitted through the BGP protocol cannot reach the upstream node of the primary PE node, and the upstream node of the primary PE node will also delete the backup routing information when updating the route, causing the above mechanism to fail to take effect, thus failing to achieve the expected protection effect.
  • multiple link invalidation deletion events will occur due to timing reasons. This may cause the upstream node of the primary PE node Reaching the original upstream node of the primary PE node will also cause the above mechanism to fail to take effect.
  • Embodiments of the present application provide a route update method, a network device, and a computer-readable storage medium.
  • the embodiment of the present application provides a route update method, which is applied to the first node in the communication network, and the method includes: when receiving the notification information of the routing status change, and performing route calculation according to the notification information After determining that the route of the destination node changes, start timing, and the destination node is the destination node of the first message to be forwarded at present; under the situation that the timing is not overtime, send the first report to the next hop node
  • the first message includes the identification information of the second node, so that the next-hop node forwards the first message to the second node according to the identification information of the second node, and the The second node is the penultimate hop node in the initial route; after the timer expires, the route is updated according to the notification information of the route status change.
  • the embodiment of the present application provides a method for updating a route, which is applied to a second node in a communication network, and the second node is an intermediate node adjacent to a destination node in the communication network.
  • the method Including: when receiving the notification information of the routing state change and performing routing calculation according to the notification information, it is determined that the route of the destination node has changed, and starting timing, and the destination node is the destination node of the first message to be forwarded; If the timer has not expired, determine the backup node of the destination node according to the preset backup routing information, and forward the first message to the backup node; after the timer expires, according to the The notification information of the routing status change is used for routing update.
  • the embodiment of the present application provides a network device, including: a memory, a processor, and a computer program stored in the memory and operable on the processor.
  • a network device including: a memory, a processor, and a computer program stored in the memory and operable on the processor.
  • the processor executes the computer program, the above-mentioned The routing update method provided by the first aspect or the second aspect.
  • the embodiment of the present application provides a computer-readable storage medium storing a computer program, and when the computer program is executed by a processor, implements the route updating method provided in the first aspect or the second aspect above.
  • Figure 1 is a schematic diagram of a typical SRv6 network networking architecture
  • FIG. 2 is a schematic flow diagram of a routing update method provided in an embodiment of the present application.
  • Fig. 3 is a schematic flow chart of another routing update method provided by the embodiment of the present application.
  • FIG. 4 is a schematic flow chart of another routing update method provided by an embodiment of the present application.
  • Fig. 5 is a schematic flow chart of another routing update method provided by the embodiment of the present application.
  • FIG. 6 is a schematic structural diagram of a network device provided by an embodiment of the present application.
  • At least one of the following and similar expressions refer to any group of these items, including any group of single or plural items.
  • at least one of a, b, and c can represent: a, b, c, a and b, a and c, b and c, or, a and b and c, where a, b, c can be a single , or more than one.
  • FIG. 1 shows a schematic diagram of a typical SRv6 network networking architecture.
  • the SRv6 network shown in Figure 1 includes PE nodes PE1, PE2, PE3 and PE4, and provider backbone nodes (Provider, P) P1 and P2, and PE1, PE2, PE3 and PE4 belong to the same VPN network.
  • PE4 is the backup node of PE3.
  • the Mirror Segment Identifier (Mirror SID) is configured on the PE4 node.
  • the Mirror SID is associated with the SRv6 Locator of PE3.
  • the Interior Gateway Protocols (IGP) protocol performs a flood notification, which is received by other nodes (PE1, PE2, P1, P2) in the network.
  • IGP Interior Gateway Protocols
  • the standard document "draft-ietf-rtgwg-srv6-egress-protection" defines an SRv6-based PE node protection mechanism.
  • the upstream node of the primary PE node forwards the message originally intended to be forwarded to the primary PE node to the backup PE node according to the backup routing information.
  • the P1 node is directly connected to the upstream node of the PE3 node, and it locally stores the backup routing information of the PE3 node.
  • the P1 node determines that the PE4 node is based on the local backup routing information.
  • the backup node of the PE3 node forwards the packet originally to be forwarded to the PE3 node to the PE4 node, and then the PE4 node forwards the packet to the corresponding customer edge node (Customer Edge, CE) device, so as to protect the packet from the PE The purpose of the node.
  • Customer Edge, CE Customer Edge
  • the first problem is that after the primary PE node fails, because the IGP protocol often perceives the event earlier than the Border Gateway Protocol (BGP), it sends a notification of the routing status change to other nodes in the SRv6 network. When other nodes receive the notice, they update the route. In this way, the routing forwarding entry of the primary PE node does not exist in the routing tables of other nodes, and the backup routing information in the upstream node is also deleted.
  • BGP protocol has not yet sensed the failure of the primary PE node, and has not switched the virtual private network (Virtual Private Network, VPN) route to the new PE node.
  • VPN Virtual Private Network
  • the VPN packet It will not be forwarded to the upstream node of the main PE node, and the packet will be directly discarded at the remote end.
  • the above protection mechanism does not take effect as expected, resulting in more business packet loss.
  • the IGP protocol will notify other nodes in the network of the failure of the PE3 node. After receiving the notification, other nodes will trigger a route update and delete the route to the PE3 node. For the P1 node, it will delete the backup routing information of the PE3 node. Since the BGP protocol has not yet detected the failure of the PE3 node, it continues to use the PE3 node as the destination node of the VPN packet. However, other nodes have deleted the route to the PE3 node, so the VPN packet cannot reach the PE3 node, and the packet is blocked. Discarded, the mechanism to protect the PE3 node did not work.
  • the second problem is that in some scenarios, when the failure of the primary PE node is notified by IGP flooding, it will become multiple link invalid deletion events due to timing reasons. When the remote link perceives that some links are invalid, The SRv6 route of the main PE node will be re-converged. After convergence, the upstream device of the main PE node on the forwarding path may change. The Mirror SID calculates the backup route; therefore, if the remote device forwards the message to the primary PE node to the new upstream node, the message may be discarded at the node, resulting in the expected Mirror SID Protection failed.
  • the embodiments of the present application provide a route update method, a network device, and a computer-readable storage medium, which are used to solve the problem that the PE protection mechanism of the SRv6 network cannot take effect in some scenarios.
  • FIG. 2 is a schematic flowchart of a route updating method provided in an embodiment of the present application.
  • the embodiment shown in FIG. 2 can be applied to the first node in the communication network, and the first node is the source node in the communication network, or an intermediate node except the penultimate hop node in the route to the destination node, where
  • the communication network may be an SRv6 network.
  • the first node may be any one of the PE1 node, the PE2 node, and the P2 node in the SRv6 network shown in FIG. 1 .
  • the routing update method provided by the embodiment of the present application includes but is not limited to the following steps:
  • the routing state change described in step S110 refers to a state change of the route from the own node to the destination node, and the destination node is the destination node of the first message to be forwarded currently.
  • the first node when the first node receives the notification information of the route state change, it starts timing first, instead of immediately updating the route as in the related technical solution.
  • the route state change described in step S110 may be that the state of the destination node is unreachable, or that the penultimate hop node in the route is changed.
  • the identification information of the second node is encapsulated in the first message, where the second node is the penultimate hop node in the initial route (the P1 node in the network as shown in FIG. 1 )
  • the initial route refers to the route from this node to the destination node before the state change occurs.
  • the identification information may be the End.SID of the second node.
  • End.SID means Endpoint SID (Segment Identifier, segment identifier), which is used to identify a destination address prefix (Prefix) in the network.
  • the End.SID of the second node may be added to the SRH extension header of the message, so that the message carries the End.SID information of the second node.
  • the local node sends the first packet carrying the End.SID information of the second node to the next-hop node, so as to instruct the next-hop node to forward the first packet to the second node.
  • the next-hop node searches the routing table according to the End.SID information of the second node in the first message, so as to forward the first message to the second node, and then make the second node based on
  • the protection mechanism forwards the message originally forwarded to the destination node to the backup node.
  • the End.SID information of the second node may also be directly added to the destination IPv6 address field of the first message, so as to instruct the next-hop node to forward the first message to the second node superior.
  • the time length of the timer is set to delay-time
  • the delay-time can be configured through the following processing methods:
  • the first one is statically configured by the user, and the length of delay-time must exceed the keep-alive time of BGP;
  • the second is to negotiate with the BGP protocol on the node device, and obtain a delay-time through negotiation, so as to ensure that the VPN service of the BGP protocol can be switched normally within the delay-time;
  • the third type is determined by the notification of the main PE node (destination node), that is, when the main PE node notifies the protected SRv6 Locator route, it also notifies additional routing delay calculation time information, and other node devices need to delay when updating routing information Update or delete after this time.
  • the first node when the first node receives the notification information of the routing state change, it first starts timing to delay the routing update, and within the timing range, according to the identification information of the second node, the first node The message is forwarded to the penultimate hop node in the initial route, so as to forward the first message to the backup node of the destination node through the penultimate hop node, so as to ensure that the business can switch traffic according to the expected protection mechanism, thereby reducing traffic loss Bag. After the timing expires, the first node performs routing update according to the notification information of the routing status change.
  • FIG. 3 shows a schematic flowchart of a route updating method provided by an embodiment of the present application.
  • the routing update method shown in Figure 3 is executed by the source node in the communication network (for example, the source node PE1 in the SRv6 network shown in Figure 1), as shown in Figure 3, the routing update method of the embodiment of the present application may include but not Limited to the following steps:
  • S210 Receive a second message, where the second message carries identification information of the destination node;
  • S220 Determine the initial route according to the identification information of the destination node, and use the penultimate hop node in the initial route as the second node.
  • S260 When it is determined that the state of the second node is reachable, start timing, and send the first message to the next-hop node, where the first message includes identification information of the second node, and making the next-hop node forward the first message to the second node according to the identification information of the second node, where the second node is the penultimate hop node in the initial route;
  • FIG. 3 The embodiment shown in FIG. 3 will be described in detail below in conjunction with the SRv6 network shown in FIG. 1 .
  • the identification information of the destination node may be an address identification in the destination address field of the second packet.
  • the source node PE1 receives the second message, and the destination address field in the second message carries the SRv6 Locator information 3001:1:1::/64 of PE3, so the It is determined that the destination node of the second packet is PE3.
  • PE1 After PE1 determines that the destination node is PE3, it can determine the forwarding path of the second packet (that is, the initial route) by looking up routing table entries. After determining the initial route, PE1 uses the penultimate hop node in the initial route as the second node. PE1 can use the SPF algorithm to calculate the shortest path of the route to PE3, which is PE1-PE2-P2-P1-PE3, and the outgoing interface is if-1, and then it can be determined that the penultimate hop node is P1, so P1 is taken as the second node. After determining that the second node is P1, PE1 encapsulates the END.SID of P1 (that is, 5001:1:1::1) into the second packet to obtain the first packet.
  • PE1 receives notification information of route state changes, and performs route calculation based on the notification information and learns that the route to PE3 has changed, then PE1 first judges whether the previously determined second node (P1) is reachable. If the P1 node is reachable, start timing, and send the first message carrying the END.SID information of P1 to the next hop node PE2 within the timing delay-time. After the PE2 node receives the first message, it can search the relevant routing table entries according to the END.SID information of P1 carried in the first message, so as to forward the first message to the P1 node, and then make the P1 node based on The backup routing information stored locally forwards the first packet to the backup node PE4 of PE3. After the timer expires, PE1 updates the route according to the notification information of the route status change.
  • PE1 directly updates the route according to the notification information of the route status change.
  • FIG. 4 shows a schematic flowchart of a route update method provided by an embodiment of the present application.
  • the routing update method shown in Figure 4 is executed by an intermediate node except the penultimate hop node in the communication network (such as node PE2 or P2 in the SRv6 network shown in Figure 1), as shown in Figure 4, the embodiment of the present application
  • the routing update method may include but not limited to the following steps:
  • S310 Receive a first message from a previous hop node, where the first message carries identification information of a second node;
  • FIG. 4 The embodiment shown in FIG. 4 will be described in detail below in conjunction with the SRv6 network shown in FIG. 1 .
  • the PE2 node receives the first packet from the PE1 node, and the first packet carries the END.SID (5001:1:1::1) information of the P1 node.
  • the PE2 node receives the notification information of the routing state change, and performs routing calculation based on the notification information, and learns that the route to the destination node PE3 has changed, then PE2 first judges whether the second node (P1) is reachable. If the P1 node is reachable, start timing, and send the first message carrying the END.SID information of P1 to the next hop node P2 within the timing delay-time. After the timer expires, PE2 updates the route according to the notification information of the route status change.
  • PE2 directly updates the route according to the notification information of the route status change.
  • the processing process of the P2 node after receiving the first message from the PE2 node is basically similar to the processing process of PE2, so as to send the first message to the second node P1.
  • FIG. 5 shows a schematic flowchart of a route update method provided by an embodiment of the present application.
  • the route update method shown in FIG. 5 is executed by a second node, which is an intermediate node adjacent to the destination node in the communication network (for example, the P1 node in the SRv6 network shown in FIG. 1 ).
  • the routing update method of the embodiment of the present application may include but not limited to the following steps:
  • FIG. 5 The embodiment shown in FIG. 5 will be described in detail below in conjunction with the SRv6 network shown in FIG. 1 .
  • the P1 node decapsulates the message and continues to process the subsequent SID information, that is, the SRv6 Locator route matched to the primary PE3.
  • P1 receives the notification information of the routing status change, and performs routing calculation based on the notification information, it learns that the route to PE3 has changed and PE3 is unreachable, then P1 starts timing, and avoids associating the backup routing information of PE3 by delaying the routing update delete.
  • the first packet originally to be forwarded to PE3 is forwarded to the PE4 node, so as to retain the PE node and reduce the technical effect of packet loss.
  • the P1 node After the P1 node perceives the failure of the primary PE3 device, it triggers route recalculation. Since the P1 node is the penultimate hop of the SRv6 Locator route, it cannot immediately update or delete the SRv6 Locator route. It needs to wait for the delay-time before deleting it. Here During this period, the message forwarded to PE3 by P1 node will be forwarded according to its locally stored backup routing information, that is, the message will be forwarded to the backup node PE4, so as to realize fast switching of services and avoid service packet loss.
  • FIG. 6 shows a network device 900 provided by an embodiment of the present application.
  • the network device 900 includes but is not limited to:
  • memory 910 for storing programs
  • the processor 920 is configured to execute the program stored in the memory 910, and when the processor 920 executes the program stored in the memory 910, the processor 920 is configured to execute the above-mentioned route updating method.
  • the processor 920 and the memory 910 may be connected through a bus or in other ways.
  • the memory 910 as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer executable programs, such as the route update method described in any embodiment of the present application.
  • the processor 920 executes the non-transitory software programs and instructions stored in the memory 910 to implement the above-mentioned route update method.
  • the memory 910 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application program required by at least one function; the data storage area may store and execute the above-mentioned routing update method.
  • the memory 910 may include a high-speed random access memory, and may also include a non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state storage devices.
  • the memory 910 may include memory located remotely relative to the processor 920, and these remote memories may be connected to the processor 920 through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • the non-transitory software programs and instructions required to implement the above route update method are stored in the memory 910, and when executed by one or more processors 920, the route update method provided by any embodiment of the present application is executed.
  • the embodiment of the present application also provides a storage medium storing computer-executable instructions, and the computer-executable instructions are used to execute the above-mentioned route update method.
  • the storage medium stores computer-executable instructions, and the computer-executable instructions are executed by one or more control processors 920, for example, executed by one of the processors 920 in the above-mentioned network device 900, so that the above-mentioned One or more processors 920 execute the route update method provided by any embodiment of the present application.
  • the routing update method when the notification information of the routing status change is received, and the routing calculation is performed according to the notification information, it is determined that the routing of the destination node has changed, and the timing is started.
  • the destination node is currently to be forwarded.
  • the destination node of the first message when the timing has not timed out, send the first message to the next hop node, the first message includes the identification information of the second node, so that the next hop node
  • the one-hop node forwards the first message to the second node according to the identification information of the second node, and the second node is the penultimate hop node in the initial route; after the timing expires, Routing update is performed according to the notification information of the routing status change.
  • the timer is first started to delay the route update, and within the time range of the timer, the first message is forwarded to the node in the initial route according to the identification information of the second node.
  • the penultimate hop node is used to forward the first message to the backup node of the destination node through the penultimate hop node, so as to ensure that the business can switch traffic according to the expected protection mechanism, thereby reducing traffic packet loss.
  • Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cartridges, tape, magnetic disk storage or other magnetic storage devices, or can Any other medium used to store desired information and which can be accessed by a computer.
  • communication media typically embody computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media .

Landscapes

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

Abstract

本申请提供了一种路由更新方法、网络设备和计算机可读存储介质，所述方法包括：当接收到路由状态变化的通告信息、且根据所述通告信息进行路由计算后确定目的节点的路由发生变化，启动计时，所述目的节点为当前待转发的第一报文的目的节点(S110)；在计时未超时的情况下，向下一跳节点发送所述第一报文，所述第一报文包括第二节点的标识信息，以使所述下一跳节点将所述第一报文转发至所述第二节点，所述第二节点为初始路由中的倒数第二跳节点(S120)；在计时超时后，根据所述路由状态变化的通告信息进行路由更新(S130)。

Description

路由更新方法、网络设备和计算机可读存储介质
相关申请的交叉引用
本申请基于申请号为202111587486.X、申请日为2021年12月23日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请涉及通信技术领域，特别是涉及一种路由更新方法、网络设备和计算机可读存储介质。
背景技术
标准文档“draft-ietf-rtgwg-srv6-egress-protection”中定义了一种基于IPv6转发平面的段路由(Segment Routing IPv6，SRv6)的运营商边缘(Provider Edge，PE)节点保护机制。在该机制中，SRv6网络中与主PE节点直连的上游节点配置有备份路由信息，一旦该主PE节点失效，该上游节点会根据备份路由信息将原本要转发至主PE节点的报文转发至备份PE节点。然而，在实际应用中发现，一些场景中，在主PE节点失效后，由于IGP协议往往比边界网关协议(Border Gateway Protocol，BGP)更早地感知到该事件，从而通告其他节点进行路由变更，进而导致通过BGP协议传输的报文无法到达主PE节点的上游节点，而且主PE节点的上游节点在更新路由时也会将备份路由信息删除，导致上述机制无法生效，从而无法起到预期的保护作用。还有一些场景中，主PE节点的失效在通过IGP协议泛洪通告时，会由于时序原因变为多次链路无效删除事件，这样可能导致主PE节点的上游节点发生变化，使得报文无法到达主PE节点原来的上游节点，同样会导致上述机制无法生效。
发明内容
本申请实施例提供了一种路由更新方法、网络设备和计算机可读存储介质。
第一方面，本申请实施例提供一种路由更新的方法，应用于通信网络中的第一节点，所述方法包括：当接收到路由状态变化的通告信息、且根据所述通告信息进行路由计算后确定目的节点的路由发生变化，启动计时，所述目的节点为当前待转发的第一报文的目的节点；在所述计时未超时的情况下，向下一跳节点发送所述第一报文，所述第一报文包括第二节点的标识信息，以使所述下一跳节点根据所述第二节点的标识信息将所述第一报文转发至所述第二节点，所述第二节点为初始路由中的倒数第二跳节点；在所述计时超时后，根据所述路由状态变化的通告信息进行路由更新。
第二方面，本申请实施例提供一种路由更新的方法，应用于通信网络中的第二节点，所述第二节点为与所述通信网络中的目的节点相邻的中间节点，所述方法包括：当接收到路由状态变化的通告信息、且根据所述通告信息进行路由计算后确定目的节点的路由发生变化，启动计时，所述目的节点为当前待转发的第一报文的目的节点；在所述计时未超时的情况下，根据预设的备份路由信息确定所述目的节点的备份节点，并向所述备份节点转发所述第一报文；在所述计时超时后，根据所述路由状态变化的通告信息进行路由更新。
第三方面，本申请实施例提供一种网络设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时，实现如上第一方面或第二方面提供的路由更新方法。
第四方面，本申请实施例提供一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时，实现如上第一方面或第二方面提供的路由更新方法。
附图说明
附图用来提供对本申请技术方案的进一步理解，并且构成说明书的一部分，与本申请的实施例一起用于解释本申请的技术方案，并不构成对本申请技术方案的限制。
图1是一种典型的SRv6网络组网架构示意图；
图2是本申请实施例提供的一种路由更新方法的流程示意图；
图3是本申请实施例提供的另一种路由更新方法的流程示意图；
图4是本申请实施例提供的另一种路由更新方法的流程示意图；
图5是本申请实施例提供的另一种路由更新方法的流程示意图；
图6是本申请实施例提供的一种网络设备的结构示意图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的实施例仅用以解释本申请，并不用于限定本申请。
应了解，在本申请实施例的描述中，如果有描述到“第一”、“第二”等只是用于区分技术特征为目的，而不能理解为指示或暗示相对重要性或者隐含指明所指示的技术特征的数量或者隐含指明所指示的技术特征的先后关系。“至少一个”是指一个或者多个，“多个”是指两个或两个以上。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示单独存在A、同时存在A和B、单独存在B的情况。其中A，B可以是单数或者复数。字符“/”一般表示前后关联对象是一种“或”的关系。“以下至少一项”及其类似表达，是指的这些项中的任意组，包括单项或复数项的任意组。例如，a、b和c中的至少一项可以表示：a，b，c，a和b，a和c，b和c，或者，a和b和c，其中a，b，c可以是单个，也可以是多个。
此外，下面所描述的本申请各个实施方式中所涉及到的技术特征只要彼此之间未构成冲突就可以相互组合。
为便于理解本申请实施例的技术方案，下面先对本申请实施例的相关技术进行说明。
图1示出了一种典型的SRv6网络组网架构示意图。图1所示的SRv6网络，包括PE节点PE1、PE2、PE3和PE4，以及运营商骨干节点(Provider，P)P1和P2，且PE1、PE2、PE3和PE4同属于一个VPN网络。此外，PE4为PE3的备份节点，PE4节点中配置有镜像段标识(Mirror Segment Identifier，Mirror SID)，该Mirror SID与PE3的SRv6位置标识(Locator)相关联，该关联信息会通过内部网关协议(Interior Gateway Protocols，IGP)协议进行泛洪通告，被网络中其他节点(PE1、PE2、P1、P2)接收到。网络中其他节点接收到该通告后，如果其是主节点(即PE3)的直连上游节点，则尝试为主节点进行备份路由计算，将配置Mirror  SID的设备(即PE4)设置为备份转发节点。如图1所示的SRv6网络中，P1是PE3的直连上游节点，所以P1节点收到该通告后，会为PE3进行备份路由计算，并将通过计算得到的备份路由以及上述Mirror SID作为备份路由信息存储在本地。
标准文档“draft-ietf-rtgwg-srv6-egress-protection”中定义了一种基于SRv6的PE节点保护机制。在该保护机制中，一旦该主PE节点失效，主PE节点的上游节点会根据备份路由信息将原本要转发至主PE节点的报文转发至备份PE节点。以图1所示的SRv6网络为例，P1节点作为PE3节点的直连上游节点，其本地存储有PE3节点的备份路由信息，当PE3节点失效时，P1节点根据本地备份路由信息确定PE4节点为PE3节点的备份节点，将原本要转发至PE3节点的报文转发至PE4节点，再由PE4节点将报文转发给对应的用户边缘节点(Customer Edge，CE)设备，从而达到保护报文出PE节点的目的。
然而，在实际应用中发现存在一些问题导致上述机制无法生效，从而无法起到保护作用。问题主要包括：
第一个问题，在主PE节点失效后，由于IGP协议往往比边界网关协议(Border Gateway Protocol，BGP)更早地感知到该事件，从而向SRv6网络中的其他节点发出路由状态变化的通告，其他节点在收到该通告即进行路由更新，这样其他节点的路由表中便不存在该主PE节点的路由转发条目，上游节点中的备份路由信息也随之删除。但是BGP协议还未感知到主PE节点失效，未将虚拟专用网络(Virtual Private Network，VPN)路由切换至新的PE节点，但是由于主PE节点的路由已在远端节点删除，所以VPN报文也不会转发至主PE节点的上游节点，报文在远端直接丢弃，上述保护机制没有按照期望生效，导致业务丢包较多。举例来说，PE3节点失效后，IGP协议会将PE3节点失效的信息通告给网络中的其他节点，其他节点收到通告后便会触发路由更新，将到达PE3节点的路由删除。对于P1节点来说，其会删除PE3节点的备份路由信息。由于BGP协议还未感知到PE3节点失效，还继续将PE3节点作为VPN报文的目的节点，然而其他节点已将到达PE3节点的路由删除，所以VPN报文也无法到达PE3节点，导致报文被丢弃，保护PE3节点的机制没有起到作用。
第二个问题，在一些场景下，主PE节点的失效在IGP泛洪通告时，会由于时序原因变为多次链路无效删除事件，则远端链路在感知到部分链路无效时，就会进行主PE节点SRv6路由的重新收敛，收敛后转发路径上的主PE节点的上游设备可能会发生变化，比如原来不是转发路径的上游节点更新为新的上游节点，则该节点是没有基于Mirror SID计算备份路由的；所以，如果此时远端设备将至主PE节点的报文转发至该新的上游节点时，则报文就可能会在该节点被丢弃，从而导致预期的Mirror SID保护失败。
上述两个问题如果不解决，则标准文档中介绍的基于SRv6Mirror SID的保护就无法在实际组网中部署，并取得有效的保护效果。
基于上述问题，本申请实施例提供一种路由更新方法、网络设备和计算机可读存储介质，用于解决SRv6网络的PE保护机制在一些场景中无法生效的问题。
请参见图2，图2是本申请实施例提供的一种路由更新方法的流程示意图。图2所示的实施例可以应用于通信网络中的第一节点，该第一节点为通信网络中的源节点，或者到达目的节点的路由中除倒数第二跳节点之外的中间节点，这里的通信网络可以是SRv6网络。举例来说，第一节点可以是图1所示SRv6网络中的PE1节点、PE2节点、P2节点中的任意一个。
如图2所示，本申请实施例提供的路由更新方法包括但不限于如下步骤：
S110，当接收到路由状态变化的通告信息、且根据所述通告信息进行路由计算后确定目的节点的路由发生变化，启动计时，所述目的节点为当前待转发的第一报文的目的节点。
可以理解的是，当目的节点的路由发生状态变化时，会通过IGP协议通告给网络中的其他节点。步骤S110中描述的路由状态变化指本节点至目的节点的路由发生状态变化，而所述目的节点为当前待转发的第一报文的目的节点。本申请实施例的方案中，第一节点接收到该路由状态变化的通告信息时，先启动计时，而非如相关技术方案中立即对路由进行更新。
作为示例，步骤S110中描述的路由状态变化可以是所述目的节点的状态为不可达状态，也可以是所述路由中的倒数第二跳节点发生变更。
S120，在所述计时未超时的情况下，向下一跳节点发送所述第一报文，所述第一报文包括第二节点的标识信息，以使所述下一跳节点根据所述第二节点的标识信息将所述第一报文转发至所述第二节点，所述第二节点为初始路由中的倒数第二跳节点。
可以理解的是，本申请实施例在第一报文中封装有第二节点的标识信息，这里第二节点为初始路由中的倒数第二跳节点(如图1所示网络中的P1节点)，初始路由指未发生状态变化前、本节点至目的节点的路由。
可以理解的是，标识信息可以是第二节点的End.SID。End.SID表示Endpoint SID(Segment Identifier，段标识)，用于标识网络中的某个目的地址前缀(Prefix)。
实现时，可以将第二节点的End.SID添加至报文的SRH扩展头中，使得报文携带第二节点的End.SID信息。本节点将携带第二节点的End.SID信息的第一报文发送给下一跳节点，用于指导下一跳节点将第一报文转发至第二节点上。下一跳节点接收到第一报文后，根据第一报文中的第二节点的End.SID信息，查找路由表，以将第一报文转发至第二节点，进而使第二节点基于保护机制，将原转发至目的节点的报文转发至备份节点。
在其他可能的实现方式中，也可以直接将第二节点的End.SID信息添加至第一报文的目的IPv6地址字段中，用于指导下一跳节点将第一报文转发至第二节点上。
S130，在所述计时超时后，根据所述路由状态变化的通告信息进行路由更新。
作为示例，设定计时的时间长度为delay-time，delay-time可通过如下几种处理方式进行配置：
第一种，由用户静态配置，delay-time的时间长度要超过BGP的保活时间；
第二种，与节点设备上的BGP协议进行协商，通过协商获取一个delay-time，以保证在delay-time时间内BGP协议的VPN业务能够正常进行切换；
第三种，由主PE节点(目的节点)通告确定，即主PE节点在通告被保护的SRv6 Locator路由时，还通告额外的路由延迟计算时间信息，其他节点设备在需要更新路由信息时要延迟该时间后再进行更新或者删除。
本申请实施例提供的技术方案，第一节点在接收到路由状态变化的通告信息时，先启动计时以延迟路由更新，在计时的时间范围内，根据第二节点的标识信息将所述第一报文转发至初始路由中的倒数第二跳节点，以通过倒数第二跳节点将第一报文转发至目的节点的备份节点，保证业务可以按照预期保护机制进行流量的切换，从而减少流量丢包。在计时结束之后，第一节点根据所述路由状态变化的通告信息进行路由更新。
请参见图3，图3示出了本申请一个实施例提供的路由更新方法的流程示意图。图3所示的路由更新方法由通信网络中的源节点执行(例如图1所示的SRv6网络中的源节点PE1)， 如图3所示，本申请实施例的路由更新方法可以包括但不限于如下步骤：
S210，接收第二报文，所述第二报文携带目的节点的标识信息；
S220，根据所述目的节点的标识信息确定所述初始路由，并将所述初始路由中的倒数第二跳节点作为所述第二节点。
S230，根据所述第二节点的标识信息和所述第二报文，得到所述第一报文；
S240，当接收到路由状态变化的通告信息、且根据所述通告信息进行路由计算后确定目的节点的路由发生变化，获取所述第二节点的状态，如果所述第二节点的状态为不可达状态，执行步骤S250；如果所述第二节点的状态为可达状态,执行步骤S260、S270；
S250，在确定所述第二节点的状态为不可达状态的情况下，根据所述路由状态变化的通告信息进行路由更新；
S260，在确定所述第二节点的状态为可达状态的情况下，启动计时，向下一跳节点发送所述第一报文，所述第一报文包括第二节点的标识信息，以使所述下一跳节点根据所述第二节点的标识信息将所述第一报文转发至所述第二节点，所述第二节点为初始路由中的倒数第二跳节点；
S270，在所述计时超时后，根据所述路由状态变化的通告信息进行路由更新。
下面结合图1所示的SRv6网络，对图3所示的实施例进行详细说明。
可以理解的是，目的节点的标识信息可以是第二报文的目的地址字段中的地址标识。例如，图1所示的SRv6网络中，源节点PE1接收到第二报文，该第二报文中的目的地址字段携带有PE3的SRv6 Locator信息3001:1:1::/64，因而可确定第二报文的目的节点为PE3。
PE1在确定目的节点为PE3之后，可以通过查找路由表项，确定第二报文的转发路径(即初始路由)。PE1在确定初始路由之后，将所述初始路由中的倒数第二跳节点作为所述第二节点。PE1可以通过SPF算法计算到达PE3的路由的最短路径，其是PE1-PE2-P2-P1-PE3，出接口是if-1，进而可确定倒数第二跳节点是P1，故将P1作为第二节点。PE1在确定第二节点为P1之后，将P1的END.SID(即5001:1:1::1)封装至第二报文中，得到第一报文。
假定PE1接收到路由状态变化的通告信息，并基于该通告信息进行路由计算后获知到达PE3的路由发生了变化，则PE1先判断此前确定的第二节点(P1)是否可达。如果P1节点可达，则启动计时，并在计时的delay-time内，向下一跳节点PE2发送上述携带有P1的END.SID信息的第一报文。PE2节点接收到该第一报文后，即可根据第一报文携带的P1的END.SID信息，查找相关的路由表项，以将第一报文转发至P1节点，进而使P1节点基于其本地存储的备份路由信息将第一报文转发至PE3的备份节点PE4。计时结束后，PE1根据路由状态变化的通告信息进行路由更新。
如果P1节点不可达，PE1直接根据路由状态变化的通告信息进行路由更新。
请参见图4，图4示出了本申请一个实施例提供的路由更新方法的流程示意图。图4所示的路由更新方法由通信网络中的除倒数第二跳节点的中间节点执行(例如图1所示的SRv6网络中的节点PE2或者P2)，如图4所示，本申请实施例的路由更新方法可以包括但不限于如下步骤：
S310，接收来自上一跳节点的第一报文，该第一报文携带第二节点的标识信息；
S320，当接收到路由状态变化的通告信息、且根据所述通告信息进行路由计算后确定目的节点的路由发生变化，获取所述第二节点的状态，如果所述第二节点的状态为不可达状态， 执行步骤S330；如果所述第二节点的状态为可达状态,执行步骤S340、S350；
S330，在确定所述第二节点的状态为不可达状态的情况下，根据所述路由状态变化的通告信息进行路由更新；
S340，在确定所述第二节点的状态为可达状态的情况下，启动计时，向下一跳节点发送所述第一报文，所述第一报文包括第二节点的标识信息，以使所述下一跳节点根据所述第二节点的标识信息将所述第一报文转发至所述第二节点，所述第二节点为初始路由中的倒数第二跳节点；
S350，在所述计时超时后，根据所述路由状态变化的通告信息进行路由更新。
下面结合图1所示的SRv6网络，对图4所示的实施例进行详细说明。
图1所示的SRv6网络中，PE2节点接收到来自PE1节点的第一报文，该第一报文携带有P1节点的END.SID(5001:1:1::1)信息。当PE2节点接收到路由状态变化的通告信息，并基于该通告信息进行路由计算后获知到达目的节点PE3的路由发生了变化，则PE2先判断第二节点(P1)是否可达。如果P1节点可达，则启动计时，并在计时的delay-time内，向下一跳节点P2发送上述携带有P1的END.SID信息的第一报文。计时结束后，PE2根据路由状态变化的通告信息进行路由更新。
如果P1节点不可达，PE2直接根据路由状态变化的通告信息进行路由更新。
P2节点在接收到来自PE2节点的第一报文后的处理过程，与PE2的处理过程基本类似，以将第一报文发送给第二节点P1。
请参见图5，图5示出了本申请一个实施例提供的路由更新方法的流程示意图。图5所示的路由更新方法由第二节点执行，所述第二节点为与所述通信网络中的目的节点相邻的中间节点(例如图1所示的SRv6网络中的P1节点)。如图5所示，本申请实施例的路由更新方法可以包括但不限于如下步骤：
S410，当接收到路由状态变化的通告信息、且根据所述通告信息进行路由计算后确定目的节点的路由发生变化，启动计时，所述目的节点为当前待转发的第一报文的目的节点；
S420，在所述计时未超时的情况下，根据预设的备份路由信息确定所述目的节点的备份节点，并向所述备份节点转发所述第一报文；
S430，在所述计时超时后，根据所述路由状态变化的通告信息进行路由更新。
下面结合图1所示的SRv6网络，对图5所示的实施例进行详细说明。
图1所示的SRv6网络中，P1节点接收到来自P2节点的第一报文后，进行报文的解封装，继续处理后面的SID信息，即匹配到主PE3的SRv6 Locator路由。假定P1接收到路由状态变化的通告信息，并基于该通告信息进行路由计算后获知到达PE3的路由发生了变化，PE3不可达，则P1启动计时，通过延迟路由更新来避免关联PE3的备份路由信息删除。在计时的delay-time内，将原要转发至PE3的第一报文转发至PE4节点，从而起到保留出PE节点，减少丢包的技术效果。
可以理解的是，本申请实施例提供的路由更新方法应用至图1所示的SRv6网络时，如果主PE3节点故障，则网络中的其他节点会感知到该变化，源节点PE1感知到该故障发生后，重新进行路由计算，经过计算发现此时PE3的SRv6 Locator路由不可达，但是原倒数第二跳节点P1仍旧是可达的，则延迟删除SRv6 Locator路由，表项中信息不变，则报文会继续经下游节点PE2、P2转发至P1节点。
P1节点感知到主PE3设备故障后，触发路由重新计算，由于P1节点是SRv6 Locator路由的倒数第二跳，所以其不能立即更新或者删除SRv6 Locator路由，需要等待delay-time后再删除，在此期间，经过P1节点转发至PE3的报文将根据其本地存储的备份路由信息进行转发，即将报文转发至备份节点PE4，从而实现业务的快速切换，避免业务丢包。
图6示出了本申请实施例提供的网络设备900。该网络设备900包括但不限于：
存储器910，用于存储程序；
处理器920，用于执行存储器910存储的程序，当处理器920执行存储器910存储的程序时，处理器920用于执行上述的路由更新方法。
处理器920和存储器910可以通过总线或者其他方式连接。
存储器910作为一种非暂态计算机可读存储介质，可用于存储非暂态软件程序以及非暂态性计算机可执行程序，如本申请任意实施例描述的路由更新方法。处理器920通过运行存储在存储器910中的非暂态软件程序以及指令，从而实现上述的路由更新方法。
存储器910可以包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需要的应用程序；存储数据区可存储执行上述的路由更新方法。此外，存储器910可以包括高速随机存取存储器，还可以包括非暂态存储器，比如至少一个磁盘存储器件、闪存器件、或其他非暂态固态存储器件。在一些实施方式中，存储器910可包括相对于处理器920远程设置的存储器，这些远程存储器可以通过网络连接至该处理器920。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
实现上述的路由更新方法所需的非暂态软件程序以及指令存储在存储器910中，当被一个或者多个处理器920执行时，执行本申请任意实施例提供的路由更新方法。
本申请实施例还提供了一种存储介质，存储有计算机可执行指令，计算机可执行指令用于执行上述的路由更新方法。
在一实施例中，该存储介质存储有计算机可执行指令，该计算机可执行指令被一个或多个控制处理器920执行，比如，被上述网络设备900中的一个处理器920执行，可使得上述一个或多个处理器920执行本申请任意实施例提供的路由更新方法。
本申请实施例提供的路由更新方法，当接收到路由状态变化的通告信息、且根据所述通告信息进行路由计算后确定目的节点的路由发生变化，启动计时，所述目的节点为当前待转发的第一报文的目的节点；在所述计时未超时的情况下，向下一跳节点发送所述第一报文，所述第一报文包括第二节点的标识信息，以使所述下一跳节点根据所述第二节点的标识信息将所述第一报文转发至所述第二节点，所述第二节点为初始路由中的倒数第二跳节点；在所述计时超时后，根据所述路由状态变化的通告信息进行路由更新。如此，在接收到目的节点路由状态变化的通告信息时，先启动计时以延迟路由更新，在计时的时间范围内，根据第二节点的标识信息将所述第一报文转发至初始路由中的倒数第二跳节点，以通过倒数第二跳节点将第一报文转发至目的节点的备份节点，保证业务可以按照预期保护机制进行流量的切换，从而减少流量丢包。
以上所描述的实施例仅仅是示意性的，其中作为分离部件说明的单元可以是或者也可以不是物理上分开的，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统可以被实 施为软件、固件、硬件及其适当的组合。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包括计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
以上是对本申请的若干实施方式进行了说明，但本申请并不局限于上述实施方式，熟悉本领域的技术人员在不违背本申请精神的。共享条件下还可作出种种等同的变形或替换，这些等同的变形或替换均包括在本申请权利要求所限定的范围内。

Claims (10)

  1. 一种路由更新的方法，应用于通信网络中的第一节点，所述方法包括：
    当接收到路由状态变化的通告信息、且根据所述通告信息进行路由计算后确定目的节点的路由发生变化，启动计时，所述目的节点为当前待转发的第一报文的目的节点；
    在所述计时未超时的情况下，向下一跳节点发送所述第一报文，所述第一报文包括第二节点的标识信息，以使所述下一跳节点根据所述第二节点的标识信息将所述第一报文转发至所述第二节点，所述第二节点为初始路由中的倒数第二跳节点；
    在所述计时超时后，根据所述路由状态变化的通告信息进行路由更新。
  2. 根据权利要求1所述的方法，其中，在所述启动计时之前，所述方法还包括：
    获取所述第二节点的状态，以在确定所述第二节点的状态为可达状态的情况下执行所述启动计时。
  3. 根据权利要求2所述的方法，其中，在所述获取所述第二节点的状态之后，所述方法还包括：
    在确定所述第二节点的状态为不可达状态的情况下，根据所述路由状态变化的通告信息进行路由更新。
  4. 根据权利要求1所述的方法，其中，所述第一节点为所述通信网络中的源节点或者除所述第二节点以外的中间节点。
  5. 根据权利要求4所述的方法，其中，当所述第一节点为所述通信网络中的源节点，在所述向下一跳节点发送所述第一报文之前，所述方法还包括：
    接收第二报文，所述第二报文携带目的节点的标识信息；
    根据所述目的节点的标识信息确定所述初始路由，并将所述初始路由中的倒数第二跳节点作为所述第二节点；
    根据所述第二节点的标识信息和所述第二报文，得到所述第一报文。
  6. 根据权利要求1所述的方法，其中，所述目的节点的路由发生变化包括如下任意一种：
    所述目的节点的状态为不可达状态；
    所述路由中的倒数第二跳节点发生变更。
  7. 一种路由更新的方法，应用于通信网络中的第二节点，所述第二节点为与所述通信网络中的目的节点相邻的中间节点，所述方法包括：
    当接收到路由状态变化的通告信息、且根据所述通告信息进行路由计算后确定目的节点的路由发生变化，启动计时，所述目的节点为当前待转发的第一报文的目的节点；
    在所述计时未超时的情况下，根据预设的备份路由信息确定所述目的节点的备份节点，并向所述备份节点转发所述第一报文；
    在所述计时超时后，根据所述路由状态变化的通告信息进行路由更新。
  8. 根据权利要求7所述的方法，其中，所述方法包括：所述目的节点的路由发生变化包括：所述目的节点的状态为不可达状态。
  9. 一种网络设备，包括：存储器、处理器及存储在所述存储器上并可在所述处理器上运行的计算机程序，所述处理器执行所述计算机程序时，实现如权利要求1-8任一项所述的方法。
  10. 一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时，实现如权利要求1-8任一项所述的方法。
PCT/CN2022/115923 2021-12-23 2022-08-30 路由更新方法、网络设备和计算机可读存储介质 WO2023116034A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111587486.X 2021-12-23
CN202111587486.XA CN116346708A (zh) 2021-12-23 2021-12-23 路由更新方法、网络设备和计算机可读存储介质

Publications (1)

Publication Number Publication Date
WO2023116034A1 true WO2023116034A1 (zh) 2023-06-29

Family

ID=86879304

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/115923 WO2023116034A1 (zh) 2021-12-23 2022-08-30 路由更新方法、网络设备和计算机可读存储介质

Country Status (2)

Country Link
CN (1) CN116346708A (zh)
WO (1) WO2023116034A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110164494A1 (en) * 2010-01-07 2011-07-07 Samsung Electronics Co., Ltd. Method for operating a virtual router redundancy protocol router and communication system therefor
CN108924044A (zh) * 2018-06-22 2018-11-30 迈普通信技术股份有限公司 链路维持方法、pe设备及可读存储介质
CN110661706A (zh) * 2018-06-30 2020-01-07 华为技术有限公司 一种传输路径故障的处理方法、装置及系统
CN111817881A (zh) * 2020-06-19 2020-10-23 新华三信息安全技术有限公司 一种故障处理方法和相关装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110164494A1 (en) * 2010-01-07 2011-07-07 Samsung Electronics Co., Ltd. Method for operating a virtual router redundancy protocol router and communication system therefor
CN108924044A (zh) * 2018-06-22 2018-11-30 迈普通信技术股份有限公司 链路维持方法、pe设备及可读存储介质
CN110661706A (zh) * 2018-06-30 2020-01-07 华为技术有限公司 一种传输路径故障的处理方法、装置及系统
CN111817881A (zh) * 2020-06-19 2020-10-23 新华三信息安全技术有限公司 一种故障处理方法和相关装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Z. HU HUAWEI H. CHEN FUTUREWEI H. CHEN CHINA TELECOM P. WU HUAWEI M. TOY VERIZON C. CAO T. HE CHINA UNICOM L. LIU FUJITSU X. LIU V: "SRv6 Path Egress Protection draft-ietf-rtgwg-srv6-egress-protection-04; draft-ietf-rtgwg-srv6-egress-protection-04.txt", SRV6 PATH EGRESS PROTECTION DRAFT-IETF-RTGWG-SRV6-EGRESS-PROTECTION-04; DRAFT-IETF-RTGWG-SRV6-EGRESS-PROTECTION-04.TXT; INTERNET-DRAFT: NETWORK WORKING GROUP, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOCIETY (ISOC) 4, RUE, no. 04, 17 October 2021 (2021-10-17), Internet Society (ISOC) 4, rue des Falaises CH- 1205 Geneva, Switzerland, pages 1 - 19, XP015148254 *

Also Published As

Publication number Publication date
CN116346708A (zh) 2023-06-27

Similar Documents

Publication Publication Date Title
WO2019228209A1 (zh) 报文转发的方法、装置和节点
US8599685B2 (en) Snooping of on-path IP reservation protocols for layer 2 nodes
US9276898B2 (en) Method and device for link fault detecting and recovering based on ARP interaction
US7983153B2 (en) Fast reroute (FRR) protection at the edge of a RFC 2547 network
US7693047B2 (en) System and method for PE-node protection
EP2421206B1 (en) Flooding-based routing protocol having database pruning and rate-controlled state refresh
US7778204B2 (en) Automatic maintenance of a distributed source tree (DST) network
US11611509B2 (en) Communication method, communications device, and communications system
JP5168230B2 (ja) 通信システム、エッジルータ及び信号転送方法
US20130089094A1 (en) Method and Apparatus for Dissemination of Information Between Routers
JP5625121B2 (ja) ルーティング情報更新の優先順位付け
CA3104756C (en) Loop avoidance communications method, device, and system
EP3767898A1 (en) Packet forwarding method and apparatus
US12003412B2 (en) Method and apparatus for processing link state information
JP2006191636A (ja) ネットワークルーティング制御方法及びその装置
WO2023116034A1 (zh) 路由更新方法、网络设备和计算机可读存储介质
CN113810275B (zh) 发送报文的方法及设备
CN106878173B (zh) 一种路由发送方法及装置
US20200145326A1 (en) Path data deletion method, message forwarding method, and apparatus
US12034631B2 (en) Loop avoidance communications method, device, and system
US20220123994A1 (en) System and Method for Abstracting an IGP Zone
WO2023098703A1 (zh) 路径通告方法、拓扑算法组合生成方法、路径计算方法、数据传输方法、电子设备和计算机可读存储介质
WO2022127284A1 (zh) 信息处理方法、节点及计算机可读存储介质
CN115766414A (zh) 基于mlag双归接入evpn的流量转发方法及装置

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

Country of ref document: EP

Kind code of ref document: A1