WO2022105325A1

WO2022105325A1 - Rerouting method, communication apparatus and storage medium

Info

Publication number: WO2022105325A1
Application number: PCT/CN2021/112831
Authority: WO
Inventors: 冯超; 马军棋; 李�浩
Original assignee: 华为技术有限公司
Priority date: 2020-11-23
Filing date: 2021-08-16
Publication date: 2022-05-27
Also published as: CN114615190A; CN114615190B

Abstract

Disclosed are a rerouting method, a communication apparatus and a storage medium. The method comprises: a first node acquiring a fault message, wherein the fault message is used for indicating that a first link carrying M services has a fault, and M is an integer greater than or equal to 1; the first node determining M recovery paths according to the fault message, wherein the M services correspond to the M recovery paths on a one-to-one basis, the M recovery paths pass through N second nodes, and N is an integer greater than 1; and the first node respectively sending a rerouting message to each of the N second nodes, wherein the rerouting message is used for instructing each second node to perform rerouting. The embodiments of the present application are conducive to reducing a rerouting duration.

Description

Rerouting method, communication device and storage medium

This application claims the priority of the Chinese patent application with the application number 202011326715.8 and the application title "Rerouting Method, Communication Device and Storage Medium" filed with the State Intellectual Property Office of China on November 23, 2020, the entire contents of which are incorporated by reference in this application.

technical field

The present application relates to the field of communication technologies, and in particular, to a rerouting method, a communication device, and a storage medium.

Background technique

In an optical network, a fiber break occurs between two nodes. After the fiber is cut, services passing through the two nodes will be affected and cannot be transmitted normally. In order to ensure the stability of service transmission, after a node failure, the faulty node will reroute the affected service to ensure the normal transmission of the affected service. The rerouting means that the faulty node plans a recovery path for the affected service. , and establish the restoration path through signaling, and transmit the affected service through the restoration path.

However, currently, the restoration path is established in a hop-by-hop manner, and the rerouting time is long and the performance is poor.

SUMMARY OF THE INVENTION

The present application provides a rerouting method, a communication device, and a storage medium, which can perform service rerouting through multiple second nodes in parallel, shorten the rerouting time, and improve the rerouting performance.

In a first aspect, an embodiment of the present application provides an execution body of the method, which may be the first node, or may be a chip applied in the first node. The following description takes the execution subject as the first node as an example. The method includes:

The first node obtains a fault message, where the fault message is used to indicate that the first link carrying M services is faulty, and M is an integer greater than or equal to 1; the first node determines M recovery paths according to the fault message, where M services One-to-one correspondence with the M restoration paths, where the M restoration paths pass through N second nodes, where N is an integer greater than 1; the first node sends a rerouting message to each of the N second nodes, and the The routing message is used to instruct each second node to reroute.

It can be seen that, in this embodiment of the present application, the first node can determine M services that pass through the first link that has failed, and M recovery paths corresponding to the M services, and send the M services to the M recovery paths. Each second node in the N second nodes sends a rerouting message; then, after each second node receives the rerouting message, it performs service rerouting in parallel to establish the M recovery paths without the need for the first node or rerouting The routing trigger point performs service rerouting hop by hop, thereby reducing the rerouting time and improving the rerouting performance.

In some possible implementations, the fault message includes two faulty nodes connected to the first link, and the first node determines M recovery paths according to the fault message, including: the first node according to the two faulty nodes and the first path list, M recovery paths are determined, the first path list includes the correspondence between the faulty node and the recovery path, and the first path list is pre-configured in the first node.

It can be seen that the first path list is preconfigured, so that in the case of a link failure between two nodes, the first node can quickly determine the recovery path according to the faulty node and the first path list, and then locate the N Therefore, N second nodes can be instructed to perform service rerouting in parallel, thereby reducing the rerouting duration. Moreover, only the corresponding relationship between the recovery path and the faulty node needs to be configured, and the configuration method is relatively simple and flexible.

In some possible implementations, the fault message includes two faulty nodes connected to the first link, and the first node determines M recovery paths according to the fault message, including: the first node determines, according to the two faulty nodes, that after two faults have passed M services of the node; the first node determines M recovery paths according to the M services and the second path list, the second path list includes the correspondence between the services and the recovery paths, and the second path list is preconfigured to the first path list. in the node.

It can be seen that the second path list is preconfigured, so that in the event of a link failure between two nodes, the first node can quickly determine the recovery path according to the faulty node and the first path list, and then locate N Therefore, N second nodes can be instructed to perform service rerouting in parallel, thereby reducing the rerouting duration. Moreover, only the corresponding relationship between the service and the recovery path needs to be configured, and the configuration method is relatively simple and flexible.

In some possible implementations, the first node determines M restoration paths according to the M services and the second path list, including: the first node determines each of the M services according to the M services and the second path list at least one restoration path corresponding to the service; the first node determines, according to the first preset rule, one restoration path corresponding to each service from the at least one restoration path corresponding to each service, and obtains M restoration paths.

It can be seen that, according to the first preset rule, the first node can determine one restoration path corresponding to each service from at least one restoration path corresponding to each service, and obtain M restoration paths. It should be understood that the M recovery paths determined in this way are the optimal combination among all the recovery path combinations corresponding to the M services, for example, the recovery path with the fewest second nodes, so that the optimal recovery path can be used. Perform rerouting to improve rerouting performance.

