IP Library Granted Patent US 12,261,772
Granted Patent B2
US 12,261,772 · App. 18/337,392 · Granted Mar 25, 2025

Variable preemption for LSP tunnels

Inventors: Darek Skalecki (Ottawa, CA); Gerald Smallegange (Stittsville, CA); Himanshu Shah (Hopkinton, MA)
Assignee: Ciena Corporation
H04L45/50H04L45/28H04L47/803
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,261,772
App. No.
18/337,392
Granted
Mar 25, 2025
Kind
B2
Abstract

Variable preemption for label-switched paths (LSP) tunnels includes provisioning a label-switched path (LSP) tunnel at a first bandwidth with a first priority value; and provisioning one or more different priority values at one or more of (1) corresponding one or more bandwidths such that a current priority value of the LSP tunnel is set based on a current bandwidth value of the LSP tunnel and (2) redial failure attempts such that the current priority value of the LSP tunnel is set based on a number of the redial failure attempts. The priority values can include one of a Setup Priority, a Holding Priority, and a combination thereof. The one of the Setup Priority, the Holding Priority, and the combination thereof can be based on RFC 3209.

Claims (35)

1. A non-transitory computer-readable medium comprising instructions that, when executed, cause at least one processor to perform steps of:

provisioning a label-switched path (LSP) tunnel at a first bandwidth with a first priority value;

provisioning one or more different priority values for the LSP tunnel, wherein the one or more different priority values change a current priority value for the LSP tunnel based on one or more of (1) corresponding one or more bandwidths of the LSP tunnel such that the current priority value of the LSP tunnel is set based on a current bandwidth value of the LSP tunnel and (2) redial failure attempts such that the current priority value of the LSP tunnel is set based on a number of the redial failure attempts;

operating the LSP tunnel at the first priority on the first bandwidth, and

in response to auto-sizing the LSP tunnel based on monitored usage, changing the first priority value due to the auto-sizing, to a second priority value.

2. The non-transitory computer-readable medium of claim 1 , wherein the priority values include one of a Setup Priority, a Holding Priority, and a combination thereof.

3. The non-transitory computer-readable medium of claim 1 , wherein the steps further include

detecting one or more of the current bandwidth value of the LSP tunnel and the number of the redial attempts, and setting the current priority value of the LSP tunnel based thereon.

4. The non-transitory computer-readable medium of claim 1 , wherein the corresponding one or more bandwidths are based on a threshold of bandwidth.

5. The non-transitory computer-readable medium of claim 1 , wherein the steps further include

preempting other LSP tunnels or preventing preemption by the other LSP tunnels based on the second priority value.

6. The non-transitory computer-readable medium of claim 1 , wherein the current bandwidth value causes a setting to a higher priority value for a higher bandwidth value, thereby allowing the LSP tunnel to preempt a lower priority LSP tunnel.

7. The non-transitory computer-readable medium of claim 1 , wherein the current bandwidth value includes different Upgrade and Downgrade thresholds to control oscillations.

8. The non-transitory computer-readable medium of claim 1 , wherein the LSP tunnel is configured over an underlay network comprising one of an optical network, an optical transport network (OTN), a segment routing (SR) network, and a combinations thereof.

9. The non-transitory computer-readable medium of claim 8 , wherein the current priority value of the LSP tunnel is set based on bandwidth on given links in the underlay network.

10. An apparatus comprising:

one or more processors; and

memory storing instructions that, when executed, cause the one or more processors to

cause provisioning of a label-switched path (LSP) tunnel at a first bandwidth with a first priority value,

cause provisioning of one or more different priority values for the LSP tunnel, wherein the one or more different priority values change a current priority value for the LSP tunnel based on one or more of (1) corresponding one or more bandwidths of the LSP tunnel such that the current priority value of the LSP tunnel is set based on a current bandwidth value of the LSP tunnel and (2) redial failure attempts such that the current priority value of the LSP tunnel is set based on a number of the redial failure attempts;

responsive to operating the LSP tunnel at the first priority value based on the first bandwidth and auto-sizing of the LSP tunnel based on monitored usage, changing the first priority value due to the auto-sizing, to a second priority value.

11. The apparatus of claim 10 , wherein the priority values include one of a Setup Priority, a Holding Priority, and a combination thereof.

