WO2012071909A1

WO2012071909A1 - Method and device for service recovery

Info

Publication number: WO2012071909A1
Application number: PCT/CN2011/078822
Authority: WO
Inventors: 王煊; 张锐
Original assignee: 中兴通讯股份有限公司
Priority date: 2010-12-02
Filing date: 2011-08-24
Publication date: 2012-06-07
Also published as: CN102487329B; CN102487329A

Abstract

Disclosed are a method and device for service recovery. The method for service recovery includes: determining that the bearer links of a plurality of services have faults, with a plurality of services having the same head node and tail node; determining that there is at least one available route between the head node and the tail node, with the resources of the available route meeting the sum of the resources of the plurality of services or the sum of the resources of at least two services in the plurality of services; and recovering the plurality of services or the at least two services which have faults using the available route. By way of the present invention, the effects of reducing service recovery time and improving service recovery efficiency can be achieved.

Description

TECHNICAL FIELD The present invention relates to the field of communications, and in particular to a service recovery method and apparatus. Background Art With the development of optical transmission technology, ASON (Automatic Switched Optical Network) has become the next development direction of optical transmission. Compared with the traditional optical transport network, AS0N introduces a distributed intelligent control plane, which combines transmission, switching and data networks to achieve true routing setup, end-to-end service scheduling and network automatic recovery.

The emergence of AS0N provides automated control for traffic engineering and business management. On the basis of the original management plane and transmission plane of the traditional SDH (Synchronous Digital Hierarchy) network, AS0N introduces an independent control plane, which is supported by three aspects: link resource management technology, routing technology, and signaling technology. The system construction of the AS0N control plane enables the automatic discovery of neighbors, the automatic generation of the entire network topology, and the automatic creation of service paths. This greatly reduces the complexity of manually assigning labels and establishing crossovers, and rationalizes the allocation of network bandwidth resources. And use. In terms of network survivability, the ASON network adopts a combination of a transport plane protection mechanism and a control plane protection recovery mechanism to protect and recover services according to different network protection features and service levels, reflecting the ASON network in the service. Great advantage in protecting recovery. For a non-protected service that is ubiquitous in an ASON network, once a link that the service passes fails, the service needs to be restored. A common method is to dynamically establish a new LSP that is the same as the first and last nodes of the original LSP (Label Switched Path) and then switch the service from the failed LSP to the new LSP. When performing service recovery, the operations performed by the first node of the service are as follows: First, the constraint-based route calculation is performed according to the traffic engineering characteristics of the service, and a path that satisfies the requirement is obtained, that is, a series of ordered nodes and a combination of links; A signaling protocol such as RSVP-TE (Resource Reservation Protocol-Traffic Engineering) is used to initiate an LSP on the path obtained by querying, and resource reservation and label allocation are performed at each node. The cross is delivered to the transport plane, thereby establishing a recovery connection and switching the service affected by the fault to the LSP. If there are multiple services on the head node that need to be restored, you need to establish a recovery connection for each service according to the above procedure, which will cause the following problems:

(1), affected by information flooding and convergence speed of routing protocols such as OSPF-TE (Open Shortest Path First ( Protocol) - Traffic Engineering, Open Shortest Path First Protocol based on traffic engineering), resulting in competition for restoration of connection resources The possibility is greater.

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