In some possible implementations, before the first node sends the fault message to each of the N second nodes respectively, the method further includes: the first node deduplicates all nodes on the M recovery paths , get N second nodes.

It can be seen that in this implementation manner, the first node first deduplicates the nodes on the M restoration paths, so that the first node can be prevented from repeatedly sending rerouting messages to some second nodes, and the first node sending Pressure to reroute messages.

In some possible implementations, the first node is any one of the two faulty nodes; or, the first node is a faulty node that satisfies the second preset rule among the two faulty nodes; or, the first node is Centralized control unit.

It can be seen that, in this embodiment, the first node can be determined in various ways to ensure the flexibility of the first node, thereby ensuring the flexibility of the rerouting method.

In some possible implementations, the rerouting message includes two faulty nodes, and the rerouting message is used to instruct each second node to determine M recovery paths according to the two faulty nodes, and establish M recovery paths that pass through each The recovery path of the second node.

It can be seen that, in this embodiment, two faulty nodes can be carried in the rerouting message, which can reduce the overhead of the rerouting message and reduce the pressure on the first node to announce the rerouting message.

In some possible implementations, the rerouting message includes M restoration paths, and the rerouting message is used to instruct each second node to establish a restoration path passing through each second node on the M restoration paths.

It can be seen that, in this implementation manner, M recovery paths can be carried in the rerouting message, so that the second node can directly perform rerouting according to the M recovery paths, without the need to determine the M recovery paths, reducing the number of second nodes This increases the computational pressure and improves the rerouting performance.

In a second aspect, an embodiment of the present application provides an execution body of the method, which may be the second node, or may be a chip applied in the second node. The following description takes the execution subject as the second node as an example. The method includes: a second node receives a rerouting message from a first node, the second node is any second node among N second nodes, and the N second nodes are M recovery paths corresponding to M services. Node, M services are in one-to-one correspondence with M recovery paths, the M recovery paths are determined by the first service node according to the acquired fault message, and the fault message indicates that the first link carrying the M services is faulty, and M is is an integer greater than or equal to 1, and N is an integer greater than 1; the second node performs rerouting according to the rerouting message.

It can be seen that, in this embodiment of the present application, each second node will receive a rerouting message, and perform rerouting according to the rerouting message. Since the N second nodes perform rerouting in parallel, the rerouting duration is reduced and the rerouting performance is improved.

In some possible implementations, the rerouting message includes two faulty nodes connected to the first link, and the second node performs rerouting according to the rerouting message, including: the second node determines M recovery paths according to the two faulty nodes ; The second node establishes a recovery path passing through the second node among the M recovery paths.

It can be seen that, in this embodiment, since the rerouting message includes two faulty nodes, the overhead of the rerouting message is relatively small. Moreover, the second node can complete the rerouting only according to the two faulty nodes, which improves the flexibility of the rerouting.

In some possible implementations, the second node determining M recovery paths according to the two faulty nodes includes: the second node determining M recovery paths according to the two faulty nodes and the first path list, wherein the first path The list includes the corresponding relationship between the faulty node and the recovery path, and the first path list is preconfigured into the second node.

It can be seen that in this implementation manner, the first path list is preconfigured, and in the case of receiving the rerouting message, the second node can quickly determine M recovery paths according to the two faulty nodes and the first path list, Therefore, a restoration path passing through the second node can be established, the service rerouting process can be performed in parallel, and the rerouting duration can be reduced. In addition, only the corresponding relationship between the faulty node and the recovery path needs to be configured, and the configuration method is relatively simple and flexible.

In some possible implementations, the second node determines M recovery paths according to the two faulty nodes, including: the second node determines M services passing through the two faulty nodes according to the two faulty nodes; the second node determines M services passing through the two faulty nodes according to the M A list of services and a second path is determined, M restoration paths are determined, the second path list includes the correspondence between services and restoration paths, and the second preset list is pre-configured in the second node.

It can be seen that in this implementation manner, the second path list is preconfigured, and in the case of receiving the rerouting message, the second node can quickly determine M recovery paths according to the two faulty nodes and the first path list, Therefore, a restoration path passing through the second node can be established, the service rerouting process can be performed in parallel, and the rerouting duration can be reduced. In addition, only the corresponding relationship between services and recovery paths needs to be configured, and the configuration method is relatively simple and flexible.

In some possible implementations, the second node determines M restoration paths according to the M services and the second path list, including: the second node determines each of the M services according to the M services and the second path list at least one recovery path corresponding to the service; the second node determines, according to the first preset rule, a first service path corresponding to each service from at least one recovery path corresponding to each service, and obtains M recovery paths.

It can be seen that, in this embodiment, the second node can determine one restoration path corresponding to each service from at least one restoration path corresponding to each service according to the first preset rule, and obtain M restoration paths. It should be understood that the M recovery paths determined in this way are an optimal combination among all the recovery path combinations corresponding to the M services, so that rerouting can be performed through the optimal recovery path and the rerouting performance can be improved.

In some possible implementations, the rerouting message includes M restoration paths, and the second node performs rerouting according to the rerouting message, including: the second node establishing a restoration path passing through the second node among the M restoration paths.

It can be seen that, in this embodiment, the rerouting message includes M restoration paths, so that the second node can directly establish a restoration path passing through the second node according to the M restoration paths, without the need to determine the M restoration paths, reducing the need for The calculation pressure of the second node is reduced, and the rerouting performance is improved.

