Abstract: The present application provides a method for planning a recovery resource for resisting N-time faults and an optical transmission device, and the method includes: planning, on an optical transmission device according to preset network planning information, a recovery resource for resisting (N?1)-time faults for preset (N?1)-time faults, and the recovery resource for resisting (N?1)-time faults is an optimal recovery resource corresponding to each interrupted service during the preset (N?1)-time faults; and planning, by the optical transmission device according to the network planning information and the recovery resource for resisting (N?1)-time faults, a recovery resource for resisting N-time faults for preset N-time faults, where the recovery resource for resisting N-time faults is a network-wide optimal recovery resource corresponding to interrupted services during the N-time faults.

Abstract: The present application provides a method for planning a recovery resource for resisting N-time faults and an optical transmission device, and the method includes: planning, on an optical transmission device according to preset network planning information, a recovery resource for resisting (N?1)-time faults for preset (N?1)-time faults, and the recovery resource for resisting (N?1)-time faults is an optimal recovery resource corresponding to each interrupted service during the preset (N?1)-time faults; and planning, by the optical transmission device according to the network planning information and the recovery resource for resisting (N?1)-time faults, a recovery resource for resisting N-time faults for preset N-time faults, where the recovery resource for resisting N-time faults is a network-wide optimal recovery resource corresponding to interrupted services during the N-time faults.

Abstract: A path computation method is provided. A node device and a path computation element (PCE) are also provided correspondingly. The path computation method includes: sending a path computation request message to the PCE after receiving a client-side service transmission request, the path computation request message carrying identifiers of a source node and a destination node that access a client-side service and carrying a path concatenation constraint; and receiving the path computation response message carrying path information returned by the PCE, the path information being obtained by the PCE through computation according to the identifiers of the source node and the destination node that accesses a client-side service, the concatenation constraint, and concatenation capabilities of each interface of nodes in a network. The technical solution of the present invention is simpler and more convenient, which obviously reduces the complexity of the specific implementation.

Abstract: A path computation method is provided. A node device and a path computation element (PCE) are also provided correspondingly. The path computation method includes: sending a path computation request message to the PCE after receiving a client-side service transmission request, the path computation request message carrying identifiers of a source node and a destination node that access a client-side service and carrying a path concatenation constraint; and receiving the path computation response message carrying path information returned by the PCE, the path information being obtained by the PCE through computation according to the identifiers of the source node and the destination node that accesses a client-side service, the concatenation constraint, and concatenation capabilities of each interface of nodes in a network. The technical solution of the present invention is simpler and more convenient, which obviously reduces the complexity of the specific implementation.

Abstract: A path selection method is provided, which includes the following steps. A middle domain determines a path cost of an inter-domain link from the middle domain to a destination node domain according to a received path cost of an inter-domain link sent by a source node domain, and then sends the path cost to the destination node domain. The middle domain receives an optimal service path from the destination node domain to a destination node returned from the destination node domain, in which the optimal service path is determined according to the path cost of inter-domain link sent by the middle domain, and determines an optimal service path from the middle domain to the destination node according to the received optimal service path and sends the optimal service path to the source node domain, for making the source node domain determine an optimal service path from a source node to the destination node according to the optimal service path sent by the middle domain.