12. The apparatus of claim 10 , wherein the instructions that, when executed, further cause the one or more processors to

detect one or more of the current bandwidth value of the LSP tunnel and the number of the redial attempts, and set the current priority value of the LSP tunnel based thereon.

13. The apparatus of claim 10 , wherein the corresponding one or more bandwidths are based on a threshold of bandwidth.

14. The apparatus of claim 10 , wherein the current bandwidth value causes a setting to a higher priority value for a higher bandwidth value, thereby allowing the LSP tunnel to preempt lower a priority LSP tunnel.

15. The apparatus of claim 10 , wherein the current bandwidth value includes different Upgrade and Downgrade thresholds to control oscillations.

16. The apparatus of claim 10 , wherein the LSP tunnel is configured over an underlay network comprising one of an optical network, an optical transport network (OTN), a segment routing (SR) network, and a combinations thereof.

17. A method comprising steps of:

provisioning a label-switched path (LSP) tunnel at a first bandwidth with a first priority value;

provisioning one or more different priority values for the LSP tunnel, wherein the one or more different priority values change a current priority value for the LSP tunnel based on one or more of (1) corresponding one or more bandwidths of the LSP tunnel such that the current priority value of the LSP tunnel is set based on a current bandwidth value of the LSP tunnel and (2) redial failure attempts such that the current priority value of the LSP tunnel is set based on a number of the redial failure attempts;

operating the LSP tunnel at the first priority value based on the first bandwidth, and

in response to auto-sizing the LSP tunnel based on monitored usage, changing the first priority value due to the auto-sizing, to a second priority value.

18. The method of claim 17 , wherein the steps further include

