CN102487329B - Service restoration method and device - Google Patents

Abstract

The invention discloses a service recovery method and device, wherein the service recovery method includes: determining that the bearer link of multiple services fails, and multiple services have the same head node and tail node; determining the link between the head node and the tail node There is at least one available route, and the resource of the available route satisfies the resource summation of multiple services, or the resource summation of at least two services among the multiple services; the available route is used to restore multiple services or at least two services that have failed. Through the present invention, the effects of reducing service recovery time and improving service recovery efficiency are achieved.

Description

Service recovery method and device

technical field

The present invention relates to the communication field, in particular, to a service recovery method and device.

Background technique

With the development of optical transmission technology, ASON (Automatic Switched Optical Network, Automatically Switched Optical Network) has become the next development direction of optical transmission. Compared with the traditional optical transport network, ASON introduces a distributed intelligent control plane, which combines transmission, switching and data networks, and realizes real routing settings, end-to-end service scheduling and automatic network recovery.

The emergence of ASON provides automatic control means for traffic engineering and business management. ASON introduces an independent control plane based on the original management plane and transmission plane of the traditional SDH (Synchronous Digital Hierarchy) network, and supports ASON from three aspects: link resource management technology, routing technology, and signaling technology. The system structure of the control plane enables the automatic discovery of neighbors, the automatic generation of the entire network topology, and the automatic creation of service paths, which greatly reduces the tediousness of manually assigning labels and establishing cross-connections, and realizes the rational allocation and utilization of network bandwidth resources. .

In terms of network survivability, the ASON network adopts the method of combining the protection mechanism of the transmission plane and the protection and restoration mechanism of the control plane, and protects and restores services according to different network protection characteristics and service levels, which reflects the ASON network in the business Huge advantage in conservation recovery.

For unprotected services that are common in ASON networks, once a link that the service passes fails, the service needs to be restored. The usual method is that the head node of the service that needs to be restored dynamically establishes a new LSP identical to the head and tail nodes of the original LSP (LabelSwitchedPath, Label Switched Path), and then switches the service from the failed LSP to the new LSP.

When performing service recovery, the operation of the service head node is as follows: first, perform constraint-based routing calculation according to the traffic engineering characteristics of the service, and obtain a path that meets the requirements, that is, a series of ordered combinations of nodes and links; then , use a signaling protocol such as RSVP-TE (ResourceReservationProtocol-TrafficEngineering, a resource reservation protocol based on traffic engineering extensions) to initiate the establishment of an LSP on the path obtained from the query, and perform resource reservation and label allocation on each node. Send it to the transport plane, so as to establish a recovery connection and switch the services affected by the failure to this LSP.

If there are multiple services that need to be restored at the first node, a recovery connection needs to be established for each service according to the above process, which will cause the following problems:

(1), affected by information flooding and convergence speed of routing protocols such as OSPF-TE (OpenShortestPathFirst(Protocol)-TrafficEngineering, an open shortest path first protocol based on traffic engineering), the possibility of resource competition for each recovery connection is relatively high Big.

(2) Since the RSVP (Resource Reservation Protocol, Resource Reservation Protocol) protocol in the optical network widely uses the label information mechanism specified by the upstream node, the possibility of label competition between the upstream and downstream nodes is relatively high.

(3) The same operation process is executed multiple times, especially it is time-consuming to send cross operations to the transmission plane.

Whether it is resource competition, label competition, or the delivery of cross-operation fees, it will eventually lead to too much time-consuming recovery of all services. Therefore, if the faulty link carries many services, each service must be restored separately, which takes a long time, seriously affects the recovery efficiency of ASON, and becomes a bottleneck affecting ASON performance.

Contents of the invention

The main purpose of the present invention is to provide a service recovery method and device, so as to at least solve the above-mentioned problems of long service recovery time and low recovery efficiency.

According to one aspect of the present invention, a service recovery method is provided, including: determining that the bearer link of multiple services has a failure, and the multiple services have the same head node and tail node; At least one available route, the resource of the available route satisfies the resource sum of multiple services, or the resource sum of at least two services among the multiple services; the available route is used to restore multiple services or at least two services that have failed.

According to another aspect of the present invention, a service recovery device is provided, including: a first determination module, configured to determine that a failure occurs on a bearer link of multiple services, and the multiple services have the same head node and tail node; Two determining modules, used to determine that there is at least one available route between the head node and the tail node, and the resource of the available route satisfies the resource sum of multiple services, or the resource sum of at least two services among multiple services; the recovery module , for recovering multiple services or at least two services that have failed using the available routes.

