Technique for selecting a path computation element based on response time delay
A technique efficiently selects a path computation element (PCE) to compute a path between nodes of a computer network. The PCE selection technique is illustratively based on dynamic advertisements of the PCE's available path computation resources, namely a predictive response time (PRT). To that end, the novel technique enables one or more PCEs to dynamically send (advertise) their available path computation resources to one or more path computation clients (PCCs). In addition, the technique enables the PCC to efficiently select a PCE (or set of PCEs) to service a path computation request based upon those available resources.
1. An apparatus comprising:
a network interface configured to:
send a path computation request to at least one path computation element (PCE), the path computation request carrying a maximum response time (MRT); and
receive a computed path between nodes of a computer network from the PCE; and
a processor configured to:
select an alternate PCE to service the path computation request; and
compute a path between nodes of the computer network, in the event the at least one PCE indicates an inability to comply with the MRT.
2. The apparatus of claim 1 , wherein the processor is further configured to determine if the alternate PCE has less congestion than the at least one PCE.
3. The apparatus of claim 1 , wherein the network interface is further configured to send a message to the at least one PCE in order to clear the path computation request.
4. The apparatus of claim 1 , wherein the network interface is further configured to redirect at least one of the path computation request or future path computation requests to the alternate PCE.
5. The apparatus of claim 1 , wherein the processor is further configured to assign values to the MRT according to types of path computation requests.
6. The apparatus of claim 5 , wherein the processor is further configured to assign shorter MRTs to types with higher priorities.
7. The apparatus of claim 1 , wherein the network interface is further configured to:
receive a predictive response time (PRT) from the at least one PCE to the path computation request; and
distribute subsequent path computation requests proportionally among the at least one PCE based on the PRTs of the at least one PCE.
8. A method comprising:
sending a path computation request to at least one path computation element (PCE), the path computation request carrying a maximum response time (MRT);
receiving a computed path between nodes of a computer network from the PCE;
selecting an alternate PCE to service the path computation request; and
computing a path between nodes of the computer network, in the event the at least one PCE indicates an inability to comply with the MRT.
9. The method of claim 8 , further comprising determining if the alternate PCE has less congestion than the at least one PCE.
10. The method of claim 8 , further comprising sending a message to the at least one PCE in order to clear the path computation request.
11. The method of claim 8 , further comprising redirecting at least one of the path computation request or future path computation requests to the alternate PCE.
12. The method of claim 8 , further comprising assigning values to the MRT according to types of path computation requests.
13. The method of claim 12 , wherein assigning values to the MRT according to types of path computation requests further includes assigning shorter MRTs to types with higher priorities.
14. The method of claim 8 , further comprising:
receiving a predictive response time (PRT) from the at least one PCE to the path computation request; and
distributing subsequent path computation requests proportionally among the at least one PCE based on the PRTs of the at least one PCE.
15. A non-transitory computer-readable storage medium having stored therein instructions which, when executed by a processor, cause the processor to perform operations comprising:
selecting an alternate path computation element (PCE) to service a path computation request, the path computation request sent to at least one PCE and carrying a maximum response time (MRT); and
computing a path between nodes of a computer network, in the event the at least one PCE indicates an inability to comply with the MRT.
16. The non-transitory computer-readable storage medium of claim 15 , storing additional instructions which, when executed by the processor, result in operations further comprising determining if the alternate PCE has less congestion than the at least one PCE.
17. The non-transitory computer-readable storage medium of claim 15 , storing additional instructions which, when executed by the processor, result in operations further comprising assigning values to the MRT according to types of path computation requests.
18. The non-transitory computer-readable storage medium of claim 17 , wherein assigning values to the MRT according to types of path computation requests further includes assigning shorter MRTs to types with higher priorities.
19. The non-transitory computer-readable storage medium of claim 15 , storing additional instructions which, when executed by the processor, result in operations further comprising selecting a preferred PCE based on a predictive response time (PRT) of the at least one PCE, the selected PCE to service the path computation request and compute the path between the nodes of the computer network.
20. The non-transitory computer-readable storage medium of claim 19 , storing additional instructions which, when executed by the processor, result in operations further comprising determining subsequent path computation requests to be distributed proportionally among the at least one PCE based on the PRTs of the at least one PCE.