Abstract: A computer-implemented method of requesting a path on a flexi-grid network comprises: sending, by a path computation client (PCC), a request for a path to a path computation element (PCE), the request including the request including: a label that identifies spectrum to be restricted from use in the path; and a channel spacing field; and receiving, by the PCC and from the PCE, a response to the request, the response including an identifier of an assigned path on the flexi-grid network.

Abstract: A CNC includes a processor configured to import a VPN-specific service model for a VPN service and map the VPN-specific service model to one or more TE-specific parameters. The CNC includes a memory coupled to the processor and configured to store a mapping between a VPN ID of the VPN service and a tunnel ID of a TE tunnel established for the VPN service. The TE tunnel satisfies the one or more TE-specific parameters.

Abstract: A method including determining how many optical channel (OCh) paths are available for border node pair connections; determining which of the OCh paths satisfy a preselected latency threshold; and reporting the OCh paths that satisfy the preselected latency threshold to a service coordinator.

Abstract: A computer implemented method of configuring an optical path includes selecting with one or more processors a wavelength for the optical path, generating with one or more processors, a first request for a first type of node in the optical path, generating with one or more processors a second request for a second type of node in the optical path, the second type of node having different data plane capabilities than the first type of node, wherein the first and second requests are generated as a function of a joint configuration model accommodating both types of nodes, and sending the first request from the one or more processors to the first type of node and the second request to the second type of node to configure the optical path.

Abstract: The present disclosure discloses a protection switching method and a node. The method includes: receiving, by an intermediate node, a first protection switching request message sent by an upstream neighboring node, where the first protection switching request message is used to request to activate a first protection path, and the intermediate node is a node on the first protection path; determining, by the intermediate node, that the first protection path needs to occupy N1 timeslots, and selecting N1 timeslots for the first protection path from N2 available timeslots in a preset order; and sending, by the intermediate node, a second protection switching request message to the downstream neighboring node, where the second protection switching request message is used to request the downstream neighboring node to complete a cross-connection, on the first protection path, between the downstream neighboring node and the intermediate node based on the first group of timeslots.

Abstract: The present application provides virtual shortest path tree establishment and processing methods and a path computation element, so as to improve a resource utilization rate in a process of establishing and processing a virtual shortest path tree. In a process of establishing the virtual shortest path tree, a cost of an established path from a root node (a destination node) to a leaf node is compared with a cost threshold, and a new path branch is added to the VSPT when the cost is less than the cost threshold. In a process of processing the virtual shortest path tree, a resource occupied by a path branch in the VSPT that does not belong to an optimal path is released after the optimal path is obtained.

Abstract: A protection switching method, including sending, by a first end node, a first protection switching request message to an intermediate node in response to a fault occurring on a working trail between the first end node and a second end node, wherein a protection trail of the working trail comprises the first end node, the second end node, and at least one intermediate node, receiving, by the first end node, a second protection switching request message from the intermediate node, and switching service data to the protection trail for transmission in response to receiving the second protection switching request message, where one overhead frame of each of the first and second protection switching request messages has at least two overhead information groups, and each of the at least two overhead information groups comprises a request type field, a request signal identifier field, and a bridge flag field.

Abstract: A computer-implemented method of requesting a path on a flexi-grid network comprises: sending, by a path computation client (PCC), a request for a path to a path computation element (PCE), the request including the request including: a label that identifies spectrum to be restricted from use in the path; and a channel spacing field; and receiving, by the PCC and from the PCE, a response to the request, the response including an identifier of an assigned path on the flexi-grid network.

Abstract: A CNC includes a processor configured to import a VPN-specific service model for a VPN service and map the VPN-specific service model to one or more TE-specific parameters. The CNC includes a memory coupled to the processor and configured to store a mapping between a VPN ID of the VPN service and a tunnel ID of a TE tunnel established for the VPN service. The TE tunnel satisfies the one or more TE-specific parameters.

Abstract: A method including determining how many optical channel (OCh) paths are available for border node pair connections; determining which of the OCh paths satisfy a preselected latency threshold; and reporting the OCh paths that satisfy the preselected latency threshold to a service coordinator.

Abstract: A method including determining, for each reachable source-destination (S-D) node pair, a maximal number of optical channel (OCh) paths available for source-destination node pair connections and determining, if a preselected latency threshold is specified, for all available OCh paths a maximal number of paths satisfying the preselected latency threshold. The available OCh paths are reported to a Multi-Domain Service coordinator (MDSC).

Abstract: Embodiments of the present invention disclose a service optimization method, a transport controller (TC), a client controller (CC), and a service optimization system. The method includes: receiving, by a TC, an optimization request from a CC; sending, by the TC, an answer message to the CC when determining that an idle resource in a resource pool can meet an optimization requirement of the CC; receiving, by the TC, an optimization instruction of the CC; and optimizing, by the TC according to the optimization policy in the optimization instruction, the service identified in the optimization instruction. When an idle network resource in the resource pool can meet the optimization requirement of the CC, the TC executes the optimization policy that meets the optimization requirement of the CC, so as to reduce a service interruption phenomenon in a service optimization process.

Abstract: The present application provides virtual shortest path tree establishment and processing methods and a path computation element, so as to improve a resource utilization rate in a process of establishing and processing a virtual shortest path tree. In a process of establishing the virtual shortest path tree, a cost of an established path from a root node (a destination node) to a leaf node is compared with a cost threshold, and a new path branch is added to the VSPT when the cost is less than the cost threshold. In a process of processing the virtual shortest path tree, a resource occupied by a path branch in the VSPT that does not belong to an optimal path is released after the optimal path is obtained.

Abstract: Embodiments of the present invention provide a network path computation method, apparatus and system, where the method includes: sending, by a first node, a path computation request to a first path computation element PCE, where the path computation request includes a resource sharing object, and a head node and a last node of a first label switched path LSP; and receiving, by the first node, a path computation result that is returned by the first PCE and that is obtained by means of computation according to the resource sharing object, and establishing a second path from the head node to the last node according to the path computation result. According to the network path computation method, apparatus, and system provided in the embodiments of the present invention, link resource utilization can be improved.