Through the present invention, when multiple services with the same head node and tail node fail, select an available route from between the head node and the tail node that satisfies the resources occupied by the failed multiple services, or from Select one of these routes to restore multiple services that have failed at the same time, without having to restore each service separately, thereby reducing the possibility of label competition and resource competition. In addition, in the case of multi-service batch recovery, only Sending a cross-connection to the transport plane greatly reduces the time required for service recovery, improves recovery efficiency, and solves the problems of long service recovery time and low recovery efficiency in the prior art when multiple services fail, thereby achieving Reduce business recovery time and improve business recovery efficiency.

Description of drawings

The accompanying drawings described here are used to provide a further understanding of the present invention and constitute a part of the application. The schematic embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute improper limitations to the present invention. In the attached picture:

FIG. 1 is a flow chart of steps of a service recovery method according to Embodiment 1 of the present invention;

FIG. 2 is a flow chart of steps of a service recovery method according to Embodiment 2 of the present invention;

FIG. 3 is a flow chart of steps of a service recovery method according to Embodiment 3 of the present invention;

FIG. 4 is a flow chart of steps of a service recovery method according to Embodiment 4 of the present invention;

5 is a schematic diagram of an ASON network topology in a service recovery method according to Embodiment 5 of the present invention;

Fig. 6 is a structural block diagram of a service recovery device according to Embodiment 6 of the present invention.

detailed description

Hereinafter, the present invention will be described in detail with reference to the drawings and examples. It should be noted that, in the case of no conflict, the embodiments in the present application and the features in the embodiments can be combined with each other.

Referring to FIG. 1 , it shows a flow chart of steps of a service recovery method according to Embodiment 1 of the present invention, including the following steps:

Step S102: determining that the bearer links of multiple services are faulty;

Among them, multiple services have the same head node and tail node.

Step S104: Determine that there is at least one available route between the head node and the tail node;

Wherein, the resource of one available route satisfies the sum of resources of multiple services, or the sum of resources of at least two services among the multiple services.

Between the head node and the tail node of multiple services, there may be only one available route whose resources satisfy the sum of the resources of multiple services, then this route can be used to restore multiple services; there may also be multiple resources that satisfy multiple services At this time, one of the routes can be selected according to the predetermined rules to perform multi-service recovery. Of course, if there is only one route, and the resources of this route can only satisfy part of the multiple services, and this part of the service includes at least two services, at this time, this route can be used to restore some of the multiple services; if There are multiple available routes between the head node and the tail node, but none of the routes can satisfy multiple business resources at the same time. At this time, one of the routes can be used to restore part of the business, and then other available routes can be used to restore the remaining business .

Step S106: using available routes to recover multiple services or at least two services that have failed.

In the related art, when multiple services fail, each service needs to be recovered separately, so the service recovery time is long and the recovery efficiency is low. Through this embodiment, when multiple services with the same head node and tail node fail, select an available route between the head node and the tail node whose resources satisfy the resources occupied by the failed multiple services or part of the services, Simultaneously restore the failed services instead of restoring each service separately, thereby reducing the possibility of label competition and resource competition. In addition, in the case of batch restoration of multiple services, only one cross-connection needs to be issued to the transport plane, which greatly reduces the The time required for business recovery is shortened, the recovery efficiency is improved, and the problem of long service recovery time and low recovery efficiency is solved when multiple services fail in the prior art, thereby achieving the effect of reducing the service recovery time and improving the service recovery efficiency .

Referring to FIG. 2 , it shows a flow chart of steps of a service recovery method according to Embodiment 2 of the present invention. This embodiment includes the following steps for unprotected services:

Step S202: fault detection.

That is, it is detected that a link of multiple services fails. When a link fails, the head node of all services carried on this link detects the occurrence of the failure and prepares to initiate a service recovery operation. Of course, multiple links may fail at the same time. At this time, all the services carried by the multiple links cannot be carried out normally. The first node of the multiple services detects the occurrence of the failure, and then prepares for service recovery.

Step S204: Policy judgment.

