CN115484204A

CN115484204A - Network fault recovery method, device, system, electronic equipment and storage medium

Info

Publication number: CN115484204A
Application number: CN202211124898.4A
Authority: CN
Inventors: 李佳聪; 吕航; 雷波
Original assignee: China Telecom Corp Ltd
Current assignee: China Telecom Corp Ltd
Priority date: 2022-09-15
Filing date: 2022-09-15
Publication date: 2022-12-16

Abstract

The disclosure provides a network fault recovery method, device, system, electronic equipment and computer readable storage medium, and relates to the field of network technology and security technology. The method comprises the following steps: the transmission node receives the data packet, matches the destination address in the data packet with the SID, acquires behavior information corresponding to the SID matched with the destination address, determines a new destination address according to the behavior information, judges whether the new destination address can be reached, if not, analyzes the TLV field, acquires backup transmission node address information corresponding to the protected transmission node, updates the backup transmission node address information into a new destination address, and transmits the data packet according to the new destination address. The embodiment of the invention can save resources, efficiently recover network faults and ensure the reliability of network operation.

Description

Network fault recovery method, device, system, electronic equipment and storage medium

Technical Field

The present disclosure relates to the field of network technologies and security technologies, and in particular, to a method, an apparatus, a system, an electronic device, and a computer-readable storage medium for recovering a network failure.

Background

In a conventional IP network, a link failure or a node failure may cause a sudden interruption of traffic, thereby affecting the user experience. The common failure recovery method needs a router to recalculate a route after detecting a link or node failure, and provides a recovery path, wherein the whole process needs several seconds and is not suitable for a service sensitive to time delay; the backup path calculated in advance is stored in the upstream node of the protected node, and once the protected node fails, the upstream node immediately starts the backup path.

It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.

Disclosure of Invention

The present disclosure provides a network failure recovery method, apparatus, system, electronic device, and computer-readable storage medium, which overcome, at least to some extent, the problem of low network failure recovery efficiency in the related art.

Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.

According to an aspect of the present disclosure, there is provided a network failure recovery method applied to a transmission node, including:

receiving a data packet, matching a destination address in the data packet with a segment identifier SID, determining a new destination address, and judging whether the new destination address is reachable;

if not, analyzing the TLV field of the type length value to acquire backup transmission node address information corresponding to the protected transmission node, updating the backup transmission node address information into the new destination address, and transmitting the data packet according to the new destination address.

In an embodiment of the present disclosure, determining a new destination address if the destination address in the data packet is matched with the segment identifier SID, and determining whether the new destination address is reachable includes:

receiving a data packet, matching a destination address in the data packet with a segment identifier SID, and acquiring behavior information corresponding to the SID;

determining a new destination address according to the behavior information;

and judging whether the new destination address is reachable.

In one embodiment of the disclosure, the TLV field includes protected transit node address information and the backup transit node address information.

In an embodiment of the present disclosure, the segment list includes a plurality of SIDs, and each of the SIDs includes a location identifier, the behavior information, and a backup path processing parameter.

In an embodiment of the present disclosure, the determining whether the new destination address is reachable includes:

and judging whether the new destination address is reachable according to the position identification, wherein the position identification comprises a network address prefix of the transmission node.

In one embodiment of the present disclosure, the behavior information includes at least one of:

the transmission node does not process the data packet;

checking whether the new destination address can be reached, if so, forwarding normally, otherwise, analyzing the data packet to acquire backup transmission node address information;

and checking whether the new destination address can be reached, if so, forwarding normally, and otherwise, analyzing the data packet and selecting backup transmission node address information through the backup path processing parameters.

In one embodiment of the present disclosure, further comprising:

and when the new destination address is judged to be reachable, transmitting the data packet according to the new destination address.

In one embodiment of the present disclosure, further comprising:

encapsulating the data packet according to an instruction issued by the controller;

and obtaining the destination address in the data packet according to the value of the initialized Segment routing pointer Segment Left.

According to another aspect of the present disclosure, there is also provided a network failure recovery apparatus, including:

if not, analyzing the TLV field of the type length value to acquire backup transmission node address information corresponding to the protected transmission node, updating the backup transmission node address information to the new destination address, and transmitting the data packet according to the new destination address.

According to another aspect of the present disclosure, there is also provided a network failure recovery system, including:

a backup path strategy base for storing the transmission node and the related strategy of the path;

the network topology information base stores the network topology information and dynamically adjusts the network topology information according to the actual situation;

the network fault rapid recovery module is used for providing backup paths for transmission nodes and paths in the network according to the backup requirements in the backup path strategy library and the actual situation of the network topology, and packaging the backup paths into data packets to be distributed to the data network;

and the backup path library stores the path information which is backed up.

According to another aspect of the present disclosure, there is also provided an electronic device including: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform any of the above described network failure recovery methods via execution of the executable instructions.

According to another aspect of the present disclosure, there is also provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the network failure recovery method of any one of the above.

According to the network fault recovery method, the device, the system, the electronic equipment and the computer readable storage medium, the transmission node receives the data packet, matches the destination address in the data packet with the SID, acquires the behavior information corresponding to the SID matched with the destination address, determines the new destination address according to the behavior information, judges whether the new destination address can be reached, if not, analyzes the TLV field, acquires the backup transmission node address information corresponding to the protected transmission node, updates the backup transmission node address information into the new destination address, transmits the data packet according to the new destination address, and can save resources, efficiently recover the network fault and guarantee the reliability of network operation.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.

FIG. 1 is a flow chart illustrating a method for recovering from a network failure in an embodiment of the present disclosure;

FIG. 2 is a flow chart illustrating a method for recovering from a network failure in an embodiment of the present disclosure;

fig. 3 is a schematic diagram illustrating a normal forwarding data packet according to an embodiment of the disclosure;

FIG. 4 is a schematic diagram illustrating a backup path initiated forwarding data packet according to an embodiment of the disclosure;

FIG. 5 is a schematic diagram illustrating a network failure recovery apparatus according to an embodiment of the disclosure;

fig. 6 shows a schematic diagram of a network failure recovery system in an embodiment of the present disclosure; and

fig. 7 shows a block diagram of an electronic device in an embodiment of the present disclosure.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.

For ease of understanding, the following first explains several terms to which the disclosure relates:

SR (Segment Routing) has a stateless property, a path is selected by a source node and a packet is guided to be transmitted along the path, and other nodes do not need to maintain any flow-related information.

IPv6 (Internet Protocol Version 6, sixth edition).

SRv6 (Segment Routing Over IPv6, SR technology based on IPv6 forwarding plane) is a combination of SR technology and IPv6 technology.

The SRH (Segment Routing Header) stores Segment List information of IPv6, decides IPv6 destination address information by means of Segment Left and Segment List, and guides message path and behavior.

TLV (Type-Length-Value, type Length Value) is an editable field.

The present exemplary embodiment will be described in detail below with reference to the drawings and examples.

First, the embodiments of the present disclosure provide a network failure recovery method, which may be executed by any electronic device with computing processing capability.

Fig. 1 shows a flowchart of a network failure recovery method in an embodiment of the present disclosure, and as shown in fig. 1, the network failure recovery method provided in the embodiment of the present disclosure includes the following steps:

s102, receiving the data packet, matching the destination address in the data packet with the segment identification SID, and acquiring the behavior information corresponding to the SID.

In one embodiment, the segment list includes a plurality of SIDs, each SID including a location identifier, behavior information, and backup path processing parameters.

It should be noted that the location identifier is a network address prefix of the transmission node, so that the node route is reachable;

the behavior information is used for defining the processing action of the data packet;

the backup path processing parameter is used for backing up the path processing parameter.

In one embodiment, the behavior information may include:

the transmission node does not process the data packet;

and checking whether the new destination address can be reached, if so, forwarding normally, and otherwise, analyzing the data packet and selecting backup transmission node address information and the like through the backup path processing parameters.

And S104, determining a new destination address according to the behavior information.