(3), the same operational flow is performed multiple times, especially when the crossover operation is sent to the transmission plane. Whether it is resource competition, label competition, or the cost of cross-operation, it will eventually lead to excessive time-consuming recovery of all services. Therefore, if a faulty link carries more services, each service needs to be restored separately. It takes a lot of time, which seriously affects the ASON recovery efficiency and becomes a bottleneck affecting ASON performance. SUMMARY OF THE INVENTION A primary object of the present invention is to provide a service recovery method and apparatus, which at least solve the problem that the above-mentioned service recovery takes a long time and the recovery efficiency is low. According to an aspect of the present invention, a service recovery method is provided, including: determining that a bearer link of multiple services is faulty, the multiple services have the same head node and tail node; determining that a relationship exists between the first node and the tail node At least one available route, the resource of the one available route satisfies the sum of resources of multiple services, or the sum of resources of at least two services in multiple services; uses the available routes to recover multiple services or at least two services that fail. Preferably, the step of determining that there is at least one available route between the first node and the tail node comprises: determining whether there is at least one available route between the first node and the tail node, and the resource of the one available route satisfies the sum of resources of the plurality of services; If yes, the available route is determined to be an available route that satisfies the sum of the resources of the multiple services; if not, the part of the resource is reduced from the sum of the resources according to the predetermined rule, and whether the relationship between the first node and the tail node is determined according to the sum of the reduced resources There is at least one available route that satisfies the sum of the reduced resources; if yes, determining that the available route is an available route that satisfies the sum of resources of at least two of the plurality of services; if not, returning from the sum of the resources according to the predetermined rule Reducing part of the resources, and determining, according to the total of the reduced resources, whether there is at least one available route that satisfies the sum of the reduced resources between the first node and the tail node. Preferably, the step of recovering the failed multiple services or the at least two services by using the available routes includes: the first node sequentially sends signaling to the tail node via each node on the available route, where the signaling carries: indicating that the available route is Multi-service recovery routing information, and information of each service in the service to be recovered at the local node; each node on the available route reserves resources for the service to be recovered according to the signaling, and is each of the services to be recovered The services establish cross-connections; switch the services to be restored to available routes. Preferably, the signaling is signaling conforming to the resource reservation protocol RSVP, and the private data that uses the RSVP-compliant signaling carries information indicating that the available route is a multi-service recovery route, and each service in the service to be recovered is in the local node. information. Preferably, the information of each service in the service to be restored includes: a service identifier of each service in the service to be restored, a label occupied by the local node in the service to be restored, and a service to be restored. The service outgoing port of each service at the local node, and the label occupied by each service at the tail node in the service to be recovered. Preferably, the foregoing service is an unprotected service in an automatic switched optical network. According to another aspect of the present invention, a service recovery apparatus is provided, including: a first determining module, configured to determine that a bearer link of multiple services is faulty, the multiple services having the same head node and tail node; a determining module, configured to determine that there is at least one available route between the first node and the tail node, the resource of the available route satisfies the sum of resources of multiple services, or the sum of resources of at least two services in multiple services; , set to use the available routes to recover multiple services or at least two services that have failed. Preferably, the second determining module comprises: a determining module, configured to determine whether there is at least one available route between the first node and the tail node, the resource of the one available route satisfies the sum of resources of the plurality of services; the first affirmative module is set to If the judgment result of the judging module is yes, determining that the available route is an available route that satisfies the sum of resources of the plurality of services; the first negation module is configured to: if the judgment result of the judging module is no, the sum of resources from the sum according to the predetermined rule Reducing part of the resources, and determining, according to the total of the reduced resources, whether there is at least one available route that satisfies the sum of the reduced resources between the first node and the tail node; and the second affirmative module is set to be that if the first negative module determines that the result is yes, Then determining that the available route is an available route that satisfies the sum of resources of at least two services of the multiple services; and the second negating module is configured to return to the first negative module if the determination result of the first negative module is negative. Preferably, the recovery module includes: a sending module, configured to send, by the first node, the signaling to the tail node through the nodes on the available route, where the signaling carries: information indicating that the available route is a multi-service recovery route, and waiting The information of each service in the restored service is in the information of the node; the resource module sets each node on the available route to reserve resources for the service to be restored according to the signaling, and establishes a cross for each service in the service to be restored. Connection; The switch module is set to switch the service to be recovered to an available route. Preferably, the signaling is signaling conforming to the resource reservation protocol RSVP, and the private data following the signaling of the RSVP carries information indicating that the available route is a multi-service recovery route, and information of each service in the service to be recovered is in the node. . According to the present invention, when multiple services having the same head node and tail node fail, another resource is selected from the head node and the tail node to satisfy the available route of the resource occupied by the failed multiple services, or Select one of the multiple such routes, and recover multiple services that fail at the same time, without having to recover each service separately, thereby reducing the possibility of label competition and resource competition, and only need to recover multiple services in batches. A cross-connection is sent to the transport plane, which greatly reduces the time required for service recovery, improves recovery efficiency, and solves the problem of long service recovery and low recovery efficiency when multiple services are faulty in the prior art. Reduce the time for business recovery and improve the efficiency of business recovery. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are set to illustrate,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a flow chart showing the steps of a service recovery method according to a first embodiment of the present invention; FIG. 2 is a flow chart showing the steps of a service recovery method according to a second embodiment 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; FIG. 5 is a service recovery method according to Embodiment 5 of the present invention; FIG. 6 is a structural block diagram of a service recovery apparatus according to Embodiment 6 of the present invention; and FIG. 7 is a structural block diagram of a service recovery apparatus according to Embodiment 7 of the present invention. BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict. Referring to FIG. 1, a flow chart of steps of a service recovery method according to Embodiment 1 of the present invention includes the following steps: Step S102: Determine that a bearer link of multiple services fails; where multiple services have the same first node and tail node. Step S104: It is determined that there is at least one available route between the first node and the tail node. The resource of the one available route satisfies the sum of resources of multiple services, or the sum of resources of at least two services of multiple services. Between the first node and the tail node of multiple services, there may be only one available route that meets the sum of the resources of multiple services. You can use this route to recover multiple services. There may also be multiple resources to satisfy multiple services. The available route of the sum of resources, at this time, one of the routes can be selected according to a predetermined rule for multi-service recovery. Of course, if there is only one route, and the resources of the route can only meet some of the services, the part of the service includes at least two services. In this case, the route can be used to recover some services in multiple services; There are multiple available routes between the first node and the tail node, but none of the routes can satisfy the resources of multiple services at the same time. In this case, one of the routes can be used to recover some services, and then the other available routes can be used to recover the remaining services. . Step S106: Restore the failed multiple services or at least two services by using the available routes. In the related art, when multiple services fail, each service needs to be restored separately. Therefore, the service recovery time is long and the recovery efficiency is low. With this embodiment, when multiple services having the same first node and the tail node fail, a resource is selected from the first node and the tail node to satisfy the available routes of the resources occupied by the failed multiple services or part of the services. At the same time, the faulty service is restored, and each service is not required to be restored separately, thereby reducing the possibility of label competition and resource competition. Moreover, in the case of multi-service batch recovery, only a cross-connection is required to be sent to the transport plane, which greatly reduces The time required for service recovery improves the recovery efficiency, and solves the problem of long service recovery time and low recovery efficiency when multiple services are faulty in the prior art, thereby achieving the effect of reducing service recovery time and improving service recovery efficiency. . Referring to FIG. 2, a flowchart of a step of a service recovery method according to Embodiment 2 of the present invention is shown. The present embodiment is directed to an unprotected service, and includes the following steps: Step S202: Fault detection. That is, the link detecting multiple services fails. When a link fails, the first node of all services carried on this link detects the occurrence of a fault and prepares to initiate a service recovery operation. Of course, it is also possible that multiple links fail at the same time. In this case, all services carried on the multiple links cannot be performed normally, and the first node of the multiple services detects the occurrence of the fault, and is ready to perform service recovery. Step S204: Policy judgment. That is, it is determined whether the first and last nodes of the plurality of services whose links are faulty are the same. When the services to be restored 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 the first and last nodes of the service are the same, the same service of the first and last nodes is also applicable to the bulk service recovery in this embodiment. In this embodiment, only a plurality of services that have failed have the same first and last nodes as an example. Step S206: Routing query. The first node performs routing query with the bandwidth sum of L1, L2...Ln and other routing constraints as a new constraint, and queries an available path from the first node to the last node, and the resources of the available path satisfy Ll, L2. The sum of the resources of Ln (that is, the bandwidth of the available path satisfies the sum of the bandwidths of L1, L2..丄n), then the number of connections for the final batch recovery is m, and m = n at this time, proceeds to the next step S208. In this embodiment, the bandwidth resource is taken as an example, and the sum of the bandwidths is the main constraint. However, in the actual application, the technical personnel in the field can perform routing query with resources of other engineering traffic characteristics and other constraints as needed, and the present invention does not limit. If the route query fails due to resource limitations in the entire network, the bandwidth constraint can be reduced and the route query can be re-initiated. In this case, the query result may be that m (Km<n) connections share a path, and m connections are still The recovery can be performed by using the batch recovery policy, and the process proceeds to the next step S208. In the worst case, m=l, that is, any two connections cannot share one path. In this case, the bulk recovery policy cannot be implemented, and each connection can only be independently restored, and the process proceeds to step S214. Step S208: The first node processes. The first node initiates a new connection P using the RSVP protocol on the available path, and the RSVP connected here.

