Optical transport network route calculation method, route calculation apparatus, and storage medium
AssigneeZte Corporation
InventorYinqiu Jia
Life of this patent
Estimating the term…
Abstract
A route calculation method, route calculation apparatus, and storage medium for an Optical Transport Network (OTN) are disclosed. The route calculation method is applied to a path computation element (PCE), and may include: receiving a route computation request (S100); invoking a K-Shortest Path (KSP) algorithm to obtain a plurality of routing results according to the KSP algorithm, and performing resource allocation for the plurality of routing results simultaneously (S200); and determining the routing result for which the resource allocation has been completed as a candidate result, and determining a route computation result of the route computation request according to the candidate result (S300).
Claims20
A route computation method for an Optical Transport Network (OTN), applied to a Path Computation Element (PCE), the route computation method comprising:
- receiving a route computation request;
- invoking a K-Shortest Path (KSP) algorithm to obtain a plurality of routing results according to the KSP algorithm;
- allocating a respective resource allocation thread for each of the routing results, wherein the respective resource allocation thread is a hardware level computing thread;
- performing resource allocation for each of the plurality of routing results simultaneously by utilizing the respective resource allocation thread;
- defining the routing result for which the resource allocation has been completed as a candidate result;
- and
- determining a route computation result of the route computation request according to the candidate result.
A route computation apparatus for an Optical Transport Network (OTN), comprising:
- at least one processor;
- and
- a memory communicatively connected to the at least one processor,
- wherein the memory stores instructions executable by the at least one processor which, when executed by the at least one processor, causes the at least one processor to perform:
- receiving a route computation request;
- invoking a K-Shortest Path (KSP) algorithm to obtain a plurality of routing results according to the KSP algorithm;
- allocating a respective resource allocation thread for each of the routing results, wherein the respective resource allocation thread is a hardware level computing thread;
- performing resource allocation for each of the plurality of routing results simultaneously by utilizing the respective resource allocation thread;
- defining the routing result for which the resource allocation has been completed as a candidate result;
- and
- determining a route computation result of the route computation request according to the candidate result.
A non-transitory computer-readable storage medium, storing computer-executable instructions which, when executed by a computer, causes the computer to perform:
- receiving a route computation request;
- invoking a K-Shortest Path (KSP) algorithm to obtain a plurality of routing results according to the KSP algorithm;
- allocating a respective resource allocation thread for each of the routing results, wherein the respective resource allocation thread is a hardware level computing thread;
- performing resource allocation for each of the plurality of routing results simultaneously by utilizing the respective resource allocation thread;
- defining the routing result for which the resource allocation has been completed as a candidate result;
- and
- determining the routing result for which the resource allocation has been completed as a candidate result, and determining a route computation result of the route computation request according to the candidate result.
Dependencies are inferred from the claim text.