In one embodiment, the data packet is encapsulated according to an instruction issued by a controller; and obtaining the destination address in the data packet according to the value of the initialized Segment routing pointer Segment Left.

S106, judging whether the new destination address can be reached.

In one embodiment, whether the new destination address is reachable is determined according to a location identity, wherein the location identity includes a network address prefix of the transmission node.

And S108, if not, acquiring the address information of the backup transmission node, updating the address information of the backup transmission node into a new destination address, and transmitting the data packet according to the new destination address.

In one embodiment, the address information of the backup transmission node corresponding to the protected transmission node is obtained by analyzing the TLV field.

In one embodiment, the TLV field includes information of the protected transport node and the backup transport node, e.g., address information of the protected transport node and the backup transport node;

in one embodiment, the lengths of the protected transport node and the backup transport node corresponding to the information are defined as needed, for example, the information of the protected transport node and the backup transport node are 64 bits respectively.

In one embodiment, when it is determined that the new destination address is reachable, the packet is transmitted according to the new destination address.

In the embodiment, on the basis of the SRv protocol, the TLV field is customized and used, then the SID is defined for the fault handling action, and the source routing technical advantage of SRv protocol customized forwarding is applied, so that the network fault rapid recovery is realized, including node faults and link faults, the space of a routing table is saved, and the overall reliability of the network is improved.

Fig. 2 shows a flowchart of a network failure recovery method in an embodiment of the present disclosure, and as shown in fig. 2, the network failure recovery method provided in the embodiment of the present disclosure includes the following steps:

s202, constructing a packet header of SRv according to a certain sequence, and packaging the SID value of the transmission node on the main path into a Segment List.

It should be noted that Segment Routing (SR) has a stateless characteristic, a source node selects a path and directs a packet to transmit along the path, and other nodes do not need to maintain any flow-related information. The segmented routing architecture is not based on a specific data plane implementation and can be applied in MPLS and IPv 6. Because the IPv6 header has the characteristics of flexibility, programmability, address scalability, and the like, the SRH is defined in the IPv6 header, and thus the segment routing technique can be applied to the IPv6 data plane, which is called "SRv". The segmented routing architecture is based on source routing, and control strategies are issued to designated network equipment through a controller, so that the segmented routing architecture becomes the optimal technical choice for the super-large-scale traffic engineering to be deployed on the network equipment.

Table 1 is a SRv packet header field data structure table, and the packet header of the SRv data packet is an SRH packet added after the original IPv6 packet header, as shown in table 1:

table 1 SRv6 header field data structure table

Wherein, in the IPV6 header field:

version number Version:4bit and ipv6 is 6;

communication Class Traffic Class:8bit, which is used for marking the flow and conveniently distinguishing the priority and conveniently making a strategy;

flow Label:20bit, used in cooperation with the Trafic Class;

load Length:16bit, the payload length of an IPV6 packet refers to the data content length after the header, including the extension header portion;

next Header Next: 8bit, which indicates which extension header or protocol type in the upper layer protocol follows the basic header;

hop count Limit Hop Limit:8bit, ipv6 uses the number of times a packet is forwarded between routers to define the lifetime of the packet. Each time a packet is forwarded, the field is reduced by 1, and when the field is reduced to 0, the packet is discarded;

source Address:128bit, sender host address;

destination Address:128 bits, and in most cases the destination address, i.e. the destination address. But if a route extension header exists, the destination address may be the next router interface in the sender routing table;

wherein, in the SR packet header field:

next Header of Next packet head;

extended header length Hdr Ext Len:8bit refers to the length of the hop-by-hop option extension Header, and the length does not include the length of a Next Header;

routing Type:8bit, which refers to a specific routing header variable, wherein the current routing type only defines type 0, which contains the IP address of the message needing to pass through the intermediate router;

segment routing pointer Segment Left: refers to the number of intermediate strips that need to be passed before reaching the final destination.

It should be noted that, in the data structure of the packet header SRv, the header of IPv6 is located at the front, and the SR header is located next to the header, and the fields in the IPv6 header are not modified or adjusted, and the Option TLVs field in the SRH portion of the SR header is redefined and utilized, and the field is variable in length, as shown in table 2.

