IP Library Granted Patent US 12,348,421
Granted Patent B2
US 12,348,421 · App. 18/489,350 · Granted Jul 1, 2025

Local congestion mitigation

Inventors: Ralph Maxwell Williams (Leesburg, VA); Eleni Palkopoulou (Dallas, TX)
Assignee: CISCO TECHNOLOGY, INC.
H04L47/122H04L45/22H04L47/11
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,348,421
App. No.
18/489,350
Granted
Jul 1, 2025
Kind
B2
Abstract

Local Congestion Mitigation re-routes traffic around a congested network segment without regard for end point destinations of the re-routed traffic. By inhibiting consideration of end point destinations, determinations of alternate routes are simplified relative to techniques that compute new end-to-end routes for traffic when a congested segment is encountered. These methods therefore remain relatively efficient as a network grows in size and network routes within the network become increasingly complex.

Claims (60)

1. A method comprising:

determining that a network path between a source network node and a destination network node includes a network segment between a first intermediate network node and a second intermediate network node;

determining that the network segment between the first intermediate network node and the second intermediate network node is experiencing congestion caused by network traffic;

implementing a multiple segment list Tactical Traffic Engineering policy at the first intermediate network node using Unequal Cost Multi-Path routing to split the network traffic between multiple segments between the first intermediate network node and the second intermediate network node, wherein implementing includes splitting the network traffic between the multiple segments between the first intermediate network node and the second intermediate network node using weights; and

correcting for uneven equal cost multi-path splitting by adjusting the weights used for the Unequal Cost Multi-Path routing.

2. The method of claim 1 , comprising:

configuring a one-hop segment routing (SR) policy to collect traffic measurements between the first intermediate network node and the second intermediate network node;

deploying the one-hop SR policy at the first intermediate network node;

receiving the traffic measurements; and

estimating an amount of traffic based on the traffic measurements,

wherein implementing the multiple segment list Tactical Traffic Engineering policy is based on the amount of traffic.

3. The method of claim 1 , further comprising determining a network topology based on one or more of border gateway protocol-link state messages (BGP-LS), simple network management protocol (SNMP) messages, or path computation element protocol (PCEP) messages, wherein implementing the multiple segment list Tactical Traffic Engineering policy is based on the network topology.

4. The method of claim 1 , further comprising:

determining a difference between a traffic demand of the network segment and a nominal utilization of the network segment; and

determining the multiple segment list Tactical Traffic Engineering policy based on the difference.

5. The method of claim 1 , wherein the second intermediate network node is a next hop for packets received at the first intermediate network node along the network path, wherein the first intermediate network node is identified by a first network address and the second intermediate network node is identified by a second network address.

6. The method of claim 5 , wherein the network traffic comprises traffic provided from the source network node to the destination network node.

7. The method of claim 6 , further comprising:

identifying, based on the congestion, and the second network address and independent of network segments from the source network node to the first intermediate network node and network segments from the second intermediate network node to the destination network node, a first set of alternate routes from the first intermediate network node to the second intermediate network node; and

rerouting a first portion of the network traffic over an alternate route in the first set of alternate routes.

8. An apparatus comprising:

one or more network interfaces configured to enable network communications;

one or more processors; and

one or more memories storing instructions that when executed configure the one or more processors to perform operations comprising:

determining that a network path between a source network node and a destination network node includes a network segment between a first intermediate network node and a second intermediate network node;

determining that the network segment between the first intermediate network node and the second intermediate network node is experiencing congestion caused by network traffic;

implementing a multiple segment list Tactical Traffic Engineering policy at the first intermediate network node using Unequal Cost Multi-Path routing to split the network traffic between multiple segments between the first intermediate network node and the second intermediate network node, wherein implementing includes splitting the network traffic between the multiple segments between the first intermediate network node and the second intermediate network node using weights; and

correcting for uneven equal cost multi-path splitting by adjusting the weights used for the Unequal Cost Multi-Path routing.

9. The apparatus of claim 8 , the operations further comprising:

configuring a one-hop segment routing (SR) policy to collect traffic measurements between the first intermediate network node and the second intermediate network node;

deploying the one-hop SR policy at the first intermediate network node;

receiving the traffic measurements; and

estimating an amount of traffic based on the traffic measurements,

wherein implementing the multiple segment list Tactical Traffic Engineering policy is based on the amount of traffic.

10. The apparatus of claim 8 , the operations further comprising determining a network topology based on one or more of border gateway protocol-link state messages (BGP-LS), simple network management protocol (SNMP) messages, or path computation element protocol (PCEP) messages, wherein implementing the multiple segment list Tactical Traffic Engineering policy is based on the network topology.

11. The apparatus of claim 8 , the operations further comprising:

determining a difference between a traffic demand of the network segment and a nominal utilization of the network segment; and

determining the multiple segment list Tactical Traffic Engineering policy based on the difference.

12. The apparatus of claim 8 , wherein the second intermediate network node is a next hop for packets received at the first intermediate network node along the network path, wherein the first intermediate network node is identified by a first network address and the second intermediate network node is identified by a second network address.

13. The apparatus of claim 12 , wherein the network traffic comprises traffic provided from the source network node to the destination network node.

14. The apparatus of claim 13 , the operations further comprising:

identifying, based on the congestion, and the second network address and independent of network segments from the source network node to the first intermediate network node and network segments from the second intermediate network node to the destination network node, a first set of alternate routes from the first intermediate network node to the second intermediate network node; and