In a third aspect, an embodiment of the present application provides a communication device, and the beneficial effects can be referred to the description of the first aspect and will not be repeated here. The communication device has a function to implement the behavior in the method example of the first aspect above. The functions can be implemented by hardware, or by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the above functions. In a possible design, the communication device includes: a processing module for acquiring a fault message, where the fault message is used to indicate that the first link carrying M services is faulty, where M is an integer greater than or equal to 1; and according to the fault The message determines M restoration paths, wherein the M services are in one-to-one correspondence with the M restoration paths, the M restoration paths pass through N second nodes, and N is an integer greater than 1; Each second node in the nodes sends a rerouting message, and the rerouting message is used to instruct each second node to perform rerouting.

In the fourth aspect, an embodiment of the present application provides a communication device, and the beneficial effects can be referred to the description of the second aspect, and will not be repeated here. The communication device has a function to implement the behavior in the method example of the second aspect above. The functions can be implemented by hardware, or by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the above functions. In a possible design, the communication device includes: a transceiver module for receiving a rerouting message from a first node, the second node is any second node among N second nodes, and the N second nodes are M The nodes that M recovery paths corresponding to the services pass through, the M services are in one-to-one correspondence with the M recovery paths, and the M recovery paths are determined by the first service node according to the acquired fault message, and the fault message indicates that the M services are carried The first link of the fault occurs, M is an integer greater than or equal to 1, and N is an integer greater than 1; the processing module is configured to perform rerouting according to the rerouting message.

In a fifth aspect, an embodiment of the present application provides a communication device, where the communication device may be the first node in the foregoing method embodiments, or a chip provided in the first node. The communication device includes a communication interface, a processor, and optionally, a memory. The memory is used to store computer programs or instructions, and the processor is coupled to the memory and the communication interface, and when the processor executes the computer program or instructions, the communication device executes the method executed by the first node in the above method embodiments.

In a sixth aspect, an embodiment of the present application provides a communication device, where the communication device may be the second node in the foregoing method embodiments, or a chip provided in the second node. The communication device includes a communication interface, a processor, and optionally, a memory. The memory is used to store computer programs or instructions, and the processor is coupled with the memory and the communication interface, and when the processor executes the computer program or instructions, the communication device executes the method executed by the second node in the above method embodiments.

In a seventh aspect, a computer program product is provided, the computer program product comprising: computer program code, which, when the computer program code is executed, causes the method performed by the first node in the above aspects to be performed.

In an eighth aspect, a computer program product is provided, the computer program product comprising: computer program code, which when the computer program code is executed, causes the method performed by the second node in the above aspects to be performed.

In a ninth aspect, the present application provides a chip system, where the chip system includes a processor for implementing the function of the first node in the methods of the above aspects. In one possible design, the system-on-a-chip further includes a memory for storing program instructions and/or data. The chip system may be composed of chips, or may include chips and other discrete devices.

In a tenth aspect, the present application provides a chip system, where the chip system includes a processor for implementing the functions of the second node in the methods of the above aspects. In one possible design, the system-on-a-chip further includes a memory for storing program instructions and/or data. The chip system may be composed of chips, or may include chips and other discrete devices.

In an eleventh aspect, the present application provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and when the computer program is executed, the method executed by the first node in the above aspects is implemented.

In a twelfth aspect, the present application provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and when the computer program is executed, the method executed by the second node in the above aspects is implemented.

In a thirteenth aspect, the present application provides a rerouting system, including the communication device of the fifth aspect and the communication device of the sixth aspect.

It can be seen that, in this embodiment of the present application, the first node can obtain a fault message, and the fault message indicates that the first link carrying M services is faulty. Therefore, the first node can determine M links according to the fault message. Restoring paths, the M restoration paths pass through N second nodes; then, the first node sends a rerouting message to each of the N second nodes respectively, so that each second node receives the rerouting message After that, rerouting is performed according to the rerouting message, so that N second nodes can establish the M recovery paths in parallel, which reduces the rerouting time and improves the rerouting performance.

Description of drawings

FIG. 1 is a schematic diagram of a service rerouting method provided by an embodiment of the present application;

2 is a schematic diagram of another service rerouting method provided by an embodiment of the present application;

3 is a schematic structural diagram of a rerouting system provided by an embodiment of the present application;

FIG. 4 is a schematic diagram of the architecture of another rerouting system provided by an embodiment of the present application;

5 is a schematic flowchart of a rerouting method provided by an embodiment of the present application;

6 is a schematic diagram of a rerouting provided by an embodiment of the present application;

FIG. 7 is a schematic diagram of another rerouting provided by an embodiment of the present application;

FIG. 8 is a schematic structural diagram of a communication device according to an embodiment of the present application;

FIG. 9 is a schematic structural diagram of another communication apparatus provided by an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application can be applied to various optical networks. For example, Automatic Switched Optical Network (ASON), Optical Transport Network (OTN), Active Optical Network (AON), and so on. In this application, ASON is used as an example for description, and other types of optical networks are similar to ASON scenarios and will not be described again.

It should be understood that when the technical solution of the present application is applied to ASON, the first node and the second node in the embodiment of the present application may be ASON equipment, for example, the ASON equipment may be an optical line terminal (Optical Line Terminal, OLT). ) or optical cable terminal equipment (Optical Line TerMinal), etc.

