WO2021115162A1 - Procédé de protection de lien, dispositif, nœud d'entrée et support de stockage - Google Patents

Procédé de protection de lien, dispositif, nœud d'entrée et support de stockage Download PDF

Info

Publication number
WO2021115162A1
WO2021115162A1 PCT/CN2020/133139 CN2020133139W WO2021115162A1 WO 2021115162 A1 WO2021115162 A1 WO 2021115162A1 CN 2020133139 W CN2020133139 W CN 2020133139W WO 2021115162 A1 WO2021115162 A1 WO 2021115162A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
value
forwarding
state table
state
Prior art date
Application number
PCT/CN2020/133139
Other languages
English (en)
Chinese (zh)
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 WO2021115162A1 publication Critical patent/WO2021115162A1/fr

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
    • 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/46—Interconnection of networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
    • 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
    • H04L45/06—Deflection routing, e.g. hot-potato 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/28—Routing or path finding of packets in data switching networks using route fault recovery
    • 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/34—Source 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]

Definitions

  • This application relates to a wireless communication network, for example, to a link protection method, device, ingress node, and storage medium.
  • Segment Routing is a protocol designed based on the concept of source routing to forward data packets on the network. It can control the real-time fast forwarding of data by specifying a set of ordered instruction lists at the ingress node. It is widely used in current communication systems. As the requirements for ultra-large bandwidth and ultra-low delay in communication systems become more and more stringent, how to ensure the stability of SR tunnels has become the current focus of discussion.
  • the present application provides a link protection method, device, ingress node, and storage medium, which can realize multi-level carrier-grade performance protection of the link, and ensure the stability and timeliness of the system.
  • the embodiment of the application provides a link protection method, including: confirming the state value in the first forwarding state table; if the state value in the first forwarding state table is the first invalid value, confirming the state value in the second forwarding state table Status value, the first invalid value indicates that the first path has failed; if the status value in the second forwarding status table is the second invalid value, the data is sent through the third path or the fourth path, and the second invalid value indicates the second path
  • the second path is the backup path of the first path;
  • the third path and the fourth path are the backup paths of the second path, and the first path, the second path, the third path, and the fourth path are all segmented routes -The label forwarding path LSP of the traffic engineering SR-TE tunnel.
  • the embodiment of the present application provides a link protection device, including: a confirmation module and a sending module; the confirmation module is set to confirm the state value in the first forwarding state table; if the state value in the first forwarding state table is first invalid Value, the state value in the second forwarding state table is confirmed. The first invalid value indicates that the first path has failed; the sending module is set to pass the third invalid value if the state value in the second forwarding state table is the second invalid value.
  • the path or the fourth path sends data, the second invalid value indicates that the second path has failed, and the second path is the backup path of the first path; the third path and the fourth path are both backup paths of the second path, and the first path,
  • the second path, the third path, and the fourth path are all segment routing-traffic engineering SR-TE tunnel label forwarding path LSPs.
  • An embodiment of the present application provides an entry node including a processor, and the processor is configured to implement the method of any one of the foregoing embodiments when a computer program is executed.
  • the embodiments of the present application also provide a computer-readable storage medium that stores a computer program, and when the computer program is executed by a processor, the method of any of the foregoing embodiments is implemented.
  • FIG. 1 is a schematic diagram of data forwarding in an SR-TE tunnel provided by an embodiment of the application
  • FIG. 2 is a schematic diagram of an SR-TE primary path and a backup path provided by an embodiment of this application;
  • FIG. 3 is a schematic diagram of a link protection group provided by an embodiment of this application.
  • FIG. 4 is a schematic flowchart of a link protection method based on the link networking shown in FIG. 3 according to an embodiment of the application;
  • FIG. 5 is a schematic flowchart of another link protection method based on the link networking shown in FIG. 3 according to an embodiment of the application;
  • FIG. 6 is a schematic diagram of a link networking provided by an embodiment of the application.
  • FIG. 7 is a schematic structural diagram of a link protection device provided by an embodiment of this application.
  • FIG. 8 is a schematic structural diagram of another link protection device provided by an embodiment of this application.
  • FIG. 9 is a schematic structural diagram of an ingress node provided by an embodiment of this application.
  • the bearer network needs to provide a transmission channel with ultra-large bandwidth and ultra-low latency.
  • the use of SR forwarding technology can reduce the complexity of network connections and make the service path easier to maintain. Supports flexible scheduling under massive 5G network connections.
  • the SR forwarding technology is widely used by operators as one of the necessary technologies for software-defined network (Software-Defined Network, SDN) deployment.
  • Segment Routing-Traffic Engineering (SR-TE) tunnel is a new type of TE tunnel technology that uses SR as a control protocol.
  • SR-TE refers to a tunnel created using the SR protocol based on the constraint attributes of TE.
  • the controller is responsible for calculating the forwarding path of the tunnel, and delivering the label stack strictly corresponding to the path to the forwarder.
  • the repeater can control the transmission path of data in the network according to the label stack.
  • Fig. 1 is a schematic diagram of data forwarding in an SR-TE tunnel according to an embodiment.
  • the ingress node is node 0, the egress node is node 5, and node 1, node 2, node 3, and node 4 are intermediate nodes.
  • the forwarding path calculated by the controller is (30001, 30102, 30204, 30405), where 3 is the prefix of the tunnel, 1.1.1.5 is the Internet Protocol (IP) address, and 30001 represents the data slave node 0 Sent to node 1, 30102 represents data sent from node 1 to node 2, 30204 represents data sent from node 2 to node 4, and 30405 represents data sent from node 4 to node 5.
  • IP Internet Protocol
  • the forwarding path is strictly formulated by the controller according to the needs, and different transmission channels are allocated through reasonable planning of services, so as to realize the efficient use of bandwidth resources and the simplified management of network connections.
  • FIG. 2 is a schematic diagram of an SR-TE primary path and a backup path according to an embodiment.
  • the ingress node is node 0, the egress node is node 2, and node 1, node 3, node 4, and node 5 are intermediate nodes.
  • the main path is the path from node 0 to node 1 to node 2
  • the backup path It is the path from node 0 to node 3 to node 4 to node 5 to node 2.
  • the embodiments of the present application provide a mobile communication network (including but not limited to the fifth-generation mobile communication network (5th-Generation, 5G)).
  • the network architecture of the network may include core network equipment (for example, Unified Data Management (Unified Data Management)). , UDM equipment), network-side equipment (such as one or more types of base stations, transmission nodes, access points (Access Point, AP), relays, Node B (NB), terrestrial radio access ( Universal Terrestrial Radio Access (UTRA), Evolved Terrestrial Radio Access (Evolved Universal Terrestrial Radio Access, EUTRA, etc.) and terminal equipment (User Equipment (UE), user equipment data card, relay, mobile Equipment, etc.).
  • core network equipment for example, Unified Data Management (Unified Data Management)
  • UDM equipment network-side equipment
  • network-side equipment such as one or more types of base stations, transmission nodes, access points (Access Point, AP), relays, Node B (NB), terrestrial radio access ( Universal Terrestrial Radio Access (UTRA), Evol
  • a link protection method, device, ingress node, and storage medium that can run on the above-mentioned network architecture are provided, which can realize multi-level carrier-level performance protection of the link, and ensure the stability and stability of the system. Timeliness.
  • the operating environment of the foregoing link protection method provided in the embodiments of the present application is not limited to the foregoing network architecture.
  • system and "network” in this application are often used interchangeably in this application.
  • the following embodiments of the present application can be implemented individually, and the various embodiments can also be implemented in combination with each other, which is not specifically limited by the embodiments of the present application.
  • Fig. 3 is a schematic diagram of a link protection group provided by an embodiment.
  • the link networking includes at least four paths.
  • four paths are taken as an example.
  • the four paths are the first path, the second path, the third path, and the fourth path.
  • the first path and the second path constitute the first protection group 1
  • the second path is the backup path of the first path
  • the second path, the third path, and the fourth path constitute the second protection group 2
  • the third path and the fourth path The four paths are all backup paths of the second path.
  • the third path and the fourth path may also form the second protection group 3, and the fourth path is a backup path of the third path.
  • the data bearer priority of the first protection group 1 is higher than the data bearer priority of the second protection group 2
  • the data bearer priority of the second protection group 2 is higher than the data bearer priority of the third protection group 3.
  • FIG. 4 is a schematic flowchart of a link protection method based on the link networking shown in FIG. 3 according to an embodiment. As shown in FIG. 4, the method provided in this embodiment is applicable to ingress nodes, and the method includes the following steps .
  • Data sent through the SR-TE tunnel goes to the first protection group 1 by default, and the ingress node first needs to confirm whether the current data is sent on the first path or the second path. That is, the ingress node confirms the state value in the first forwarding state table of the first protection group 1.
  • the state value in the first forwarding state table is the first valid value
  • the first valid value indicates that the first path has not failed
  • the data By default, the data is sent on the first path
  • the state value in the first forwarding state table is the first invalid value
  • the first invalid value indicates that the first path has failed
  • the data is sent on the second path by default.
  • the first path is the main path
  • the second path is the backup path.
  • the state value in the first forwarding state table defaults to the first valid value, and the ingress node can detect the first path according to the fast link detection technology; if the first path fails, the first forwarding The state value in the state table is switched from the first valid value to the first invalid value.
  • the first valid value is usually 0, that is, when the first valid value is 0, it means that the first path is not faulty; the first invalid value is usually 1, that is, when the first invalid value is 1, it means that the first path is faulty.
  • the values of the first valid value and the first invalid value can be set according to actual conditions.
  • the first valid value can also be set to 1, that is, when the first valid value is 1, it means that the first path has failed. A failure occurs; the first invalid value is 0, that is, when the first invalid value is 0, it means that the first path has a failure.
  • the fast link detection technology can be, but is not limited to, Bidirectional Forwarding Detection (BFD) technology or Seamless Bidirectional Forwarding Detection (SBFD) technology, such as label forwarding path-bidirectional forwarding detection (Label Switching Path-Bidirectional Forwarding Detection, LSP-BFD) technology or Traffic Engineering-Bidirectional Forwarding Detection (Traffic Engineering-Bidirectional Forwarding Detection, TE-BFD) technology.
  • BFD Bidirectional Forwarding Detection
  • SBFD Seamless Bidirectional Forwarding Detection
  • LSP-BFD Label Switching Path-Bidirectional Forwarding Detection
  • Traffic Engineering-Bidirectional Forwarding Detection Traffic Engineering-Bidirectional Forwarding Detection
  • the LSP-BFD technology can be used to detect whether the LSP path fails.
  • the LSP-BFD technology sends detection messages periodically. If a reply message to the detection message is not received after a certain number of times the detection message is sent, it is considered that the detection path is faulty.
  • TE-BFD technology can be used to detect whether a TE path fails.
  • TE-BFD technology can include BFD for TE Tunnel and BFD for TE CR-LSP.
  • BFD detects the connectivity of a data protocol (data protocol) on the same path between two systems , This path can be a physical link or a logical link, including TE tunnels.
  • SBFD technology is a simplified mechanism of BFD technology. SBFD simplifies the state machine of BFD, shortens the negotiation time, improves the flexibility of the entire network, and can support SR tunnel detection.
  • SBFD technology is applied to SR scenario detection, there are mainly two scenarios, SBFD for SR LSP and SBFD for SR-TE LSP.
  • SBFD for SR LSP there are mainly two scenarios, SBFD for SR LSP and SBFD for SR-TE LSP.
  • the path from the SBFD initiator to the reflector uses Multi-Protocol Label Switching (MPLS) label forwarding, and the reflector uses a multi-hop IP path toward the return path of the initiator.
  • MPLS Multi-Protocol Label Switching
  • the second protection group 2 After the first path fails, the second protection group 2 is taken, and the ingress node needs to confirm whether the current data is sent on the second path, or on the third path or the fourth path. That is, the ingress node confirms the state value in the second forwarding state table of the second protection group 2.
  • the state value in the second forwarding state table is the second valid value
  • the second valid value indicates that the second path has not failed, and the data
  • the data is sent on the second path;
  • the state value in the second forwarding state table is the second invalid value
  • the second invalid value indicates that the second path fails, and the data is sent on the third path or the fourth path by default.
  • the second path is a backup path
  • the third path and the fourth path are backup paths of the backup path (for ease of distinction, hereinafter referred to as sub-backup paths).
  • the state value in the second forwarding state table defaults to the second valid value, and the ingress node can detect the second path according to the fast link detection technology; if the second path fails, the second forwarding The status value in the status table is switched from the second valid value to the second invalid value.
  • the second valid value is usually 0, that is, when the second valid value is 0, it means that the second path is not faulty; the second invalid value is usually 1, that is, when the second invalid value is 1, it means that the second path is faulty.
  • the values of the second effective value and the second invalid value can be set according to actual conditions.
  • the second effective value can also be set to 1, that is, when the second effective value is 1, it means that the second path has failed. A failure occurs; the second invalid value is 0, that is, when the second invalid value is 0, it means that the second path has a failure.
  • the state value in the second forwarding state table is the second invalid value, send the data through the third path or the fourth path.
  • the second invalid value indicates that the second path has failed, and the second path is a backup of the first path.
  • Path; the third path and the fourth path are the backup paths of the second path, the first path, the second path, the third path, and the fourth path are all segment routing-traffic engineering SR-TE tunnel label forwarding paths ( Label Switching Path, LSP).
  • the ingress node selects any path from the third path or the fourth path to send data, thereby forming a three-level carrier-grade performance protection for the link.
  • FIG. 5 is a schematic flowchart of another link protection method based on the link networking shown in FIG. 3 provided by an embodiment, in which how the ingress node moves from the third path or the fourth path Selecting a path to send data is described in Figure 5.
  • the method provided in this embodiment is applicable to an ingress node, and the method includes the following steps.
  • Data sent through the SR-TE tunnel goes to the first protection group 1 by default, and the ingress node first needs to confirm whether the current data is sent on the first path or the second path.
  • the first path is the main path
  • the second path is the backup path.
  • S220 If the state value in the first forwarding state table is the first valid value, send the data through the first path.
  • the first valid value indicates that the first path has not failed.
  • the second protection group 2 is taken, and the ingress node needs to confirm whether the current data is sent on the second path, or on the third path or the fourth path.
  • the second path is a backup path
  • the third path and the fourth path are sub-backup paths.
  • the second valid value indicates that the second path has not failed.
  • the ingress node can set priorities for the third path and the fourth path, so that the priority of the third path is higher than the priority of the fourth path, that is, the fourth path is the backup path of the third path, and in principle, the ingress node prefers the first path Three paths send data. Therefore, the third path may be referred to as the preferred sub-backup path, and the fourth path may be referred to as the second-selected sub-backup path.
  • the ingress node needs to confirm the state value in the third forwarding state table of the third protection group 3.
  • the state value in the third forwarding state table is the third valid value
  • the third is valid The value indicates that the third path has not failed and the data is sent on the third path;
  • the state value in the third forwarding state table is the third invalid value
  • the third invalid value indicates that the third path has failed, and the data is on the fourth path Send on.
  • the state value in the third forwarding state table defaults to the third valid value, and the ingress node can detect the third path according to the fast link detection technology; if the third path fails, the third forwarding The status value in the status table is switched from the third valid value to the third invalid value.
  • the third valid value is usually 0, that is, when the third valid value is 0, it means that the third path is not faulty; the third invalid value is usually 1, that is, when the third invalid value is 1, it means that the third path is faulty.
  • the values of the third effective value and the third invalid value can be set according to the actual situation.
  • the third effective value can also be set to 1, that is, when the third effective value is 1, it means that the third path has failed. A failure occurs; the third invalid value is 0, that is, when the third invalid value is 0, it means that the third path has a failure.
  • the multi-level protection group is reasonably designed, and when the link has multiple points of failure, the state value in the forwarding state table is directly switched, which greatly reduces the computing occupancy of the device when the physical link state changes Time allows the device to have more time to process other services, which effectively guarantees the performance requirements of upper-level services. In this way, the multi-level carrier-level performance protection of the link is realized, and the stability and timeliness of the system are ensured.
  • FIG. 6 is a schematic diagram of link networking provided by an embodiment.
  • the ingress node is node S
  • the egress node is node D
  • node A, node B, node C, node E, and node F are other nodes.
  • the main path is node S-node A-node B-node D (hereinafter referred to as SABD)
  • the backup path is node S-node D (hereinafter referred to as SD)
  • the preferred sub-backup path is node S-node B-node D (Hereinafter referred to as SBD)
  • the secondary backup path is node S-node A-node D (hereinafter referred to as SAD).
  • the embodiment of the application provides a link protection method, including: confirming the state value in the first forwarding state table; if the state value in the first forwarding state table is the first invalid value, confirming the state value in the second forwarding state table Status value, the first invalid value indicates that the first path has failed; if the status value in the second forwarding status table is the second invalid value, the data is sent through the third path or the fourth path, and the second invalid value indicates the second path
  • the second path is the backup path of the first path; the third path and the fourth path are the backup paths of the second path, and the first path, the second path, the third path, and the fourth path are all SR-TE LSP of the tunnel.
  • the application can realize multi-level carrier-level performance protection of the link, which ensures the stability and timeliness of the system.
  • FIG. 7 is a schematic structural diagram of a link protection device provided by an embodiment.
  • the link protection device may be configured in an ingress node. As shown in FIG. 7, it includes: a confirmation module 10 and a sending module 11.
  • the confirming module 10 is configured to confirm the state value in the first forwarding state table; if the state value in the first forwarding state table is the first invalid value, confirm the state value in the second forwarding state table, and the first invalid value indicates The first path fails;
  • the sending module 11 is configured to send data through the third path or the fourth path if the state value in the second forwarding state table is the second invalid value.
  • the second invalid value indicates that the second path has failed, and the second path is the first
  • the backup path of the first path; the third path and the fourth path are the backup paths of the second path, and the first path, the second path, the third path, and the fourth path are all segment routing-traffic engineering SR-TE tunnels Label forwarding path LSP.
  • the link protection device provided in this embodiment implements the link protection method of the foregoing embodiment.
  • the implementation principle and technical effect of the link protection device provided in this embodiment are similar, and will not be repeated here.
  • FIG. 8 is a schematic structural diagram of another link protection device provided by an embodiment, and further includes: a detection module 12 and a switching module 13.
  • the detection module 12 is configured to detect whether the first path fails according to the link detection technology
  • the switching module 13 is configured to switch the state value in the first forwarding state table from the first valid value to the first invalid value if the first path fails, and the first valid value indicates that the first path does not fail.
  • the detection module 12 is further configured to detect whether the second path fails according to the link detection technology
  • the switching module 13 is further configured to switch the state value in the second forwarding state table from the second valid value to the second invalid value if the second path fails, and the second valid value indicates that the second path does not fail.
  • the confirmation module 10 is further configured to confirm that the priority of the third path is higher than the priority of the fourth path; and confirm the state value in the third forwarding state table;
  • the sending module 11 is further configured to select the third path to send data if the state value in the third forwarding state table is the third valid value, and the third valid value indicates that the third path is not faulty; if the state value in the third forwarding state table If the status value of is the third invalid value, the fourth path is selected to send data, and the third invalid value indicates that the third path has failed.
  • the detection module 12 is further configured to detect whether the third path fails according to the link detection technology
  • the switching module 13 is further configured to switch the state value in the third forwarding state table from the third valid value to the third invalid value if the third path fails.
  • the sending module 11 is further configured to send data through the first path if the state value in the first forwarding state table is the first valid value.
  • the sending module 11 is further configured to send data through the second path if the state value in the second forwarding state table is the second valid value.
  • FIG. 9 is a schematic structural diagram of an entry node provided by an embodiment.
  • the entry node includes a processor 60, a memory 61 and a communication interface 62; the number of processors 60 in the entry node may be one or more.
  • a processor 60 is taken as an example in FIG. 9; the processor 60, the memory 61, and the communication interface 62 in the ingress node may be connected by a bus or other methods.
  • the bus represents one or more of several types of bus structures, including a memory bus or a memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any bus structure among multiple bus structures.
  • the memory 61 can be configured to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the methods in the embodiments of the present application.
  • the processor 60 executes at least one functional application and data processing of the entry node by running the software programs, instructions, and modules stored in the memory 61, that is, realizes the above-mentioned link protection method.
  • the memory 61 may include a program storage area and a data storage area, where 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 data created according to the use of the entry node, and the like.
  • the memory 61 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices.
  • the memory 61 may include a memory remotely provided with respect to the processor 60, and these remote memories may be connected to a Japanese invader node through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.
  • the communication interface 62 can be configured to receive and send data.
  • the embodiment of the present application also provides a computer-readable storage medium, and a computer program is stored on the computer-readable storage medium.
  • a computer program is stored on the computer-readable storage medium.
  • the computer storage medium of the embodiment of the present application may adopt any combination of one or more computer-readable media.
  • the computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium.
  • the computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or a combination of any of the above.
  • Computer-readable storage media include (non-exhaustive list): electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (Read-Only Memory) , ROM), Erasable Programmable Read-Only Memory (EPROM), flash memory, optical fiber, compact Disc Read-Only Memory (CD-ROM), optical storage devices , Magnetic storage devices, or any suitable combination of the above.
  • the computer-readable storage medium may be any tangible medium that contains or stores a program, and the program may be used by or in combination with an instruction execution system, apparatus, or device.
  • the computer-readable signal medium may include a data signal propagated in baseband or as a part of a carrier wave, and the computer-readable program code is carried in the data signal. This propagated data signal can take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • the computer-readable signal medium may also be any computer-readable medium other than the computer-readable storage medium, and the computer-readable medium may send, propagate, or transmit the program for use by or in combination with the instruction execution system, apparatus, or device .
  • the program code contained on the computer-readable medium can be transmitted by any suitable medium, including but not limited to wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the foregoing.
  • suitable medium including but not limited to wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the foregoing.
  • the computer program code used to perform the operations of the present disclosure can be written in one or more programming languages or a combination of multiple programming languages.
  • the programming languages include object-oriented programming languages-such as Java, Smalltalk, C++, Ruby, Go also includes conventional procedural programming languages-such as "C" language or similar programming languages.
  • the program code can be executed entirely on the user's computer, partly on the user's computer, executed as an independent software package, partly on the user's computer and partly executed on a remote computer, or entirely executed on the remote computer or server.
  • the remote computer can be connected to the user's computer through any kind of network-including Local Area Network (LAN) or Wide Area Network (WAN)-or it can be connected to an external computer (for example, use an Internet service provider to connect via the Internet).
  • LAN Local Area Network
  • WAN Wide Area Network
  • user terminal encompasses any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser, or a vehicle-mounted mobile station.
  • the various embodiments of the present application can be implemented in hardware or dedicated circuits, software, logic or any combination thereof.
  • some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that may be executed by a controller, microprocessor, or other computing device, although the present application is not limited thereto.
  • Computer program instructions can be assembly instructions, Instruction Set Architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, state setting data, or a source written in any combination of one or more programming languages Code or object code.
  • ISA Instruction Set Architecture
  • the block diagram of any logic flow in the drawings of the present application may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions.
  • the computer program can be stored on the memory.
  • the memory can be of any type suitable for the local technical environment and can be implemented using any suitable data storage technology, such as but not limited to read only memory (ROM), random access memory (RAM), optical storage devices and systems (digital multi-function optical discs) (Digital Versatile Disc, DVD) or compact disc (Compact Disc, CD), etc.
  • Computer-readable media may include non-transitory storage media.
  • the data processor can be any type suitable for the local technical environment, such as but not limited to general-purpose computers, special-purpose computers, microprocessors, digital signal processors (Digital Signal Processing, DSP), application specific integrated circuits (ASICs) ), programmable logic devices (Field-Programmable Gate Array, FGPA), and processors based on multi-core processor architecture.
  • DSP Digital Signal Processing
  • ASICs application specific integrated circuits
  • FGPA programmable logic devices

Landscapes

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

Abstract

La présente demande divulgue un procédé de protection de lien, un dispositif, un nœud d'entrée et un support de stockage. Ledit procédé consiste : à confirmer une valeur d'état dans une première table d'état de transfert ; si la valeur d'état dans la première table d'état de transfert est une première valeur invalide, à confirmer une valeur d'état dans une seconde table d'état de transfert, la première valeur invalide indiquant qu'une erreur se produit sur un premier chemin ; et si la valeur d'état dans la seconde table d'état de transfert est une seconde valeur invalide, à envoyer des données au moyen d'un troisième chemin ou d'un quatrième chemin, la seconde valeur invalide indiquant qu'une erreur se produit sur un deuxième chemin, le deuxième chemin servant de chemin de secours au premier chemin, le troisième chemin et le quatrième chemin servant tous deux de chemins de secours au deuxième chemin, et le premier chemin, le deuxième chemin, le troisième chemin et le quatrième chemin étant tous des chemins à commutation d'étiquette (LSP) d'un tunnel d'ingénierie de trafic de routage de segments (SR-TE).
PCT/CN2020/133139 2019-12-13 2020-12-01 Procédé de protection de lien, dispositif, nœud d'entrée et support de stockage WO2021115162A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201911284848.0 2019-12-13
CN201911284848.0A CN112995026A (zh) 2019-12-13 2019-12-13 一种链路保护方法、装置，入口节点及存储介质

Publications (1)

Publication Number Publication Date
WO2021115162A1 true WO2021115162A1 (fr) 2021-06-17

Family

ID=76329436

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/133139 WO2021115162A1 (fr) 2019-12-13 2020-12-01 Procédé de protection de lien, dispositif, nœud d'entrée et support de stockage

Country Status (2)

Country Link
CN (1) CN112995026A (fr)
WO (1) WO2021115162A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN118338264A (zh) * 2024-06-17 2024-07-12 成都赛力斯科技有限公司 一种数据转发方法、装置、车载设备及车辆

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101060497A (zh) * 2007-06-11 2007-10-24 杭州华三通信技术有限公司 一种流量工程隧道的建立方法和装置
CN101552715A (zh) * 2008-03-31 2009-10-07 华为技术有限公司 一种建立备份标签交换路径的方法及节点和系统
CN102035681A (zh) * 2010-12-17 2011-04-27 中兴通讯股份有限公司 虚拟专用网络的链路保护方法和系统
US20150326505A1 (en) * 2014-05-06 2015-11-12 Lenovo Enterprise Solutions (Singapore) Pte. Ltd. Logical switch architecture for network virtualization
CN107306197A (zh) * 2016-04-20 2017-10-31 中兴通讯股份有限公司 一种隧道保护的方法及装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100428778B1 (ko) * 2002-02-20 2004-04-28 삼성전자주식회사 다중 프로토콜 레이블 교환 시스템에서의 씨알-엘에스피의경로 보호 방법 및 이를 위한 기록매체
CN102740175B (zh) * 2012-06-12 2014-09-24 武汉邮电科学研究院 一种跨域端到端标签交换路径的保护恢复方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101060497A (zh) * 2007-06-11 2007-10-24 杭州华三通信技术有限公司 一种流量工程隧道的建立方法和装置
CN101552715A (zh) * 2008-03-31 2009-10-07 华为技术有限公司 一种建立备份标签交换路径的方法及节点和系统
CN102035681A (zh) * 2010-12-17 2011-04-27 中兴通讯股份有限公司 虚拟专用网络的链路保护方法和系统
US20150326505A1 (en) * 2014-05-06 2015-11-12 Lenovo Enterprise Solutions (Singapore) Pte. Ltd. Logical switch architecture for network virtualization
CN107306197A (zh) * 2016-04-20 2017-10-31 中兴通讯股份有限公司 一种隧道保护的方法及装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN118338264A (zh) * 2024-06-17 2024-07-12 成都赛力斯科技有限公司 一种数据转发方法、装置、车载设备及车辆
CN118338264B (zh) * 2024-06-17 2024-08-20 成都赛力斯科技有限公司 一种数据转发方法、装置、车载设备及车辆

Also Published As

Publication number Publication date
CN112995026A (zh) 2021-06-18

Similar Documents

Publication Publication Date Title
EP3591912B1 (fr) Procédé, dispositif et système de traitement de paquets evpn
US10587494B2 (en) Network control method and apparatus
US20240172035A1 (en) Integrated Backhaul Transport for 5Gs
WO2021258823A1 (fr) Procédé, appareil et système de création de chemin
KR20220152243A (ko) 데이터 패킷 전송 방법 및 장치, 통신 노드, 그리고 저장 매체
WO2021109997A1 (fr) Procédé et dispositif anti-rupture de fibre pour tunnel de routage de segment, nœud d'entrée et support de données
JP2017516424A (ja) 第５世代移動ネットワークにおけるオンデマンドネットワークサービス
WO2021057962A1 (fr) Procédé, appareil et système de configuration de tunnel, ainsi que dispositif et support de stockage
WO2021004156A1 (fr) Procédé de transfert de paquet, dispositif, et support de stockage lisible par ordinateur
EP3713160B1 (fr) Procédé et appareil de transmission de paquet
EP3949270A1 (fr) Commande de fonction de plan utilisateur locale
CN114448877B (zh) 路径切换方法、设备及系统
EP3029883B1 (fr) Procédé et appareil de protection de réseau, noeud d'anneau suivant et système
JP2021534669A (ja) パケット処理方法およびゲートウェイ・デバイス
JP2022068125A (ja) トラフィックフォワーディングを制御するための方法、装置及びシステム
WO2013013642A1 (fr) Procédé de traitement de service inter-anneaux et nœud de croisement
KR20140124116A (ko) 이동 통신 네트워크에서 데이터-패스를 최적화시키는 장치 및 방법
WO2021115162A1 (fr) Procédé de protection de lien, dispositif, nœud d'entrée et support de stockage
US11979310B2 (en) Signal translation and protection in a hybrid network environment
EP3537671B1 (fr) Procédé, système de commutation de protection et noeuds
EP4329374A1 (fr) Procédé de traitement de communication et dispositif associé
WO2021077972A1 (fr) Procédé de transfert de paquet, dispositif, et support de stockage
CN112104539B (zh) 分段ngmvpn中的信息交互方法、装置和系统
US11323365B2 (en) Tearing down a label switched path through a communications network
CN118283539A (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: 20900047

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20900047

Country of ref document: EP

Kind code of ref document: A1