preempting other LSP tunnels or preventing preemption by the other LSP tunnels based on the second priority value.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 19, 2023
From: SKALECKI, DAREK; SMALLEGANGE, GERALD; SHAH, HIMANSHU
To: CIENA CORPORATION
Reel/Frame 063987/0600 →
Continuity (2)
Provisional Application 63405662 · Sep 12, 2022
Related Publication 20240089200A1 · Mar 14, 2024
References Cited (82)
US 5848055A · Fedyk et al. · 1998 [cited by applicant]
US 6195354B1 · Skalecki et al. · 2001 [cited by applicant]
US 6330614B1 · Aggarwal et al. · 2001 [cited by applicant]
US 6873616B1 · Fedyk et al. · 2005 [cited by applicant]
US 6914912B1 · Skalecki et al. · 2005 [cited by applicant]
US 7304947B2 · Skalecki et al. · 2007 [cited by applicant]
US 7430176B2 · Nalawade et al. · 2008 [cited by applicant]
US 7525907B2 · Skalecki et al. · 2009 [cited by applicant]
US 7532631B2 · Raszuk et al. · 2009 [cited by applicant]
US 7590051B1 · Skalecki et al. · 2009 [cited by applicant]
US 7639631B2 · Ashwood-Smith et al. · 2009 [cited by applicant]
US 7756009B1 · De Boer et al. · 2010 [cited by applicant]
US 7995569B2 · Ashwood-Smith et al. · 2011 [cited by applicant]
US 8085676B2 · Skalecki et al. · 2011 [cited by applicant]
US 8116232B2 · Skalecki et al. · 2012 [cited by applicant]
US 8116308B2 · Ellis et al. · 2012 [cited by applicant]
US 8189482B2 · Vasseur · 2012 [cited by examiner]
US 8259590B2 · Shah et al. · 2012 [cited by applicant]
US 8295278B2 · Shah et al. · 2012 [cited by applicant]
US 8402121B2 · Skalecki et al. · 2013 [cited by applicant]
US 8504727B2 · Mohan et al. · 2013 [cited by applicant]
US 8553707B2 · Swinkels et al. · 2013 [cited by applicant]
US 8560708B2 · Nelakonda et al. · 2013 [cited by applicant]
US 8750141B2 · Skalecki et al. · 2014 [cited by applicant]
US 8817798B2 · Skalecki et al. · 2014 [cited by applicant]
US 8855071B1 · Sankaran et al. · 2014 [cited by applicant]
US 9118421B2 · Swinkels et al. · 2015 [cited by applicant]
US 9118605B2 · Skalecki et al. · 2015 [cited by applicant]
US 9124960B2 · Swinkels et al. · 2015 [cited by applicant]
US 9191280B2 · Swinkels et al. · 2015 [cited by applicant]
US 9197493B2 · Holness et al. · 2015 [cited by applicant]
US 9467478B1 · Khan et al. · 2016 [cited by applicant]
US 9509593B2 · Sharma et al. · 2016 [cited by applicant]
US 9608719B2 · Skalecki et al. · 2017 [cited by applicant]
US 9800325B1 · Skalecki et al. · 2017 [cited by applicant]
US 9876865B1 · Skalecki · 2018 [cited by examiner]
US 10142254B1 · Olofsson et al. · 2018 [cited by applicant]
US 10284661B2 · Skalecki · 2019 [cited by examiner]
US 10341258B2 · Sareen et al. · 2019 [cited by applicant]
US 10355935B2 · Skalecki · 2019 [cited by applicant]
US 10397102B2 · Khan et al. · 2019 [cited by applicant]
US 10484764B2 · Vanderydt · 2019 [cited by examiner]
US 10541923B2 · Skalecki et al. · 2020 [cited by applicant]
US 10740408B2 · Ramasamy et al. · 2020 [cited by applicant]
US 10764659B2 · Vanderydt · 2020 [cited by examiner]
US 11102109B1 · Narasimhan et al. · 2021 [cited by applicant]
US 11184276B1 · Boutros et al. · 2021 [cited by applicant]
US 11271854B2 · Yadav et al. · 2022 [cited by applicant]
US 20030016808A1 · Hu et al. · 2003 [cited by applicant]
US 20050198312A1 · Ashwood-Smith et al. · 2005 [cited by applicant]
US 20070268817A1 · Smallegange et al. · 2007 [cited by applicant]
US 20080002680A1 · Skalecki et al. · 2008 [cited by applicant]
US 20080198755A1 · Vasseur · 2008 [cited by examiner]
US 20080219276A1 · Shah et al. · 2008 [cited by applicant]
US 20080273472A1 · Bashford et al. · 2008 [cited by applicant]
US 20080281987A1 · Skalecki et al. · 2008 [cited by applicant]
US 20110219128A1 · Swinkels et al. · 2011 [cited by applicant]
US 20120082089A1 · Nelakonda et al. · 2012 [cited by applicant]
US 20160191324A1 · Olofsson et al. · 2016 [cited by applicant]
US 20180013613A1 · Skalecki et al. · 2018 [cited by applicant]
US 20180131776A1 · Skalecki et al. · 2018 [cited by applicant]
US 20180262421A1 · Skalecki et al. · 2018 [cited by applicant]
US 20180331946A1 · Olofsson et al. · 2018 [cited by applicant]
US 20190208296A1 · Vanderydt · 2019 [cited by examiner]
US 20200036686A1 · Olofsson et al. · 2020 [cited by applicant]
US 20200220811A1 · Shah et al. · 2020 [cited by applicant]
US 20200358681A1 · Shah et al. · 2020 [cited by applicant]
US 20210243095A1 · Attarwala et al. · 2021 [cited by applicant]
US 20210328905A1 · Skalecki · 2021 [cited by applicant]
US 20210352011A1 · Boutros et al. · 2021 [cited by applicant]
US 20220046383A1 · Nagori et al. · 2022 [cited by applicant]
US 20220052964A1 · Bhardwaj et al. · 2022 [cited by applicant]
US 20220078074A1 · Shah et al. · 2022 [cited by applicant]
US 20220094635A1 · Ramsland et al. · 2022 [cited by applicant]
US 20220131721A1 · Boutros et al. · 2022 [cited by applicant]
US 20220368629A1 · Shah et al. · 2022 [cited by applicant]
US 20220407798A1 · Holness et al. · 2022 [cited by applicant]
EP 1422888A1 · 2004 [cited by applicant]
EP 1326371B1 · 2006 [cited by applicant]
EP 1735951B1 · 2017 [cited by applicant]
EP 3813310A1 · 2021 [cited by applicant]
RFC 3209; D. Awduche et al.; pp. 1-53 (Year: 2001). [cited by examiner]