In order to facilitate the understanding of the present application, the related technical knowledge involved in the embodiments of the present application is first introduced here.

In ASON, a fiber break occurs between two nodes. After the fiber is cut, services passing through the two nodes will be affected and cannot be transmitted normally. In order to ensure the stability of service transmission, after a node failure, the faulty node will reroute the affected service to ensure the normal transmission of the affected service. The rerouting means that the faulty node plans a recovery path for the affected service. , and establish the restoration path through signaling, and transmit the affected service through the restoration path.

Two rerouting schemes are described below with reference to the accompanying drawings.

Scheme 1: As shown in Figure 1, after the fiber is disconnected between node C and node D, the faulty node C determines that the service passing through the two faulty nodes has service S1, and node C plans a recovery path for the service S1 (that is, in Figure 1). The path shown by the dotted line); then, node C advertises the restoration path to the first node on this restoration path, namely node A; finally, the restoration path is established hop by hop through signaling from node A, and the restoration path is established After completion, the transmission path of the service S1 is switched from the original path (ie, the path shown by the solid line in FIG. 1 ) to the restoration path for transmitting the service S1.

It can be seen that the faulty node needs to advertise the recovery path to the first node. When the transmission distance between the first node and the faulty node is long, the advertisement time is longer; When there are many services, multiple services need to be rerouted in batches, resulting in a long rerouting time and poor rerouting performance.

Scheme 2: As shown in Figure 2, first manually configure the rerouting trigger node of each node. After the fiber is disconnected between the two nodes, one of the faulty nodes, such as node C, can determine the recovery path of the affected service S1 , and send the restoration path to the rerouting trigger node corresponding to node C, namely node B; then, after receiving the restoration path, node B establishes the restoration path hop-by-hop from this node.

It can be seen that the rerouting trigger node needs to be manually configured first, and the labor cost is high; in addition, if the rerouting trigger node is the first node of the restoration path, the rerouting time is longer; moreover, this hop-by-hop rerouting When there are many services, multiple services need to be rerouted in batches, resulting in a long rerouting time and poor rerouting performance.

Therefore, the existing rerouting method takes a long time and has poor rerouting performance.

Referring to FIG. 3 , FIG. 3 provides a rerouting system according to an embodiment of the present application. The rerouting system includes a first node 301 and N second nodes 302 . Exemplarily, as shown in FIG. 3 , node C is the first node, node E, node F, node G, node H, node I, and node J are all second nodes, and node C and node D have two faults. The fiber is disconnected between node C and node D.

Exemplarily, the first node 301 obtains a fault message, where the fault message is used to indicate that the first link carrying M services is faulty, wherein the first node 301 is one of the two faulty nodes of the first link; The first node 301 determines M recovery paths according to the fault message, wherein the M recovery paths are in one-to-one correspondence with M services, and the M recovery paths pass through the N second nodes, where M is an integer greater than or equal to 1 , N is an integer greater than 1; finally, the first node 301 sends a rerouting message to each of the N second nodes 302; each second node 302 performs rerouting according to the rerouting message, that is, according to the The rerouting message establishes a restoration path passing through the second node among the M restoration paths, thereby completing the rerouting of the M services.

Referring to FIG. 4, FIG. 4 provides another rerouting system according to an embodiment of the present application. The rerouting system includes a first node 401 and N second nodes 402 . Exemplarily, as shown in FIG. 4 , node C is the first node, node E, node F, node G, node H, node I, and node J are all second nodes, and node C and node D have two faults. The fiber is disconnected between node C and node D.

Exemplarily, the first node 401 receives a fault message from the faulty node, where the fault message is used to indicate that the first link carrying M services is faulty, wherein the first node 401 is a centralized control unit of the optical network, and the faulty node is the faulty node. Any one of the two faulty nodes connected by the first link; the first node 401 determines M recovery paths according to the fault message, wherein the M recovery paths are in one-to-one correspondence with the M services, and the M recovery paths pass through For the N second nodes, M is an integer greater than or equal to 1, and N is an integer greater than 1; finally, the first node 401 sends a rerouting message to each of the N second nodes 402; each The second node 402 performs rerouting according to the rerouting message, that is, establishes a recovery path passing through the second node among the M recovery paths according to the rerouting message, thereby completing the rerouting of the M services.

It can be seen that, in the rerouting systems shown in FIG. 3 and FIG. 4 , the first node can determine M services that pass through the faulty first link, and M recovery paths corresponding to the M services, and Send a rerouting message to each of the N second nodes that the M recovery paths pass through; then, after each second node receives the rerouting message, it establishes a recovery path passing through the node, and completes the pairing process. M restoration paths are established, thereby completing the rerouting of M services. Equivalently, N second nodes can perform the rerouting process in parallel, without the need for the first node or the rerouting trigger point to perform service rerouting hop-by-hop, thereby reducing the rerouting time and improving the rerouting performance. Moreover, since N second nodes can perform the process of rerouting in parallel, no matter how large the automatic switched optical network is, the duration of the rerouting is determined by the duration of each second node establishing the recovery path. The duration of the route is no longer affected by the size of the auto-switched optical network.

It should be understood that the rerouting systems shown in FIG. 3 and FIG. 4 also include other nodes, such as node K, node L, node M, node N, node A, and node B, and so on. Since these nodes do not participate in this rerouting process, the functions of these nodes are no longer described.