Table 2 options TLVs field definition table

0 to 63 position	64 bits to 128 bits
		Protected transport node address information	Backup transfer node address information

In the Optional TLVs field, the first 64 bits are defined as "protected transport node" for identifying IPv6 address information of the protected node; the last 64 bits are defined as "backup transfer node" IPv6 address information for identifying the backup transfer node.

And each value in the Segment List field is a 128-bit SID, which is defined in the SRv6 protocol as shown in Table 3.

TABLE 3 SID Definitions Table

Locator

Function

Args

The location identifier field is the network address prefix of the transmission node, so that the routing of the node is reachable; the behavior information Function is used to define the processing action of the data packet, and the backup path processing parameter Args is used to backup the path processing parameter.

In one embodiment, in practical applications, parameters such as backup path priority may be designed according to the importance of the protected transport node.

In one embodiment, table 4 defines the following functions:

TABLE 4 Function definition Table

It should be noted that each transmission node has multiple SIDs, and SRv identifies each Segment by the SID, where the SID is a special IPv6 address, and has routing capability of a general IPv6 address and behavior capability specific to SRv. The encapsulated SID contains the Function action and the Args parameter that require the transmitting node to process the packet.

S204, according to the preselected backup path, the IPv6 address of the backup node and the IPv6 address of the protected node are written into the TLV field.

S206, the network controller packs the SRH head and the data packet into an IPv6 packet head and sends the packet head to the nodes, and the target address is the SID value of the first node.

In one embodiment, after acquiring the data packet, the receiver first checks whether the next-hop IPv6 address is reachable according to the locator, and if so, forwards the data packet according to the Segment Left address, that is, no fault occurs. If the next hop IPv6 address is not reachable, namely the fault is stated to occur, the TLV field is analyzed, the protected transmission node is searched for the backup transmission node IPv6 address corresponding to the fault node, the next hop IPv6 address is modified, and normal communication of the service is guaranteed.

In the embodiment, the TLV field is expanded and effectively utilized, the SID is defined according to the fault handling action, a SRv6 protocol customized routing forwarding source routing mechanism is fully utilized, the rapid recovery of node faults or link faults is realized, and the overall reliability of the network is improved.

Fig. 3 is a schematic diagram illustrating normal forwarding of a data packet according to an embodiment of the present disclosure, as shown in fig. 3, in this example, the primary path is a first transmission node 301, a second transmission node 302, a third transmission node 303, a fifth transmission node 305, the backup route is the first transmission node 301, the second transmission node 302, a fourth transmission node 304, a fifth transmission node 305, the protected transmission node is the third transmission node 303, and the backup transmission node is the fourth transmission node 304.

It should be noted that there are two key information in SRH, first Segment List in IPv6 address form, and Segment List is ordered to form an explicit path in SRv; another key field is Segment Left (SL), which is a pointer that indicates the currently active Segment List. The minimum value of Segment Left is 0, and the maximum value is the number of Segment Lists minus 1.Segment List is pushed in reverse order, i.e., the bottom Segment List [2] is the first Segment List to be processed, the middle Segment List [1] is the second one to be processed, and the top Segment List [0] is the last one to be processed.

In SRv, the IPv6 destination address field is a constantly changing field whose value is determined by the Segment Left field and the following Segment List, and when the pointer Segment Left points to an active Segment, such as Segment List [2], the IPv6 address of Segment List [2] needs to be copied to the IPv6 destination address field.

First transmission node 301 operates to: encapsulating a data packet according to an instruction issued by a controller, and if the initialization Segment Left value is 2, the outer layer IPv6 destination address is A2:22;

the second transport node 302 operates to: receiving the data packet, extracting a target IPv6 address to match with the SID of the target IPv6 address, executing corresponding operation after hitting, if the Function is END.BP1, searching a route with a Segment Left value of 1 and a target IPv6 address of A3:33, wherein the route can be reached, updating a target IP and obtaining a third transmission node 303;