In the PATH signaling, the traffic engineering object SENDER TSPEC includes the total bandwidth parameter that is successfully queried in step S206. The private data of the RSVP PATH signaling carries the following information: The attribute of the connection P is a bulk recovery connection (that is, the route is a multi-service recovery route) The connections to be restored are Ll, L2...Lm, LI, L2..丄m the labels occupied by the node and the respective service outgoing ports and tag information occupied at the tail nodes. Step S210: Non-first node processing. At each node through which the P is connected, the connection control module performs resource reservation according to the relevant information in the private data of the RSVP PATH signaling, and establishes a cross-connection in the transmission plane for each service that needs to be recovered. Step S212: Service switching. After the connection P is successfully established, the services carried on the original L1, L2, Lm connection can be switched to the new connection P. The original faulty connection can be deleted or retained according to the service policy, thereby realizing the recovery of the bulk service. Step S214: The process ends. In this embodiment, a scenario in which a batch service of an unprotected service is simultaneously restored is adopted, and a strategy of sharing a path by multiple services is adopted, that is, a plurality of smaller "pipes" are merged into one large "pipe" for processing, thereby greatly Reduce the possibility of label competition. Moreover, compared with the fact that each connection is separately restored and needs to be cross-connected to the transport plane multiple times, the cross-connection is sent to the transport plane in the case of batch recovery, which is completed once, thereby greatly reducing the time required for service recovery and improving the time. Restore efficiency. The technical solution of the 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, and transmits the information required for bulk service recovery between the network elements, and the implementation method is simple. Referring to FIG. 3, a flow chart of steps of a service recovery method according to Embodiment 3 of the present invention is shown. In this embodiment, taking M services as an example, where N services have the same first and last nodes, M>N≥2. The service recovery method in this embodiment includes the following steps: Step S302: The first node receives the alarm information. In this embodiment, when M services fail, since only some of the multiple services have the same first and last nodes, at least two of the first nodes receive the alarm information. This embodiment is described by taking one of the head nodes as an example. Step S304: The first node determines that the number of co-tail node connections affected by the fault is N. Step S306: The first node determines whether N is greater than 1, if yes, step S310 is performed; if no, step S308 is performed. In the present embodiment, N ≥ 2, so step S310 is performed. Step S308: The processing is resumed by using a single connection, and the process ends. Step S310: Perform routing query by using the sum of bandwidths of the N connections. Those skilled in the art can also perform routing queries with other parameters based on traffic engineering characteristics. Step S312: determining whether the route query is successful, if yes, executing step S314; if not, executing step S316. Step S314: Send a signaling connection on the new path, and the process ends. Step S316: N=N-1. Step S318: It is judged whether N is equal to 0, and if not, returns to step S310; if yes, the flow ends. Referring to FIG. 4, a flow chart of steps of a service recovery method according to Embodiment 4 of the present invention is shown, which includes the following steps: Step S402: Determine that a bearer link of multiple services fails. In this embodiment, multiple services have the same head node and tail node. Step S404: It is determined that there are multiple available routes between the first node and the tail node. The resources of each of the plurality of available routes satisfy the sum of the resources of the multiple services. Step S406: Determine one of the plurality of available routes to recover the service. When there are multiple available routes between the same first and last nodes, one of them can be selected according to a preset rule. The pre-set rule may be any suitable rule (such as random selection, etc.), which is not limited by the present invention. In this embodiment, an available route is randomly determined from a plurality of available routes. Step S408: Restore the failed multiple services by using the determined available routes. It should be noted that if there are multiple available routes between the same first and last nodes, but none of the available routes meets the sum of resources of multiple services, one of them can be used to recover part of the service, and the other is used to recover another service. For example, if five services with the same first and last nodes fail, if there are two available routes A and B between the first and last nodes, then if the resources of A satisfy the sum of the resources of the first three services, then use Route A recovers the first three services; and then determines whether the resources of B satisfy the sum of the resources of the remaining two services. If yes, use B to recover the remaining two services. At this time, compared with the recovery of the existing single service, the service recovery time is still shortened, and the service recovery efficiency is improved. Referring to FIG. 5, a schematic diagram of an ASON network topology in a service recovery method according to Embodiment 5 of the present invention is shown. As shown in FIG. 5, the ASON network of this embodiment includes seven network elements A, B, C, D, E, F, and G, and the connection between the network elements represents a link. There are four LSPs in the network, namely L1, L2, L3, and P L4. The corresponding connection IDs are id_l, id_2, id_3, and id_4. The path that LI and L2 pass is A—B—C—G—D, The path that L3 and L4 pass is A-F-B_C-D. There is only one data link between NEs B and C. The four LSPs pass through this link. The bandwidth of the four LSPs is STM-1 (where STM indicates the bandwidth level), and there is a link between the network element and E and between the network elements E and D. The idle bandwidth on the link is STM-4. The service ingress ports of the network elements A, L1, L2, L3, and P L4 are inport_l, inport_2, inport_3, and inport_4, respectively. The service inbound labels are inlabel_l, inlabel_2, inlabel_3, and inlabel_4, respectively. Pa2, Pa3 and P Pa4, the business labels are Lal, La2, La3 and P La4. In the label forwarding table of NE A, the label forwarding entries corresponding to L1, L2, L3, and L4 are as follows:

The service ingress ports of the network elements D, L1, L2, L3, and L4 are respectively Pd3, Pd4, Pdl, and P Pd2, and the service inbound labels are Ld3, Ld4, Ldl, and P Ld2, respectively, and the corresponding service out ports are outport_l, respectively. Outport_2, outport_3, and P outport_4, the service out tags are outlabel_l, outlabel_2, outlabel_3, and outlabel 4. In the label forwarding table of the network element D, the label forwarding entries corresponding to L1, L2, L3, and L4 are as follows:

After the link between the NEs B and C fails, the services carried on the four LSPs are affected. The faulty link information is transmitted to the first-party NE A of the service through the OAM (Operation Administration and Maintenance) mechanism or the RSVP NOTIFY message. After receiving the link fault information, NE A can determine L1, L2, and L3. The services carried on the four LSPs of the L4 need to be restored. Since L1, L2, L3, and L4 have the same head-to-end node, the four LSPs can be restored using the multi-service bulk recovery policy, including: (1) With the network element A as the first node and the network element D as the tail node, the total bandwidth of the four LSPs is used as the bandwidth constraint for routing query. The bandwidth of each LSP is STM-1, so STM-4 is used as the new one. Constraints for routing queries.

(2) According to the network topology, the link idle bandwidth between the link between the network elements A and E and the network elements E and D is STM-4, so the path A-E-D is a routing constraint. search result.