Referring to FIG. 5, FIG. 5 is a schematic flowchart of a rerouting method provided by an embodiment of the present application. The method includes the following steps:

501: The first node acquires a fault message, where the fault message is used to indicate that a first link carrying M services is faulty, where M is an integer greater than or equal to 1.

Exemplarily, the first node may be any one of the two faulty nodes of the first link, or may be a node that satisfies the second preset rule among the two faulty nodes, or may be a centralized control unit of ASON.

For example, the second preset rule may be the faulty node with the largest number of connected nodes among the two faulty nodes. As shown in FIG. 6 , the fiber is disconnected between node C and node D, that is, the first link between C and D is broken. If the road fails, then node C and node D are two faulty nodes, and the nodes connected to node C include node B, node H, node G, node F, and node D, and the nodes connected to node D include node C, node Node F and Node E, so Node C is used as the first node.

It should be understood that the second preset rule may also have other forms. For example, the second preset rule may be the faulty node with the least number of services passing through the two faulty nodes, and the present application does not limit the second preset rule.

In addition, in the case where the first node is a faulty node, acquiring the fault message by the first node is actually the process for the faulty node to determine the fiber disconnection, that is, to determine which two nodes are the two faulty nodes connected to the first link; When the first node is a centralized control unit, the fault message can be received from a faulty node, and the faulty node can be any one of the two faulty nodes connected to the first link.

502: The first node determines M recovery paths according to the fault message, wherein the M recovery paths pass through N second nodes.

Exemplarily, the first node determines M recovery paths according to two faulty nodes and a first path list, wherein the first path list includes the correspondence between the faulty node and the recovery path, and the first path list is pre-configured into the first node. It should be understood that since it is not possible to predict which nodes will fail in advance, each node in the ASON network is preconfigured with the first path list.

It can be seen that in the process of determining the recovery path, M recovery paths can be determined only according to the corresponding relationship between the faulty node and the recovery path, without paying attention to the service corresponding to the recovery path, so that M recovery paths can be quickly obtained. , which can reduce the rerouting time.

In conjunction with the nodes shown in Figure 6, Table 1 shows the correspondence between the faulty node and the recovery path:

Table 1:

It should be understood that Table 1 also shows the correspondence between services, recovery paths and faulty nodes, so that after subsequent recovery paths are established, the head node of each recovery path knows which service is the recovery path that passes through the head node. path, so as to restore the transmission of the service on the restoration path.

Exemplarily, the first node determines, according to the faulty node, the M services that pass through the two faulty nodes, that is, the M services that pass through the first link. M services of the two faulty nodes; then, according to the M services and a second path list, determine M first service paths, wherein the second path list includes the correspondence between services and recovery paths, and the first path list The two-path list is preconfigured into the first node. Likewise, the second path list needs to be configured to each node in the ASON network.

It can be seen that only configuring the corresponding relationship between the service and the recovery path can reduce the storage space of the second path list, thereby saving the storage space occupied by the second path list in each node.

In conjunction with the nodes shown in Figure 6, Table 2 shows the correspondence between services and recovery paths:

Table 2:

It should be understood that at least one recovery path may be configured for each service. Therefore, after determining the M services, the first node may also select a recovery path for each service from at least one recovery path corresponding to each of the M services, as the optimal recovery path for each service , and then M recovery paths corresponding to the M services are obtained.

Exemplarily, when configuring the restoration path of each service, at least one restoration path of each service may be numbered, and the smaller the number is, the higher the priority of the restoration path corresponding to the number is. Therefore, the first node may select the restoration path with the smallest number among the at least one restoration path corresponding to each service from the second path list as the optimal restoration path.

In addition, when configuring at least one recovery path corresponding to each service, it is also possible not to number each recovery path, that is, not to configure the priority of the recovery path, but to insert the first preset rule for each node, then The first node may determine an optimal restoration path for each service from at least one restoration path corresponding to each service according to the first preset rule, and obtain M restoration paths.

Exemplarily, the first preset rule may be to cross-combine at least one recovery path corresponding to each service to obtain multiple combination results, and use the combination result with the least number of second nodes among the multiple combination results as M number of combination results. M recovery paths for services. For example, if the restoration paths corresponding to service S1 are R1 and R2, and the restoration paths corresponding to service S2 are L1 and L2, the combination result is: R1 and L1, R1 and L2, R2 and L1, R2 and L2, and the R2 and L2 are determined. L2 has the least number of second nodes in this combined result. Therefore, R2 is used as the restoration path of S1, and L2 is used as the restoration path of S2.

It can be seen that by setting the first preset rule, the number of second nodes can be minimized, so that the first node can notify fault messages to a smaller number of second nodes, reducing the pressure of the first node's notification messages.

It should be understood that the above-mentioned second preset rule is only for illustration, and not for limitation. In practical applications, other preset rules can also be used to select a recovery path for each service. For example, a recovery path with the smallest number of nodes is selected from at least one recovery path corresponding to each service as the optimal recovery path for the service. path.

503: The first node sends a rerouting message to each of the N second nodes, respectively.

Exemplarily, before sending a rerouting message to each of the N second nodes, the first node deduplicates all nodes on the M first restoration paths to obtain the N second nodes.