That is, it is judged whether the head node and the tail node of multiple services where the link fails are the same. When the services to be recovered by the first node are L1, L2...Ln, and the first and last nodes of these services are the same, batch recovery can be performed. It should be noted that, if only some of the services with the same start and end nodes among multiple failed services are also applicable to the batch service recovery in this embodiment. In this embodiment, it is only taken as an example that multiple faulty services all have the same head node and tail node.

Step S206: Routing query.

The first node uses the sum of the bandwidth of L1, L2...Ln and other routing constraints as new constraints to perform routing queries, and finds an available path from the first node to the last node, and the resources of the available path satisfy L1, L2 ...Ln resource sum (that is, the bandwidth of the available path satisfies the bandwidth sum of L1, L2...Ln), then the final number of connections to be recovered in batches is m, and at this time m=n, enter the next step S208. In this embodiment, bandwidth resources are taken as an example, and the sum of bandwidth is the main constraint condition. However, in practical applications, those skilled in the art can perform routing queries with resources of other engineering traffic characteristics and other constraint conditions as required, and the present invention does not make any contribution to this limit.

If the routing query fails due to resource constraints in the entire network, the bandwidth constraint can be reduced and the routing query can be re-initiated. In this case, the query result may be that m (1<m<n) connections share one path, and m The connection can still be recovered by adopting a batch recovery strategy, and the next step S208 is entered.

In the worst case, m=1, that is, any two connections cannot share a path. At this time, the batch recovery strategy cannot be implemented, and each connection can only be recovered independently, and the process goes to step S214.

Step S208: processing by the first node.

The head node uses the RSVP protocol to initiate the establishment of a new connection P on the available path. In the RSVPPATH signaling of this connection, the traffic engineering object SENDERTSPEC contains the total bandwidth parameter successfully queried in step S206, and the private data of the RSVPPATH signaling carries the following information : The attribute of the connection P is to restore connections in batches (that is, the route is a multi-service restoration route), and the connections to be restored are the labels occupied by L1, L2...Lm, L1, L2...Lm on this node and their respective services The output port and the label information occupied by the tail node, etc.

Step S210: non-head node processing.

At each node that the connection P passes through, the connection control module reserves resources according to the relevant information in the private data of the RSVPPATH signaling, and establishes a cross-connection on the transmission plane for each service that needs to be restored.

Step S212: service switching.

After the connection P is successfully established, the services carried by the original L1, L2...Lm connections can be switched to this new connection P, and the original faulty connection can be deleted or retained according to the business policy, thereby realizing the recovery of batch services.

Step S214: the process ends.

Aiming at the scene where batch services of unprotected services are recovered simultaneously, this embodiment adopts the strategy of sharing one path for multiple services, that is, merging multiple smaller "pipes" into one larger "pipeline" for processing, thereby greatly Reduces the possibility of label competition. Moreover, compared with the need to deliver cross-connections to the transport plane multiple times for individual recovery of each connection, the delivery of cross-connections to the transport plane is completed once in the case of batch recovery, which greatly reduces the time required for service recovery and improves recovery efficiency. Moreover, the technical solution of this embodiment does not change the processing flow of the RSVP protocol itself, but borrows the private data field provided by the PATH signaling in the protocol to transfer the information required for batch service recovery between network elements, and the implementation method is simple.

Referring to FIG. 3 , it shows a flow chart of steps of a service recovery method according to Embodiment 3 of the present invention. In this embodiment, taking the failure of M services as an example, where N services have the same head node and tail node, M>N≥2.

The business recovery method of this embodiment includes the following steps:

Step S302: the head node receives the alarm information.

In this embodiment, when M services fail, at least two of the first nodes receive the alarm information because only some of the multiple services have the same head node and tail node. In this embodiment, one of the head nodes is taken as an example for description.

Step S304: the head node judges that the number of co-tail node connections affected by the fault is N.

Step S306: the head node judges whether N is greater than 1, if yes, execute step S310; if not, execute step S308.

In this embodiment, N≥2, so step S310 is executed.

Step S308: Adopt a single connection recovery process, and the process ends.

Step S310: use the sum of the bandwidths of the N connections to perform routing query.

Those skilled in the art can also perform routing query with other parameters based on traffic engineering characteristics.

Step S312: Determine whether the route query is successful, if yes, execute step S314; if not, execute step S316.

Step S314: Send signaling on the new path to establish a connection, and the process ends.

Step S316: N=N-1.

Step S318: Determine whether N is equal to 0, if not, return to step S310; if yes, the process ends.