the third transmission node 303 operates to: receiving the data packet, extracting a target IPv6 address to match with the SID of the data packet, executing corresponding operation after hitting, if the Function is END.BP0, searching for a route with a Segment Left value of 0 and a target IPv6 address of A5:55, if the route can be reached, updating a target IP, and using the target IP as a fifth transmission node 305;

the fifth transmitting node 305 operates to: and receiving the data packet.

Fig. 4 is a schematic diagram illustrating a backup path forwarding data packet initiated in an embodiment of the present disclosure, as shown in fig. 4, in this example, a primary path is a first transmission node 401, a second transmission node 402, a third transmission node 403, a fifth transmission node 405, a backup route is the first transmission node 401, the second transmission node 402, a fourth transmission node 404, a fifth transmission node 405, a protected transmission node is the third transmission node 403, and a backup transmission node is the fourth transmission node 404. When a link between the third transport node 403 or the third transport node 403 and the second transport node 402 fails, a backup path is initiated to forward the data packet as shown in the following diagram:

first transport node 401 operates to: encapsulating a data packet according to an instruction issued by a controller, and if the initialization Segment Left value is 2, the outer layer IPv6 destination address is A2:22;

the second transmitting node 402 operates to: receiving the data packet, extracting a target IPv6 address to match with the SID of the target IPv6 address, executing corresponding operation after hitting, if the Function is END.BP1, searching a route with the destination IPv6 address of A3:33 and the Segment Left value of 1, and if the route is not reachable, analyzing the TLV field to obtain a next hop address of the backup path as a fourth transmission node 404, and updating the destination IP.

The fourth transmission node 404 operates to: receiving the data packet, extracting a target IPv6 address to match with the SID of the mobile terminal, and after hit, executing a corresponding operation, if the Function is end.bp0, updating the destination IP, which is the fifth transfer node 405;

the fifth transmitting node 405 operates to: and receiving the data packet.

In the above embodiment, on the basis of the SRv protocol, the TLV field is utilized in a customized manner, and then the SID is defined for the fault handling action, which has the characteristics of simple deployment and flexible expansion, can better implement traffic scheduling and path optimization, and greatly improve the utilization rate of the network bandwidth, and the source routing technical advantage of the SRv protocol customized forwarding is applied, so that the network fault fast recovery including node fault and link fault is realized, the space of the routing table is saved, the overall reliability of the network is improved, and the method has a wide application prospect in the fields of network communication, wide area virtual private networks and the like.

Based on the same inventive concept, the embodiment of the present disclosure further provides a network failure recovery apparatus, as in the following embodiments. Because the principle of the embodiment of the apparatus for solving the problem is similar to that of the embodiment of the method, the embodiment of the apparatus can be implemented by referring to the implementation of the embodiment of the method, and repeated details are not described again.

Fig. 5 is a schematic diagram of a network failure recovery apparatus in an embodiment of the present disclosure, and as shown in fig. 5, the network failure recovery apparatus 5 includes: a new address judgment module 501 and a backup address acquisition module 502;

a new address determination module 501, configured to receive a data packet, match a destination address in the data packet with a segment id SID, determine a new destination address, and determine whether the new destination address is reachable;

if not, the backup address obtaining module 502 parses the type length value TLV field to obtain backup transmission node address information corresponding to the protected transmission node, updates the backup transmission node address information to the new destination address, and transmits the data packet according to the new destination address.

In the embodiment, on the basis of the SRv protocol, the TLV field is utilized in a customized manner, then the SID is defined for the fault handling action, and the source routing technical advantage of the SRv protocol customized forwarding is applied, so that the rapid recovery of network faults including node faults and link faults is realized, the space of a routing table is saved, and the overall reliability of a network is improved.

Based on the same inventive concept, the embodiment of the present disclosure further provides a network failure recovery system, such as the following embodiments. Because the principle of the system embodiment for solving the problem is similar to that of the method embodiment, the implementation of the system embodiment may refer to the implementation of the method embodiment, and repeated details are not described again.