(3) The network element A initiates the establishment of a new LSP by using the RSVP protocol on the path A-E-D, which is expressed as

L5.

(4) The Pa5 port contains 4 free STM-1 bandwidths, and the corresponding labels are label-1, label-2, label-3, and label-4, and label-l, label-2, label-3, and label -4 is sorted in ascending numerical order, assuming label-l< label-2< label-3< label-4; id_l, id_2, id_3, and id_4 are sorted in ascending numerical order, assuming id_l < id_2< id_3< id_4. Label-l, label-2, label-3, and label-4 are assigned to LI, L2, L3, and P L4, respectively, according to the rule that the smaller connection ID corresponds to the smaller label number. The network element A sends the following information to the private data of the PATH message of the network element E:

A) The attribute of the connection L5 is a multi-service batch recovery connection; B) L5 contains four sub-connections, namely L1, L2, L3, and P L4, and the corresponding connection IDs are id_l, id_2, id_3, and id_4, respectively, and the occupied labels are Label-l, label-2, label-3 and label-4;

C) The service outgoing ports corresponding to L1, L2, L3, and P L4 are outport_l, outport_2, outport_3, and outport_4, respectively, and the corresponding outgoing labels are outlabel_l, outlabel_2, outlabel_3, and P outlabel_4.

(5) The network element A reserves the STM-4 resource on the port Pa5, and sends the RSVP PATH message to the network element E. At this time, the network element A forms the following label forwarding table:

(6) After receiving the RSVP PATH message sent by the network element A, the network element E determines that the L5 is a multi-service batch recovery connection according to the content in the private data, and at the same time, the label label-l, label-2 on the ingress port Pel. Label-3 and label-4 are assigned to four sub-connections Ll, L2, L3, and L4, respectively.

(7) The network element E obtains the next hop of the L5 as the network element D and the egress port is Pe2 according to the ERO object in the RSVP PATH message. The Pe2 port contains four idle STM-1 bandwidths, and the corresponding labels are label- 5, label-6, label-7 and label-8, label-5, label-6, label-7 and label-8 are sorted in ascending order, assuming label-5< label-6< Label-7< label-8. Label-5, label-6, label-7, and label-8 are assigned to LI, L2, L3, and P L4, respectively, according to the rule that the smaller connection ID corresponds to the smaller label number. The private data of the PATH message carries the following information: A) The attribute of the connection L5 is a multi-service batch recovery connection;

