Dynamic signaling of bypass tunnel based on bandwidth threshold at a point of local repair

1. A point of local repair device, comprising:

one or more memories, and

one or more processors, operatively coupled to the one or more memories, to:

receive information that identifies a bandwidth value of a primary label-switched path (LSP) that includes a protected link or a protected node;

determine a bypass LSP available bandwidth threshold based on the bandwidth value;

determine a set of path bandwidth values associated with a set of paths;

compare the set of path bandwidth values and the bypass LSP available bandwidth threshold;

select a path, of the set of paths, based on comparing the set of path bandwidth values and the bypass LSP available bandwidth threshold;

wherein the one or more processors, when selecting the path:

determine that none of the paths, of the set of paths, has a bandwidth value that satisfies the bypass LSP available bandwidth threshold;

identify a candidate path, of the set of paths, that has a greatest available bandwidth value among the paths in the set of paths, and

select the identified candidate path, as the path, based on the identified candidate path having the greatest available bandwidth value; and

generate a bypass LSP using the path, wherein the bypass LSP is used when a link of the primary LSP fails,

wherein the bypass LSP is generated without reserving bandwidth of the path.

2. The point of local repair device of claim 1 , where the one or more processors are further to:

determine that multiple candidate paths, of the set of paths, have a same greatest available bandwidth value;

identify a particular path, of the multiple candidate paths, that includes a least number of hops as compared to other paths of the multiple candidate paths; and

select the particular path, as the path, based on the particular path including the least number of hops.

3. The point of local repair device of claim 1 , where the bandwidth value of the primary LSP includes a reserved bandwidth value.

4. The point of local repair device of claim 1 , where the one or more processors are further to:

determine whether the bypass LSP includes an available bandwidth value that satisfies the bypass LSP available bandwidth threshold after generating the bypass LSP; and

selectively generate another bypass LSP based on whether the available bandwidth value satisfies the bypass LSP available bandwidth threshold.

5. The point of local repair device of claim 1 , where the bypass LSP available bandwidth threshold is determined based at least in part on a reserved bandwidth of the primary LSP.

6. The point of local repair device of claim 1 , where the bypass LSP available bandwidth threshold is determined based at least in part on paths within the primary LSP for which link protection is enabled.

7. The point of local repair device of claim 1 , where the bypass LSP available bandwidth threshold is determined based at least in part on a total reserved bandwidth value of paths within the primary LSP.

8. A non-transitory computer-readable medium storing instructions, the instructions comprising:

one or more instructions that, when executed by one or more processors, cause the one or more processors to:

receive information that identifies a bandwidth value of a primary label-switched path (LSP) that includes a protected link or a protected node;

determine a bypass LSP available bandwidth threshold based on the bandwidth value;

determine a set of path bandwidth values associated with a set of paths;

compare the set of path bandwidth values and the bypass LSP available bandwidth threshold;

select a path, of the set of paths, based on comparing the set of path bandwidth values and the bypass LSP available bandwidth threshold;

wherein the one or more instructions that cause the one or more processors to select the path, cause the one or more processors to:

determine that none of the paths, of the set of paths, has a bandwidth value that satisfies the bypass LSP available bandwidth threshold,

identify a candidate path, of the set of paths, that has a greatest available bandwidth value, and

select the identified candidate path, as the path, based on the identified candidate path having the greatest available bandwidth value;

generate a bypass LSP using the path, wherein the bypass LSP is to be used when a link of the primary LSP fails,

wherein the bypass LSP is generated without reserving bandwidth of the path; and

provide, based on a link of the primary LSP failing, network traffic using the bypass LSP.

9. The non-transitory computer-readable medium of claim 8 , wherein the one or more instructions that cause the one or more processors to select the path, cause the one or more processors to:

determine that multiple candidate paths, of the set of paths, have a same greatest available bandwidth value;

identify a particular path, of the multiple candidate paths, that includes a least number of hops as compared to other candidate paths of the multiple candidate paths; and

select the particular path, as the path, based on the particular path including the least number of hops.

10. The non-transitory computer-readable medium of claim 8 , where the bandwidth value of the primary LSP is a reserved bandwidth value.

11. The non-transitory computer-readable medium of claim 8 , where the one or more instructions, when executed by the one or more processors, further cause the one or more processors to:

generate the bypass LSP without reserving bandwidth of the path.

12. The non-transitory computer-readable medium of claim 8 , where the bypass LSP available bandwidth threshold is determined based at least in part on a reserved bandwidth of the primary LSP.

13. The non-transitory computer-readable medium of claim 8 , where the bypass LSP available bandwidth threshold is determined based at least in part on paths within the primary LSP for which link protection is enabled.

14. The non-transitory computer-readable medium of claim 8 , where the bypass LSP available bandwidth threshold is determined based at least in part on a total reserved bandwidth value of paths within the primary LSP.

15. A method, comprising:

receiving, by a device, information that identifies a bandwidth value of a primary label-switched path (LSP) that includes a protected link or a protected node;

determining, by the device, a bypass LSP available bandwidth threshold based on the bandwidth value;

determining, by the device, a set of path bandwidth values associated with a set of paths;

comparing, by the device, the set of path bandwidth values and the bypass LSP available bandwidth threshold;

selecting, by the device, a path, of the set of paths, based on comparing the set of path bandwidth values and the bypass LSP available bandwidth threshold;

wherein selecting the path comprises:

determining, by the device, that none of the paths, of the set of paths, has a bandwidth value that satisfies the bypass LSP available bandwidth threshold,

identifying, by the device, a candidate path, of the set of paths, that includes a greatest available bandwidth value, and

selecting, by the device, the identified candidate path, as the path, based on the identified candidate path including the greatest available bandwidth value; and

generating, by the device, a bypass LSP using the path and without reserving bandwidth of the path, wherein the bypass LSP is used when a link of the primary LSP fails.

16. The method of claim 15 , wherein selecting the path further comprises:

determining, by the device, that multiple candidate paths, of the set of paths, have a same greatest available bandwidth value;

identifying, by the device, a particular path, of the multiple candidate paths, that includes a least number of hops as compared to other paths of the multiple candidate paths; and

selecting, by the device, the particular path, as the path, based on the particular path including the least number of hops.

17. The method of claim 15 , further comprising:

selecting another path; and

providing network traffic, of the primary LSP, using the path and the other path.

18. The method of claim 15 , where the bandwidth value of the primary LSP includes a reserved bandwidth value.

19. The method of claim 15 , further comprising:

determining whether the bypass LSP includes an amount of available bandwidth that satisfies the bypass LSP available bandwidth threshold after generating the bypass LSP.

20. The method of claim 15 , where the bypass LSP available bandwidth threshold is determined based at least in part on a reserved bandwidth of the primary LSP.