rerouting a first portion of the network traffic over an alternate route in the first set of alternate routes.

15. One or more tangible non-transitory storage mediums comprising instructions that when executed configure one or more processors to perform operations comprising:

determining that a network path between a source network node and a destination network node includes a network segment between a first intermediate network node and a second intermediate network node;

determining that the network segment between the first intermediate network node and the second intermediate network node is experiencing congestion caused by network traffic;

implementing a multiple segment list Tactical Traffic Engineering policy at the first intermediate network node using Unequal Cost Multi-Path routing to split the network traffic between multiple segments between the first intermediate network node and the second intermediate network node, wherein implementing includes splitting the network traffic between the multiple segments between the first intermediate network node and the second intermediate network node using weights; and

correcting for uneven equal cost multi-path splitting by adjusting the weights used for the Unequal Cost Multi-Path routing.

16. The one or more tangible non-transitory storage mediums of claim 15 , the operations further comprising:

configuring a one-hop segment routing (SR) policy to collect traffic measurements between the first intermediate network node and the second intermediate network node;

deploying the one-hop SR policy at the first intermediate network node;

receiving the traffic measurements; and

estimating an amount of traffic based on the traffic measurements,

wherein implementing the multiple segment list Tactical Traffic Engineering policy is based on the amount of traffic.

17. The one or more tangible non-transitory storage mediums of claim 15 , the operations further comprising determining a network topology based on one or more of border gateway protocol-link state messages (BGP-LS), simple network management protocol (SNMP) messages, or path computation element protocol (PCEP) messages, wherein implementing the multiple segment list Tactical Traffic Engineering policy is based on the network topology.

18. The one or more tangible non-transitory storage mediums of claim 15 , wherein the second intermediate network node is a next hop for packets received at the first intermediate network node along the network path, wherein the first intermediate network node is identified by a first network address and the second intermediate network node is identified by a second network address.

19. The one or more tangible non-transitory storage mediums of claim 18 , wherein the network traffic comprises traffic provided from the source network node to the destination network node.

20. The one or more tangible non-transitory storage mediums of claim 19 , the operations further comprising:

identifying, based on the congestion, and the second network address and independent of network segments from the source network node to the first intermediate network node and network segments from the second intermediate network node to the destination network node, a first set of alternate routes from the first intermediate network node to the second intermediate network node; and

rerouting a first portion of the network traffic over an alternate route in the first set of alternate routes.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 18, 2023
From: WILLIAMS, RALPH MAXWELL; PALKOPOULOU, ELENI
To: CISCO TECHNOLOGY, INC.
Reel/Frame 065270/0589 →
Continuity (3)
Continuation 17387225 · Jul 28, 2021
Provisional Application 63168666 · Mar 31, 2021
Related Publication 20240048490A1 · Feb 8, 2024
References Cited (24)
US 1004158A · Fowler · 1911 [cited by applicant]
US 8897140B1 · Bhattacharya · 2014 [cited by examiner]
US 9473408B1 · Kabbani et al. · 2016 [cited by applicant]
US 10374956B1 · Tracy · 2019 [cited by examiner]
US 11171883B1 · Ma · 2021 [cited by applicant]
US 11356361B2 · Filsfils et al. · 2022 [cited by applicant]
US 11451478B1 · Torvi et al. · 2022 [cited by applicant]
US 11838210B2 · Williams · 2023 [cited by examiner]
US 20100091656A1 · Chiu et al. · 2010 [cited by applicant]
US 20130275567A1 · Karthikeyan et al. · 2013 [cited by applicant]
US 20160294702A1 · Kodialam et al. · 2016 [cited by applicant]
US 20180183720A1 · Shpiner et al. · 2018 [cited by applicant]
US 20190158406A1 · LaBerge et al. · 2019 [cited by applicant]
US 20190280964A1 · Michael et al. · 2019 [cited by applicant]
US 20200366613A1 · Skalecki et al. · 2020 [cited by applicant]
US 20210014146A1 · Chen et al. · 2021 [cited by applicant]
US 20210281514A1 · Guo · 2021 [cited by examiner]
US 20220217202A1 · Kempanna · 2022 [cited by examiner]
US 20220368625A1 · Smith · 2022 [cited by examiner]
Cisco, “Bandwidth Optimization (BWOpt)”, Cisco Crosswork Optimization Engine 1.2.1 Function Packs, Updated Jul. 6, 2020, 8 pages. [cited by applicant]
Hui Ding et al., “PCE-based Virtual Network Topologies Reconfiguration and Congestion Avoidance Routing Scheme for Optical Networks,” IEEE Xplore, 2011 International Conference on Information Photonics and Optical Commu… [cited by applicant]
Clarence Filsfils et al., “Segment Routing Topology Independent LFA (TI-LFA)”, Cisco, Sep. 27, 2016, 101 pages. [cited by applicant]
Hasanein Hasan et al., “Improvement of Performance of EIGRP Network by Using a Supervisory Controller with Smart Congestion Avoidance Algorithm”, 2016 International Conference on Telecommunications and Multimedia (TEMU)… [cited by applicant]
Yuuki Udagawa et al., “Propose of the Dynamic Routing Methods using Available Bandwidth and Degree for Congestion Avoidance”, IEICE—The 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) 2016, IEEE, … [cited by applicant]