Referring to FIG. 4 , it shows a flow chart of steps of a service recovery method according to Embodiment 4 of the present invention, including the following steps:

Step S402: It is determined that the bearer links of multiple services are faulty.

In this embodiment, multiple services have the same head node and tail node.

Step S404: Determine that there are multiple available routes between the head node and the tail node.

Wherein, the resource of each available route among the multiple available routes satisfies the sum of resources of multiple services.

Step S406: Determine one of the multiple available routes to restore the service.

When there are multiple available routes between the same head node and tail node, one of them can be selected according to preset rules. The preset rule may be any appropriate rule (such as random selection, etc.), which is not limited in the present invention. In this embodiment, one available route is randomly determined from multiple available routes.

Step S408: Using the determined available route to recover multiple failed services.

It should be noted that if there are multiple available routes between the same head and tail nodes, but none of the available routes satisfies the resource sum of multiple services, one of them can be used to restore some services, and the other can be used to restore other services. Take the failure of 5 services with the same first and last nodes as an example, if there are two available routes A and B between the first and last nodes, at this time, if the resources of A meet the resource sum of the first three services, use Router A restores the first three services; then judges whether the resource of B satisfies the sum of resources of the remaining two services, and if so, uses B to restore the remaining two services. At this time, compared with the separate recovery of existing individual services, the service recovery time is still shortened and the service recovery efficiency is improved.

Referring to FIG. 5 , it shows a schematic diagram of an ASON network topology in a service recovery method according to Embodiment 5 of the present invention.

As shown in FIG. 5 , the ASON network in this embodiment includes seven network elements A, B, C, D, E, F and G, and the lines between the network elements represent links. There are four LSPs in the network, namely L1, L2, L3 and L4, and the corresponding connection IDs are id_1, id_2, id_3 and id_4 respectively. The path traversed by L1 and L2 is A-B-C-G-D, and the path traversed by L3 and L4 is A-F-B-C-D. There is only one data link between network elements B and C, and the four LSPs pass through this link together. The bandwidths of the four LSPs are all STM-1 (wherein, STM represents the bandwidth level), there is a link between network elements A and E and between network elements E and D, and the idle bandwidth on the links is STM-4.

In NE A, the service ingress ports of L1, L2, L3 and L4 are inport_1, inport_2, inport_3 and inport_4 respectively, the service ingress labels are inlabel_1, inlabel_2, inlabel_3 and inlabel_4 respectively, and the corresponding service outports are Pa1, Pa2, For Pa3 and Pa4, the service output labels are La1, La2, La3 and La4 respectively.

In the label forwarding table of NE A, the label forwarding entries corresponding to L1, L2, L3, and L4 are as follows:

connection ID ingress port Into the label out port out label id_1 import_1 inlabel_1 Pa1 La1 id_2 import_2 inlabel_2 Pa2 La2 id_3 import_3 inlabel_3 Pa3 La3 id_4 import_4 inlabel_4 Pa4 La4

In network element D, the service ingress ports of L1, L2, L3 and L4 are Pd3, Pd4, Pd1 and Pd2 respectively, the service ingress labels are Ld3, Ld4, Ld1 and Ld2 respectively, and the corresponding service outports are outport_1, outport_2, For outport_3 and outport_4, the service output labels are outlabel_1, outlabel_2, outlabel_3 and outlabel_4 respectively.

In the label forwarding table of NE D, the label forwarding entries corresponding to L1, L2, L3, and L4 are as follows:

connection ID ingress port Into the label out port out label id_1 Pd3 Ld3 outport_1 outlabel_1 id_2 Pd4 Ld4 outport-2 outlabel_2 id_3 Pd1 Ld1 outport_3 outlabel_3 id_4 Pd2 Ld2 outport_4 outlabel_4

When the link between network elements B and C fails, services carried on the four LSPs are all affected. Faulty link information is transmitted to network element A, the first node of the service, through the OAM (OperationAdministrationandMaintenance, operation management and maintenance) mechanism or RSVPNOTIFY message. After network element A receives the link fault information, it can determine the four LSPs of L1, L2, L3 and L4 The services carried on the network need to be restored.

Since L1, L2, L3, and L4 have the same head and tail nodes, the four LSPs can use a multi-service batch recovery strategy for recovery operations, including:

(1) With network element A as the head node and network element D as the tail node, the sum of the bandwidths of the four LSPs is used as the bandwidth constraint condition for routing query. The bandwidth of each LSP is STM-1, so STM-4 is used as the new Constraints for routing queries.

(2) According to the network topology, the free bandwidth of the link between network elements A and E and the link between network elements E and D is STM-4, so the path A-E-D is the query result that satisfies the routing constraints.

(3) Network element A uses the RSVP protocol on the path A-E-D to initiate the establishment of a new LSP, denoted as L5.

(4) There are 4 idle STM-1 bandwidths on the Pa5 port, and the corresponding labels are label-1, label-2, label-3 and label-4 respectively, label-1, label-2, label-3 and label -4 Sort the values from small to large, assuming label-1<label-2<label-3<label-4; sort id_1, id_2, id_3 and id_4 in ascending order of values, assuming id_1< id_2<id_3<id_4. According to the rule that a smaller connection ID corresponds to a smaller label number, assign label-1, label-2, label-3, and label-4 to L1, L2, L3, and L4, respectively. The private data of the PATH message sent from NE A to NE E carries the following information:

A) The attribute of the connection L5 is multi-service batch recovery connection;

B) L5 contains four sub-connections, namely L1, L2, L3 and L4, the corresponding connection IDs are id_1, id_2, id_3 and id_4, and the occupied labels are label-1, label-2, label-3 and label-4;

C) The service outports corresponding to L1, L2, L3 and L4 are outport_1, outport_2, outport_3 and outport_4 respectively, and the corresponding outlabels are outlabel_1, outlabel_2, outlabel_3 and outlabel_4 respectively.

(5) Network element A reserves resources with a size of STM-4 on port Pa5, and sends the RSVPPATH message to network element E. At this time, network element A forms the following label forwarding table:

connection ID ingress port Into the label out port out label id_1 import_1 inlabel_1 Pa5 label-1 id_2 import_2 inlabel_2 Pa5 label-2 id_3 import_3 inlabel_3 Pa5 label-3 id_4 import_4 inlabel_4 Pa5 label-4

(6) After network element E receives the RSVPPATH message sent by network element A, it judges that L5 is a multi-service batch recovery connection according to the content in the private data, and at the same time, labels label-1, label-2, and label on the ingress port Pe1 -3 and label-4 are assigned to four sub-connections L1, L2, L3 and L4 respectively.

(7) According to the ERO object in the RSVPPATH message, network element E obtains that the next hop of the connection L5 is network element D, the outgoing port is Pe2, and the Pe2 port contains 4 idle STM-1 bandwidths, and the corresponding labels are label-5 , label-6, label-7 and label-8, sort label-5, label-6, label-7 and label-8 in ascending order, assuming label-5<label-6<label-7 <label-8. According to the rule that a smaller connection ID corresponds to a smaller label number, assign label-5, label-6, label-7, and label-8 to L1, L2, L3, and L4, respectively. The private data of the PATH message carries the following information:

A) The attribute of the connection L5 is multi-service batch recovery connection;

B) L5 contains four sub-connections, namely L1, L2, L3 and L4, the corresponding connection IDs are id_1, id_2, id_3 and id_4, and the occupied labels are label-5, label-6, label-7 and label-8;

C) The service outports corresponding to L1, L2, L3 and L4 are outport_1, outport_2, outport_3 and outport_4 respectively, and the corresponding outlabels are outlabel_1, outlabel_2, outlabel_3 and outlabel_4 respectively.

(8) Network element E reserves resources on the Pe2 port, and sends the RSVPPATH message to network element D. At this time, network element E forms the following label forwarding table:

connection ID ingress port Into the label out port out label id_1 Pe1 label-1 Pe2 label-5 id_2 Pe1 label-2 Pe2 label-6 id_3 Pe1 label-3 Pe2 label-7 id_4 Pe1 label-4 Pe2 label-8

(9) After network element D receives the RSVPPATH message sent by network element E, it judges that L5 is a batch recovery connection according to the content in the private data, and at the same time, labels label-5, label-6, and label-7 on the ingress port Pd5 and label-8 are assigned to the four sub-connections L1, L2, L3 and L4 respectively.

(10) Network element D is the tail node of the connection. According to the outgoing port and outgoing label information of the four sub-connections in the private data of the received PATH message, the following label forwarding table is formed:

connection ID ingress port Into the label out port out label id_1 Pd5 label-5 outport_1 outlabel_1 id_2 Pd5 label-6 outport_2 outlabel_2 id_3 Pd5 label-7 outport_3 outlabel_3 id_4 Pd5 label-8 outport_4 outlabel_4

(11) Network element D sends an RSVPRESV message to network element E, the LABEL field in the message is filled with a special value 0XFFFF, and the content of the private data in the message is the same as the private data in the received RSVPPATH message.

(12) According to the private data content in the RSVPRESV message, network element E verifies that the resources on port Pe2 have been reserved successfully, and then sends an RSVPRESV message to network element A. The content of the LABEL object in the message is filled with a special value 0XFFFF, and the private The content of the data is the same as the private data in the received RSVPPATH message.

(13) According to the private data content in the RSVPRESV message, network element A verifies that the resource reservation on port Pa5 is successful, so far the L5 connection is established successfully, and switches the services on L1, L2, L3 and L4 to L5, and at the same time transfers the L1 , L2, L3, and L4 are deleted, the batch business is successfully restored, and the entire process ends.

Referring to FIG. 6, it shows a structural block diagram of a service recovery device according to Embodiment 6 of the present invention, including:

The first determination module 602 is used to determine that the bearer link of multiple services has a failure, wherein the multiple services have the same head node and tail node; the second determination module 604 is used to determine that there is a fault between the head node and the tail node. At least one available route, the resource of the available route satisfies the sum of the resources of multiple services, or the sum of the resources of at least two services in the multiple services; the recovery module 606 is used to recover multiple services that have failed using the available route Or at least two businesses.

Preferably, the second determination module 604 includes: a judging module, configured to judge whether there is at least one available route between the head node and the tail node, and the resources of the one available route meet the resource sum of multiple services; the first affirmation module, If the judging result of the judging module is yes, then determine that the available route is an available route satisfying the resource summation of multiple services; the first negation module is used if the judging result of the judging module is no, then according to the predetermined rule from the resource Reduce part of the resources in the sum, and judge whether there is at least one available route between the head node and the tail node that satisfies the reduced resource sum according to the reduced resource sum; If yes, it is determined that the available route is an available route that satisfies the resource sum of at least two of the multiple services; the second negation module is used to return to the first negation module if the judgment result of the first negation module is no.

Preferably, the recovery module 606 includes: a sending module, used for the first node to send signaling to the tail node in turn via each node on the available route, the signaling carries: information indicating that the available route is a multi-service recovery route, and the information to be recovered The information of each service in the service in this node; the resource module is used for each node on the available route to reserve resources for the service to be restored according to the signaling, and establish a cross-connection for each service in the service to be restored ; A switching module, used to switch the service to be restored to an available route.

Preferably, the signaling is signaling compliant with RSVP, and the private data of the signaling compliant with RSVP carries information indicating that the available route is a multi-service recovery route, and information that each service in the service to be restored is at the local node.

Preferably, the information of each service in the service to be restored at this node includes: the service identifier of each service in the service to be restored, the label occupied by each service in the service to be restored at this node, the The service egress port of each service on this node, and the label occupied by each service in the tail node of the service to be restored.

Preferably, the above services are unprotected services in ASON.

It should be noted that, in the above multiple embodiments, the unprotected service in ASON is taken as an example for illustration, but those skilled in the art should understand that the present invention is also applicable to protected services and services other than ASON Traffic in packet-switched networks.

From the above description, it can be seen that the method and device provided by the present invention for the field of optical communication, especially for the multi-service batch recovery in the ASON field, solve the problem of time-consuming multi-service recovery in the prior art. Low efficiency, and problems such as label competition and resource competition greatly improve the efficiency of multi-service recovery and shorten the time for multi-service recovery.

Obviously, those skilled in the art should understand that each module or each step of the above-mentioned present invention can be realized by a general-purpose computing device, and they can be concentrated on a single computing device, or distributed in a network formed by multiple computing devices Alternatively, they may be implemented in program code executable by a computing device so that they may be stored in a storage device to be executed by a computing device, and in some cases, in an order different from that shown here The steps shown or described are carried out, or they are separately fabricated into individual integrated circuit modules, or multiple modules or steps among them are fabricated into a single integrated circuit module for implementation. As such, the present invention is not limited to any specific combination of hardware and software.

The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and changes. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention shall be included within the protection scope of the present invention.

Claims (10)