For example, as shown in FIG. 6 , the restoration path R1 and the restoration path R2 are determined, wherein the restoration path R1 is: node A→node I→node H→node G→node F→node D, and the restoration path R2 is: node K → Node I → Node H → Node G → Node F → Node D. Therefore, all nodes on the restoration path R1 and the restoration path R2 are unioned and deduplicated to obtain the following second nodes: node A, node K, node I, node H, node G, node F, and node D.

Then, the first node sends a rerouting message to each of the N second nodes, respectively.

It should be understood that in the process of sending the rerouting message from the first node to the second node, if a second node is not directly connected to the first node, the first node sends the rerouting message to the second node through a relay. As shown in Figure 6, node C sends a rerouting message to node A. Since node C and node A are not directly connected, node C can send the rerouting message to a transit node, such as node B, and then node B sends the rerouting message forwarded to node A. In the subsequent process involving the first node sending a rerouting message to a second node, if the second node is not directly connected to the first node, the first node may send the rerouting message to the second node in a transit way , no longer narrated. Similarly, for the first node shown in the figure to directly send the rerouting message to the second node, it is only used to indicate that the first node can send the rerouting message to the second node, but does not really directly send the rerouting message to the second node. The message is sent to the second node.

504: The second node performs rerouting according to the rerouting message.

In an embodiment of the present application, if the rerouting message includes two faulty nodes, the second node determines M recovery paths according to the two faulty nodes; then, the second node establishes M recovery paths through the first The recovery path of the two nodes, so as to realize the rerouting of M services. It should be understood that the manner in which the second node determines the M restoration paths is similar to the manner in which the first node determines the M restoration paths, and will not be described again.

Exemplarily, the first path list and the second path list also include cross information of each node on the restoration path, wherein the cross information of each node refers to the connection direction between each node, that is, the first path In addition to the restoration paths, the list and the second path list also contain the connection directions between the nodes on each restoration path. In this way, after the second node determines the restoration path passing through the second node among the M restoration paths, it can determine the previous node and the next node connected to the second node on the restoration path passing through the second node; then, The second node may establish a link to the previous node, as well as a link to the next node, rerouting the recovery path through the second node.

It should be understood that if the second node is a cross node on two recovery paths, the number of previous nodes connected to the second node may be multiple, and the number of next nodes connected to the second node may also be multiple. for multiple. And when the number of previous nodes is multiple, the second node can establish links corresponding to multiple previous nodes at the same time, and when the number of next nodes is multiple, the second node can also simultaneously establish links. Links corresponding to multiple next nodes are established.

For example, as shown in FIG. 6 , the node I is the intersection node of the restoration path R1 and the restoration path R2, and the last nodes connected to the node I are the node A and the node K. Therefore, node I can establish a link with node A and node K at the same time.

It should be understood that after each of the N second nodes completes the configuration of the link with the previous node and the next node, the M recovery paths are established; then, each second node Feedback a successful establishment response message to the head node on the restoration path where it is located; then, the head node will perform end-to-end refresh signaling messages on the restoration path, as well as end-to-end service takeover and maintenance, and transmit the M The service corresponding to the recovery path in the service.

In another embodiment of the present application, the rerouting message includes M restoration paths. Therefore, the second node can directly determine the restoration paths passing through the second node among the M restoration paths; then, N second nodes can establish restoration paths passing through the second node in parallel to complete the establishment of the M restoration paths , to implement rerouting of M services.

In an embodiment of the present application, as shown in FIG. 7 , the first node may also send a rerouting message to each node in the ASON network in a flooding mode, where the rerouting message includes a rerouting message connected to the first link. Two failed nodes. In this way, each node can determine M services passing through the first link and M recovery paths according to the two faulty nodes. For the nodes (ie the second nodes) belonging to the M recovery paths, for example, node A, Node I, node H, etc., independently establish a link between the previous node connected to the node and the next node, complete the establishment of the M recovery paths, and realize the rerouting of the M services.

It can be seen that, in this embodiment of the present application, the first node does not need to determine M recovery paths and N second nodes, but directly delivers the faulty node to all nodes, which increases the flexibility of rerouting, and Distributing computing tasks to each node reduces the processing pressure of the first node.

In the above-mentioned embodiments for implementing rerouting provided by the present application, the methods provided by the embodiments of the present application are respectively introduced from the perspectives of the first node, the second node, and the interaction between the first node and the second node. In order to implement the functions in the methods provided by the above embodiments of the present application, the first node and the second node may include hardware structures and/or software modules, and implement the above-mentioned functions in the form of hardware structures, software modules, or hardware structures plus software modules. each function. Whether one of the above functions is performed in the form of a hardware structure, a software module, or a hardware structure plus a software module depends on the specific application and design constraints of the technical solution.

FIG. 8 and FIG. 9 provide schematic structural diagrams of a communication apparatus according to an embodiment of the present application. These communication apparatuses can implement the functions of the first node or the second node in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. In this embodiment of the present application, the communication device may be the first node as shown in the embodiment corresponding to FIG. 5 , or may be the second node, or may be a module applied to the first node or the second node (such as chip).

As shown in FIG. 8 , the communication apparatus 800 includes a transceiver module 801 and a processing module 802 . The communication apparatus 800 may be used to implement the function of the first node or the second node in the above-mentioned embodiment corresponding to FIG. 5 .

When the communication apparatus 800 is used to implement the function of the first node in the method embodiment of FIG. 5:

A processing module 802, configured to acquire a fault message, where the fault message is used to indicate that the first link carrying M services is faulty, where M is an integer greater than or equal to 1;

The processing module 802 is configured to determine M recovery paths according to the fault message, wherein the M services are in one-to-one correspondence with the M recovery paths, the M recovery paths pass through N second nodes, and N is an integer greater than 1;

The transceiver module 801 is configured to send a rerouting message to each of the N second nodes respectively, where the rerouting message is used to instruct each second node to perform rerouting.

When the communication apparatus 800 is used to implement the function of the second node in the method embodiment of FIG. 5:

The transceiver module 801 is configured to receive a rerouting message from a first node, where the second node is any second node among N second nodes, and the N second nodes are nodes through which M recovery paths corresponding to M services pass through , M services are in one-to-one correspondence with M restoration paths, the M restoration paths are determined by the first service node according to the acquired fault message, and the fault message indicates that the first link carrying the M services is faulty, and M is greater than Or an integer equal to 1, N is an integer greater than 1;

The processing module 802 is configured to perform rerouting according to the rerouting message.

For a more detailed description of the foregoing transceiver module 801 and the processing module 802, reference may be made to the relevant descriptions in the foregoing method embodiments, which are not described herein again.

As shown in FIG. 9 , the communication apparatus 900 includes a processor 901 and an interface circuit 902 . The processor 901 and the interface circuit 902 are coupled to each other. It can be understood that the interface circuit 902 can be a transceiver or an input-output interface. Optionally, the communication apparatus 900 may further include a memory 903 for storing instructions executed by the processor 901 or input data required by the processor 901 to run the instructions or data generated after the processor 901 runs the instructions.

When the communication apparatus 900 is used to implement the methods in the foregoing method embodiments, the processor 901 is used to execute the functions of the foregoing processing module 802 , and the interface circuit 902 is used to execute the functions of the foregoing transceiver module 801 .

When the above communication device is a chip applied in the first node, the chip in the first node implements the function of the first node in the above method embodiment. The chip in the first node receives information from other modules (such as a radio frequency module or an antenna) in the first node, and the information is sent by the second node to the first node; or, the chip in the first node sends information to the first node. Other modules in the node (such as radio frequency modules or antennas) send information, which is sent by the first node to the second node.

When the above communication device is a chip applied in the second node, the chip in the second node implements the function of the second node in the above method embodiment. The chip in the second node receives information from other modules (such as a radio frequency module or an antenna) in the second node, and the information is sent by the first node to the second node; or, the chip in the second node sends information to the second node Other modules in the node (such as radio frequency modules or antennas) send information, which is sent by the second node to the first node.

An embodiment of the present application further provides a rerouting system, including the above communication device for implementing the function of the first node and the above communication device for implementing the function of the second node.

Embodiments of the present application further provide a computer-readable storage medium on which a computer program is stored, and when the program is executed by a processor, can implement the process related to the first node in the rerouting method provided by the above method embodiments.

Embodiments of the present application further provide a computer-readable storage medium on which a computer program is stored, and when the program is executed by a processor, can implement the process related to the second node in the rerouting method provided by the above method embodiments.

Embodiments of the present application also provide a computer program product, which, when running on a computer or a processor, causes the computer or processor to execute one or more steps in any of the foregoing rerouting methods. If each component module of the above-mentioned device is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium.

It can be understood that the processor in the embodiments of the present application may be a central processing unit (central processing unit, CPU), and may also be other general-purpose processors, digital signal processors (digital signal processors, DSP), application-specific integrated circuits (application specific integrated circuit, ASIC), field programmable gate array (field programmable gate array, FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. A general-purpose processor may be a microprocessor or any conventional processor.

The method steps in the embodiments of the present application may be implemented in a hardware manner, or may be implemented in a manner in which a processor executes software instructions. Software instructions can be composed of corresponding software modules, and software modules can be stored in random access memory (RAM), flash memory, read-only memory (ROM), programmable read-only memory (programmable ROM) , PROM), erasable programmable read-only memory (erasable PROM, EPROM), electrically erasable programmable read-only memory (electrically EPROM, EEPROM), registers, hard disks, removable hard disks, CD-ROMs or known in the art in any other form of storage medium. An exemplary storage medium is coupled to the processor, such that the processor can read information from, and write information to, the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and storage medium may reside in an ASIC. Additionally, the ASIC may be located in the first node or the second node. Of course, the processor and storage medium may also exist in the first node or the second node as discrete components.

In the above-mentioned embodiments, it may be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented in software, it can be implemented in whole or in part in the form of a computer program product. A computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on the computer, the process or function of the embodiments of the present application is executed in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable device. The computer program or instructions may be stored in or transmitted over a computer-readable storage medium. A computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server that integrates one or more of the available media. Useful media may be magnetic media such as floppy disks, hard disks, magnetic tapes; optical media such as DVDs; and semiconductor media such as solid state disks (SSDs).

In the various embodiments of the present application, if there is no special description or logical conflict, the terms and/or descriptions between different embodiments are consistent and can be referred to each other, and the technical features in different embodiments are based on their inherent Logical relationships can be combined to form new embodiments.

In this application, "at least one" means one or more, and "plurality" means two or more. "And/or", which describes the association relationship of the associated objects, indicates that there can be three kinds of relationships, for example, A and/or B, which can indicate: the existence of A alone, the existence of A and B at the same time, and the existence of B alone, where A, B can be singular or plural.