Fig. 6 is a schematic diagram of a network failure recovery system in an embodiment of the present disclosure, where, as shown in fig. 6, the network failure recovery system 6 includes: a backup path policy base 601, a network topology information base 602, a network failure fast recovery module 603, a backup path base 604 and a network communication interface 605;

a backup path policy base 601, where the database stores relevant policies for protecting the key nodes and paths, and the network failure fast recovery module calculates different backup paths according to the policies;

a network topology information base 602, which persistently stores the network topology information and dynamically adjusts according to the actual situation;

a network failure fast recovery module 603, which is a current core unit, and is responsible for providing backup paths for key nodes and paths in the network according to the actual situation of the network topology and the backup requirements in the backup path policy library, and encapsulating the backup paths into a series of SRv data packets and distributing the data packets to the data network;

and a backup path library 604, wherein the database stores the path information that has been backed up, and the network failure fast recovery module generates a corresponding SRv data packet according to the backup information and issues the data packet to a corresponding device.

In the embodiment, the TLV field is expanded and effectively utilized, the SID is defined according to the fault handling action, a source routing mechanism of customized routing forwarding of the SRv protocol is fully applied, the rapid recovery of node faults or link faults is realized, and the overall reliability of the network is improved.

As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or program product. Accordingly, various aspects of the present disclosure may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.

An electronic device 700 according to this embodiment of the disclosure is described below with reference to fig. 7. The electronic device 700 shown in fig. 7 is only an example and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.

As shown in fig. 7, electronic device 700 is embodied in the form of a general purpose computing device. The components of the electronic device 700 may include, but are not limited to: the at least one processing unit 710, the at least one memory unit 720, and a bus 730 that couples various system components including the memory unit 720 and the processing unit 710.

Wherein the storage unit stores program code that is executable by the processing unit 710 to cause the processing unit 710 to perform steps according to various exemplary embodiments of the present disclosure as described in the above section "exemplary methods" of this specification.

For example, the processing unit 710 may perform the following steps of the above method embodiment: the transmission node receives the data packet, matches the destination address in the data packet with the SID, acquires behavior information corresponding to the SID matched with the destination address, determines a new destination address according to the behavior information, judges whether the new destination address can be reached, if not, analyzes the TLV field, acquires backup transmission node address information corresponding to the protected transmission node, updates the backup transmission node address information into a new destination address, and transmits the data packet according to the new destination address.

For example, the processing unit 710 may perform the following steps of the above method embodiment: constructing a packet header of SRv according to a certain sequence, and packaging the SID value of the transmission node on the main path into a Segment List; s204, writing the IPv6 address of the backup node and the IPv6 address of the protected node into a TLV field according to the preselected backup path; the network controller packs the SRH head and the data packet into IPv6 head and sends them to the nodes, the target address is the SID value of the first node.

For example, the processing unit 710 may perform the following steps of the above method embodiment: after obtaining the data packet, the receiver firstly checks whether the next hop IPv6 address can be reached according to the Loactor, and if so, forwards the data packet according to the Segment Left address, namely, no fault occurs. If the next hop IPv6 address is not reachable, namely the fault is stated to occur, the TLV field is analyzed, the protected transmission node is searched for the backup transmission node IPv6 address corresponding to the fault node, the next hop IPv6 address is modified, and normal communication of the service is guaranteed.

The storage unit 720 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM) 7201 and/or a cache memory unit 7202, and may further include a read only memory unit (ROM) 7203.

The storage unit 720 may also include a program/utility 7204 having a set (at least one) of program modules 7205, such program modules 7205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.

Bus 730 may be any representation of one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

The electronic device 700 may also communicate with one or more external devices 740 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 700, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 700 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 750.

Also, the electronic device 700 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the internet) via the network adapter 760. As shown, the network adapter 760 communicates with the other modules of the electronic device 700 via the bus 730. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 700, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, and may also be implemented by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.