1. A service recovery method, characterized in that, comprising: Determining that the bearer link of multiple services has a fault, and the multiple services have the same head node and tail node; Determining that there is at least one available route between the head node and the tail node, and the resource of the one available route satisfies the resource sum of the multiple services, or the resource sum of at least two services in the multiple services; recovering the failed plurality of services or the at least two services using the available routes; Wherein, determining that there is at least one available route between the head node and the tail node includes: judging whether there is at least one available route between the head node and the tail node, and the resource of the one available route satisfies the requirements of the plurality of services. The sum of resources; if it exists, determine that the available route is an available route that satisfies the sum of resources of the multiple services; if it does not exist, reduce some resources from the sum of resources according to predetermined rules, and according to the reduced resources The sum determines whether there is at least one available route satisfying the reduced resource sum between the head node and the tail node. 2. The method according to claim 1, wherein after judging whether there is at least one available route satisfying the reduced resource sum between the head node and the tail node according to the reduced resource sum, further comprising: : If there is at least one available route that satisfies the reduced resource sum, determine that the available route is an available route that satisfies the resource sum of at least two of the multiple services; if there is not at least one that satisfies the reduced resource sum If there are available routes, return the part of the resources that are reduced from the total resources according to the predetermined rule, and judge whether there is at least one route between the head node and the tail node that satisfies the total resources after the reduction according to the total resources after the reduction. Steps for available routes. 3. The method according to claim 1, wherein the step of using the available route to restore the failed multiple services or the at least two services comprises: The head node sequentially sends signaling to the tail node via each node on the available route, and the signaling carries: information indicating that the available route is a multi-service restoration route, and information among the services to be restored The information of each business in this node; Each node on the available route reserves resources for the service to be restored according to the signaling, and establishes a cross-connection for each service in the service to be restored; Switch the service to be restored to the available route. 4. The method according to claim 3, wherein the signaling is a signaling that follows the resource reservation protocol RSVP, and the private data of the signaling that follows the RSVP is used to carry the indication that the available route is The information of the multi-service restoration route, and the information of each service in the service to be restored in the local node. 5. The method according to claim 3, characterized in that, the information of each service in the service to be restored at the local node includes: the service identifier of each service in the service to be restored, the service to be restored The label occupied by each service in the service in the local node, the service output port of each service in the service to be restored in the local node, and the label occupied by each service in the service to be restored in the tail node . 6. The method according to any one of claims 1 to 5, wherein the service is an unprotected service in an Automatic Switched Optical Network. 7. A service recovery device, characterized in that it comprises: The first determination module is configured to determine that the bearer link of multiple services has a failure, and the multiple services have the same head node and tail node; The second determination module is configured to determine that there is at least one available route between the head node and the tail node, and the resource of the one available route satisfies the resource sum of the multiple services, or at least two of the multiple services The sum of the resources of a business; A recovery module, configured to recover the multiple failed services or the at least two services by using the available route; Wherein, the second determining module includes: a judging module, configured to judge whether there is at least one available route between the head node and the tail node, and the resource of the one available route satisfies the resource sum of the multiple services; An affirmation module, used to determine that the available route is an available route that satisfies the sum of resources of the plurality of services if the judgment result of the judgment module is yes; a first negative module, used to determine if the judgment module If the result is no, reduce some resources from the resource sum according to a predetermined rule, and judge whether there is at least one available route between the head node and the tail node that satisfies the reduced resource sum according to the reduced resource sum. 8. The device according to claim 7, wherein the second determining module further comprises: A second affirmative module, configured to determine that the available route is an available route that satisfies the sum of resources of at least two services among the plurality of services if the judgment result of the first negative module is yes; The second negative module is configured to return to the first negative module if the judgment result of the first negative module is negative. 9. The device according to claim 7, wherein the restoration module comprises: A sending module, configured for the head node to send signaling to the tail node sequentially via each node on the available route, where the signaling carries: information indicating that the available route is a multi-service restoration route, and The information of each service in the service to be restored in this node; A resource module, configured for each node on the available route to reserve resources for the service to be restored according to the signaling, and to establish a cross-connection for each service in the service to be restored; A switching module, configured to switch the service to be restored to the available route. 10. The device according to claim 9, wherein the signaling is a signaling conforming to a resource reservation protocol (RSVP), and the private data of the signaling conforming to RSVP carries the indication that the available route is multiple The information of the service restoration route, and the information of each service in the service to be restored at the local node.