B) L5 contains four sub-connections, namely Ll, L2, L3 and L4. The corresponding connection IDs are id_l, id_2, id_3 and id_4, respectively, and the occupied labels are label-5, label-6, label-7 Port label-8;

C) The service outgoing ports corresponding to L1, L2, L3, and P L4 are outport_l, outport_2, outport_3, and outport_4, respectively, and the corresponding outgoing labels are outlabel_l, outlabel_2, outlabel_3, and P outlabel_4. (8) The network element E reserves resources on the Pe2 port and sends the RSVP PATH message to the network element D. At this time, the network element E forms the following label forwarding table:

(9) After receiving the RSVP PATH message sent by the network element E, the network element D determines that the L5 is a batch recovery connection according to the content in the private data, and at the same time, the label label-5 label-6 label-7 on the port Pd5 and Label-8 is assigned to four sub-connections LI, L2, L3, and P L4, respectively.

(10) The 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 In port In label Out port Out label

Id_l Pd5 label-5 outport l outlabel l 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) The network element D sends an RSVP RESV message to the network element E, and the LABEL field in the message is filled in 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 RSVP PATH message.

(12) The network element E verifies that the resource reservation on the port Pe2 is successful according to the private data content in the RSVP RESV message, and then sends an RSVP RESV message to the network element A, and the content of the LABEL object in the message is filled in as a special value 0XFFFF, the message The content of the private data is the same as the private data in the received RSVP PATH message.

(13) The network element A checks the resource reservation on the port Pa5 according to the private data content in the RSVP RESV message, and the L5 connection is successfully established, and the services on L1, L2, L3, and L4 are switched to L5, and Ll, L2, L3, and L4 are deleted, the batch service is successfully restored, and the entire process ends. Referring to FIG. 6, a structural block diagram of a service recovery apparatus according to Embodiment 6 of the present invention is shown, including: a first determining module 602, configured to determine that a bearer link of multiple services is faulty, where multiple services have The same first node and the tail node; the second determining module 604 is configured to determine that at least one available route exists between the first node and the tail node, and the resource of the one available route satisfies the sum of resources of multiple services, or meets multiple services. A sum of resources of at least two services; a recovery module 606, configured to recover a failed multiple services or at least two services using an available route. Preferably, referring to FIG. 7, a structural block diagram of a service recovery apparatus according to Embodiment 7 of the present invention is shown. The service recovery apparatus of this embodiment adopts the following preferred structure based on the service recovery apparatus shown in FIG. 6. Preferably, the second determining module 604 includes: a determining module 6042, configured to determine whether there is at least one available route between the first node and the tail node, where the resources of the one available route satisfy the sum of resources of the multiple services; 6044, if the judgment result of the judging module is yes, determining that the available route is an available route that satisfies a sum of resources of the plurality of services; and the first negation module 6046 is configured to: if the judgment result of the judging module is no, according to the predetermined The rule reduces part of the resources from the sum of resources, and judges whether there is at least one available route between the first node and the tail node that satisfies the sum of the reduced resources according to the sum of the reduced resources; the second affirmation module 6048 is configured to use the first negative module. If the result of the determination is yes, the available route is determined to be an available route that satisfies the sum of the resources of the at least two services of the multiple services. The second negation module 60410 is configured to: if the result of the first negative module is negative, return The first negative module. Preferably, the recovery module 606 includes: a sending module 6062, configured to send, by the node on the available route, the signaling to the tail node in turn, where the signaling carries: information indicating that the available route is a multi-service recovery route, and waiting The information of each service in the restored service is in the information of the local node; the resource module 6064, each node on the available route reserves resources for the service to be recovered according to the signaling, and establishes for each service in the service to be restored. A cross-connect; a switching module 6066, configured to switch the service to be restored to an available route. Preferably, the signaling is RSVP-compliant signaling, and the private data following the RSVP signaling carries information indicating that the available route is a multi-service recovery route, and information of each service in the service to be recovered is in the local node. Preferably, the information of each service in the service to be restored includes: a service identifier of each service in the service to be restored, a label occupied by the local node in the service to be restored, and a service to be restored. The service outgoing port of each service at the local node, and the label occupied by each service at the tail node in the service to be recovered. Preferably, the foregoing service is an unprotected service in the ASON. The method implemented in this embodiment can refer to the related description of the foregoing multiple method embodiments, and has the beneficial effects of the foregoing embodiments, and details are not described herein again. It should be noted that, in the above multiple embodiments, the unprotected service in the ASON is taken as an example, but those skilled in the art should understand that the present invention is equally applicable to the protected service and is applicable to the ASON-free. Packet switching services in the network. In the above description, it can be seen that the method and apparatus for multi-service batch recovery in the field of optical communication, especially for the ASON field, solves the problem that the multi-service recovery in the prior art is time-consuming, Low efficiency, as well as label competition and resource competition, greatly improve multi-service recovery efficiency and shorten multi-service recovery time. Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein. The steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Claims