In an exemplary embodiment of the present disclosure, there is also provided a computer-readable storage medium, which may be a readable signal medium or a readable storage medium. On which a program product capable of implementing the above-described method of the present disclosure is stored. In some possible embodiments, various aspects of the disclosure may also be implemented in the form of a program product comprising program code for causing a terminal device to perform the steps according to various exemplary embodiments of the disclosure described in the "exemplary methods" section above of this specification, when the program product is run on the terminal device.

For example, the program product in the embodiments of the present disclosure, when executed by a processor, implements a method comprising: the transmission node receives the data packet, matches the destination address with the SID in the data packet, acquires the behavior information corresponding to the SID matched with the destination address, determines a new destination address according to the behavior information, judges whether the new destination address can be reached, if not, analyzes the TLV field, acquires backup transmission node address information corresponding to the protected transmission node, updates the backup transmission node address information into a new destination address, and transmits the data packet according to the new destination address.

For example, the program product in the embodiments of the present disclosure, when executed by a processor, implements a method comprising: constructing a packet header of SRv according to a certain sequence, and packaging the SID value of the transmission node on the main path into a Segment List; s204, writing the IPv6 address of the backup node and the IPv6 address of the protected node into a TLV field according to the preselected backup path; the network controller packs the SRH head and the data packet into an IPv6 packet head and sends the packet head to the nodes, and the target address is the SID value of the first node.

For example, the program product in the embodiments of the present disclosure, when executed by a processor, implements a method comprising: after obtaining the data packet, the receiver firstly checks whether the next hop IPv6 address can be reached according to the Loactor, and if so, forwards the data packet according to the Segment Left address, namely, no fault occurs. If the next hop IPv6 address is not reachable, namely the fault is stated to occur, the TLV field is analyzed, the protected transmission node is searched for the backup transmission node IPv6 address corresponding to the fault node, the next hop IPv6 address is modified, and normal communication of the service is guaranteed.

More specific examples of the computer-readable storage medium in the present disclosure may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

In the present disclosure, a computer readable storage medium may include a propagated data signal with readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Alternatively, program code embodied on a computer readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

In particular implementations, program code for carrying out operations of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + +, or the like, as well as conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server.

In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).

It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.

Moreover, although the steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.

Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

Claims

1. A network failure recovery method is applied to a transmission node and comprises the following steps:

2. The method of claim 1, wherein if the destination address in the data packet is matched with the segment id SID, determining a new destination address, and determining whether the new destination address is reachable comprises:

receiving a data packet, matching a destination address in the data packet with a Segment Identifier (SID), and acquiring behavior information corresponding to the SID;

determining a new destination address according to the behavior information;

and judging whether the new destination address is reachable.

3. The method of claim 1, wherein the TLV field comprises protected transport node address information and the backup transport node address information.

4. The method of claim 2, wherein the segment list comprises a plurality of SIDs, each of the SIDs comprising a location identifier, the behavior information, and a backup path processing parameter.

5. The method of claim 2, wherein the determining whether the new destination address is reachable comprises:

6. The network failure recovery method of claim 2, wherein the behavior information comprises at least one of:

the transmission node does not process the data packet;

7. The method of network failure recovery according to claim 1, further comprising:

8. The method of network failure recovery according to claim 1, further comprising:

and obtaining the destination address in the data packet according to the value of the initialization Segment routing pointer Segment Left.

9. A network failure recovery apparatus, comprising:

the new address judging module is used for receiving the data packet, matching the destination address in the data packet with the segment identification SID, determining a new destination address and judging whether the new destination address can be reached;

and if not, the backup address acquisition module analyzes the TLV field of the type length value to acquire backup transmission node address information corresponding to the protected transmission node, updates the backup transmission node address information into the new destination address, and transmits the data packet according to the new destination address.

10. A network failure recovery system, comprising:

the network topology information base stores the network topology information and carries out dynamic adjustment according to the actual situation;

and the backup path library stores the path information which is backed up.

11. An electronic device, comprising:

a processor; and

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform the network failure recovery method of any one of claims 1-8 via execution of the executable instructions.

12. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the network failure recovery method according to any one of claims 1 to 8.