It can be understood that, the various numbers and numbers involved in the embodiments of the present application are only for the convenience of description, and are not used to limit the scope of the embodiments of the present application. The size of the sequence numbers of the above processes does not imply the sequence of execution, and the execution sequence of each process should be determined by its function and internal logic.

Claims

A rerouting method, comprising:

The first node acquires a fault message, where the fault message is used to indicate that the first link carrying M services is faulty, where M is an integer greater than or equal to 1;

The first node determines M recovery paths according to the fault message, wherein the M services are in one-to-one correspondence with the M recovery paths, and the M recovery paths pass through N second nodes, where N is greater than an integer of 1;

The first node sends a rerouting message to each of the N second nodes respectively, where the rerouting message is used to instruct each of the second nodes to perform rerouting.
The method according to claim 1, wherein the fault message includes two faulty nodes connected to the first link, and the first node determines M recovery paths according to the fault message, comprising:

The first node determines the M recovery paths according to the two faulty nodes and a first path list, where the first path list includes the correspondence between the faulty nodes and the recovery paths, and the first path list is pre-configured into the first node.
The method according to claim 1, wherein the fault message includes two faulty nodes connected to the first link, and the first node determines M recovery paths according to the fault message, comprising:

The first node determines, according to the two faulty nodes, M services passing through the two faulty nodes;

The first node determines the M restoration paths according to the M services and the second path list, the second path list includes the correspondence between the service and the restoration path, and the second path list is a preset list. configured into the first node.
The method according to claim 3, wherein the first node determines the M restoration paths according to the M services and the second path list, comprising:

The first node determines, according to the M services and the second path list, at least one recovery path corresponding to each of the M services;

The first node determines one restoration path corresponding to each service from at least one restoration path corresponding to each service according to a first preset rule, and obtains the M restoration paths.
The method according to any one of claims 1 to 4, wherein before the first node sends the fault message to each of the N second nodes respectively, the method further comprises: :

The first node deduplicates all nodes on the M restoration paths to obtain the N second nodes.
The method according to any one of claims 1-5, wherein,

the first node is any one of the two faulty nodes;

Alternatively, the first node is a faulty node that satisfies the second preset rule among the two faulty nodes;

Alternatively, the first node is a centralized control unit.
The method according to any one of claims 1-6, wherein,

The rerouting message includes the two faulty nodes, and the rerouting message is used to instruct each second node to determine the M recovery paths according to the two faulty nodes, and establish the M recovery paths A recovery path passing through each of the second nodes on the recovery path.
The method according to any one of claims 1-6, wherein,

The rerouting message includes the M restoration paths, and the rerouting message is used to instruct each second node to establish a restoration path passing through each second node on the M restoration paths.
A rerouting method, comprising:

The second node receives the rerouting message from the first node, the second node is any one of the N second nodes, and the N second nodes are the M recovery paths corresponding to the M services. node, the M services are in one-to-one correspondence with the M recovery paths, and the M recovery paths are determined by the first service node according to the acquired fault message, and the fault message indicates that the M services are carried The first link is faulty, M is an integer greater than or equal to 1, and N is an integer greater than 1;

The second node performs rerouting according to the rerouting message.
The method according to claim 9, wherein the rerouting message comprises two faulty nodes connected to the first link, and the second node performs rerouting according to the rerouting message, comprising:

The second node determines the M recovery paths according to the two faulty nodes;

The second node establishes a restoration path passing through the second node among the M restoration paths.
The method according to claim 10, wherein the second node determines the M recovery paths according to the two faulty nodes, comprising:

The second node determines the M recovery paths according to the two faulty nodes and a first path list, wherein the first path list includes the corresponding relationship between the faulty node and the recovery path, and the first path list includes the corresponding relationship between the faulty node and the recovery path. A list of paths is preconfigured into the second node.
The method according to claim 10, wherein the second node determines the M recovery paths according to the two faulty nodes, comprising:

The second node determines, according to the two faulty nodes, M services passing through the two faulty nodes;

The second node determines the M restoration paths according to the M services and a second path list, the second path list includes the correspondence between services and restoration paths, and the second preset list is: pre-configured into the second node.
The method according to claim 12, wherein the second node determines the M restoration paths according to the M services and the second path list, comprising:

The second node determines, according to the M services and the second path list, at least one recovery path corresponding to each of the M services;

The second node determines a first service path corresponding to each service from at least one restoration path corresponding to each service according to a first preset rule, and obtains the M restoration paths.
The method according to claim 9, wherein the rerouting message comprises connecting the M restoration paths, and the second node performs rerouting according to the rerouting message, comprising:

The second node establishes a restoration path passing through the second node among the M restoration paths.
A communication device, characterized by comprising a module for performing the method according to any one of claims 1-8 or claims 9-14.
A communication device, characterized by comprising a processor and a communication interface, wherein the communication interface is used to receive signals from other communication devices other than the communication device and transmit to the processor or transfer signals from the processor The signal is sent to other communication devices other than the communication device, and the processor is used to implement the method according to any one of claims 1-8 or claims 9-14 through logic circuits or executing code instructions.
A computer-readable storage medium, characterized in that, the computer-readable storage medium stores a computer program, and when the computer program is executed, any one of claims 1-8 or claims 9-14 is implemented the method described.