Claim

1. A method of business recovery, including:

Determining that a bearer link of multiple services fails, the multiple services having the same head node and tail node;

Determining that there is at least one available route between the first node and the tail node, where the resources of the one available route satisfy the sum of resources of the multiple services, or the sum of resources of at least two services of the multiple services;

Recovering the failed multiple services or the at least two services using the available routes.

2. The method according to claim 1, wherein the determining that there is at least one available route between the head node and the tail node comprises:

Determining whether there is at least one available route between the first node and the tail node, where the resources of the one available route satisfy the sum of resources of the multiple services;

If yes, determining that the available route is an available route that satisfies the sum of the resources of the multiple services; if not, reducing a part of the resources from the sum of the resources according to a predetermined rule, and determining, according to the sum of the reduced resources Whether there is at least one available route between the head node and the tail node that satisfies the sum of the reduced resources;

If yes, determining that the available route is an available route that satisfies a sum of resources of at least two services of the multiple services; if not, returning, according to a predetermined rule, reducing a part of resources from the sum of the resources, according to the The reduced sum of resources determines whether there is at least one available route between the head node and the tail node that satisfies the sum of the reduced resources.

3. The method according to claim 1, wherein the step of recovering the failed multiple services or the at least two services using the available route comprises:

The first node sends signaling to the tail node in turn through the nodes on the available route, where the signaling carries: information indicating that the available route is a multi-service recovery route, and the service to be restored Information about 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;

Switching the to-be-recovered service to the available route.

The method according to claim 3, wherein the signaling is signaling complying with a resource reservation protocol RSVP, and the private data carrying the RSVP-compliant signaling carries the indication that the available route is a multi-service The information of the restored route, and the information of each service in the node to be recovered in the service.

The method according to claim 3, wherein the information of each service in the service to be restored is: the service identifier of each service in the service to be restored, the service to be restored a label occupied by each of the services in the node, a service out port of each service in the service to be restored, and a label occupied by each of the services to be recovered in the tail node.

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 business recovery device, including:

a first determining module, configured to determine that a bearer link of multiple services is faulty, where the multiple services have the same first node and a tail node;

a second determining module, configured to determine that at least one available route exists between the first node and the tail node, where the resource of the one available route satisfies a sum of resources of the multiple services, or at least two of the multiple services a sum of resources of the services; a recovery module configured to recover the failed plurality of services or the at least two services using the available routes.

The device according to claim 7, wherein the second determining module comprises:

a judging module, configured to determine whether there is at least one available route between the first node and the tail node, where the resources of the one available route satisfy the sum of resources of the multiple services;

a first affirmative module, configured to determine, if the determination result of the determining module is yes, the available route as an available route that satisfies a sum of resources of the multiple services;

a first negation module, configured to: if the judgment result of the judging module is no, reduce a part of resources from the sum of resources according to a predetermined rule, and determine, between the first node and the tail node, according to the sum of the reduced resources Whether there is at least one available route that satisfies the sum of the reduced resources;

a second affirmative module, configured to: if the determination result of the first negative module is yes, determining that the available route is an available route that satisfies a sum of resources of at least two services in the multiple services;

The second negation module is configured to return to the first negation module if the determination result of the first negation module is no. The apparatus according to claim 7, wherein the recovery module comprises: a sending module, configured to: the first node sequentially sends signaling to the tail node via each node on the available route, where the signaling is in the signaling Carrying information indicating that the available route is a multi-service recovery route, and information of each service in the service to be restored at the local node;

a resource module, configured to reserve resources for the service to be restored according to the signaling according to the signaling, and establish a cross connection for each service in the service to be restored;

And a switching module, configured to switch the service to be restored to the available route. The device according to claim 9, wherein the signaling is signaling complying with a resource reservation protocol RSVP, and the private data of the RSVP-compliant signaling carries the indication that the available route is a multi-service recovery route Information, and information about each service in the node to be recovered in the service.