IP Library Granted Patent US 12,476,902
Granted Patent B2
US 12,476,902 · App. 18/652,156 · Granted Nov 18, 2025

Optimizing application performance in hierarchical SD-WAN

Inventors: Samir Thoria (Saratoga, CA); Ram Dular Singh (Cupertino, CA); Praveen Raju Kariyanahalli (San Ramon, CA); Laxmikantha Reddy Ponnuru (Santa Clara, CA); Ramanathan Lakshmikanthan (Santa Clara, CA)
Assignee: Cisco Technology, Inc.
H04L45/22H04L12/4641H04L45/04H04L45/50
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,476,902
App. No.
18/652,156
Granted
Nov 18, 2025
Kind
B2
Abstract

Systems and methods are provided for receiving bandwidth metrics from a plurality of routers on respective link routes in a network, compiling a link database including the bandwidth metrics of each respective link route in the network, selecting a first designated link path from the link database between a first router and a second router based on an application routing policy, the application routing policy being based on a routing metric, providing a first multiprotocol label switching label based on the first designated link path to the first router of the plurality of routers in the network, and restricting network traffic of the first router to the first designated link path provided in the first multiprotocol label switching label.

Claims (34)

1 . A method for routing packets across a hierarchical software-defined wide area network (SD-WAN), the method comprising:

identifying a first edge node associated with a first software-defined network in a first data center and a second edge node associated with a second software-defined network in a second data center, wherein the first edge node is connected via a first border node to a common core network, and the second edge node is connected via a second border node to the common core network;

defining an overlay network between the first edge node and the second edge node including the first border node and the second border node;

using performance metrics for a plurality of link routes to define a routing path in the overlay network between the first border node and the second border node; and

routing packets between the first edge node and the second edge node using the routing path defined between the border nodes in the overlay network.

2 . The method of claim 1 , wherein the performance metrics include at least one of latency, loss, jitter, and maximum transmission unit.

3 . The method of claim 1 , wherein each respective link route is between a set of routers of the overlay network, the set of routers including the first border node and the second border node.

4 . The method of claim 1 , further comprising using performance metrics for a plurality of link routes between the first edge node and the first border node to define a routing path between the first edge node and the first border node, and using performance metrics for a plurality of link routes between the second border node and the second edge node to define a routing path between the second border node and the second edge node.

5 . The method of claim 1 , wherein the routing path is based at least in part on an application-aware routing policy.

6 . The method of claim 4 , wherein the routing path is based at least in part on an end-to-end application-aware routing policy.

7 . The method of claim 1 , wherein the performance metric includes latency of the respective link routes in the overlay network.

8 . A system comprising:

one or more processors at one or more nodes; and

at least one computer-readable storage medium having stored therein instructions which, when executed by the one or more processors, cause the system to:

identify a first edge node associated with a first software-defined network in a first data center and a second edge node associated with a second software-defined network in a second data center, wherein the first edge node is connected via a first border node to a common core network, and the second edge node is connected via a second border node to the common core network;

define an overlay network between the first edge node and the second edge node including the first border node and the second border node;

use performance metrics for a plurality of link routes to define a routing path in the overlay network between the first border node and the second border node; and

route packets between the first edge node and second edge node using the routing path defined between the border nodes in the overlay network.

9 . The system of claim 8 , wherein the performance metrics include at least one of latency, loss, jitter, and maximum transmission unit.

10 . The system of claim 8 , wherein each respective link route is between a set of routers of the overlay network, the set of routers including the first border node and the second border node.

11 . The system of claim 8 , further comprising instructions which use performance metrics for a plurality of link routes between the first edge node and the first border node to define a routing path between the first edge node and the first border node, and use performance metrics for a plurality of link routes between the second border node and the second edge node to define a routing path between the second border node and the second edge node.

12 . The system of claim 8 , wherein the routing path is based at least in part on an application-aware routing policy.

13 . The system of claim 11 , wherein the routing path is based at least in part on an end-to-end application-aware routing policy.

14 . The system of claim 8 , wherein the performance metric includes latency of the respective link routes in the overlay network.

15 . A non-transitory computer-readable storage medium having stored therein instructions which, when executed by one or more processors on one or more hosts, cause a system to:

identify a first edge node associated with a first software-defined network in a first data center and a second edge node associated with a second software-defined network in a second data center, wherein the first edge node is connected via a first border node to a common core network, and the second edge node is connected via a second border node to the common core network;

define an overlay network between the first edge node and the second edge node including the first border node and the second border node;

use performance metrics for a plurality of link routes to define a routing path in the overlay network between the first border node and the second border node; and

route packets between the first edge node and second edge node using the routing path defined between the border nodes in the overlay network.

16 . The non-transitory computer-readable storage medium of claim 15 , wherein the performance metrics include at least one of latency, loss, jitter, and maximum transmission unit.

17 . The non-transitory computer-readable storage medium of claim 15 , wherein each respective link route is between a set of routers of the overlay network, the set of routers including the first border node and the second border node.

18 . The non-transitory computer-readable storage medium of claim 15 , further comprising instructions which use performance metrics for a plurality of link routes between the first edge node and the first border node to define a routing path between the first edge node and the first border node, and use performance metrics for a plurality of link routes between the second border node and the second edge node to define a routing path between the second border node and the second edge node.

19 . The non-transitory computer-readable storage medium of claim 15 , wherein the routing path is based at least in part on an application-aware routing policy.

20 . The non-transitory computer-readable storage medium of claim 18 , wherein the routing path is based at least in part on an end-to-end application-aware routing policy.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 1, 2024
From: THORIA, SAMIR; SINGH, RAM DULAR; KARIYANAHALLI, PRAVEEN RAJU; PONNURU, LAXMIKANTHA REDDY; LAKSHMIKANTHAN, RAMANATHAN
To: CISCO TECHNOLOGY, INC.
Reel/Frame 067282/0712 →
Continuity (3)
Continuation 18478567 · Sep 29, 2023
Continuation 17110457 · Dec 3, 2020
Related Publication 20240305564A1 · Sep 12, 2024
References Cited (21)
US 7664877B1 · Sheth · 2010 [cited by applicant]
US 8249057B1 · Mohaban et al. · 2012 [cited by applicant]
US 9178801B1 · Guichard et al. · 2015 [cited by applicant]
US 9923798B1 · Bahadur et al. · 2018 [cited by applicant]
US 20080002725A1 · Alicherry · 2008 [cited by examiner]
US 20160080502A1 · Yadav et al. · 2016 [cited by applicant]
US 20160094650A1 · Garcia de Rio · 2016 [cited by examiner]
US 20160255542A1 · Hughes et al. · 2016 [cited by applicant]
US 20170346722A1 · Smith et al. · 2017 [cited by applicant]
US 20190081884A1 · Spohn et al. · 2019 [cited by applicant]
US 20190319872A1 · Adhikari et al. · 2019 [cited by applicant]
US 20200084137A1 · Bernardi et al. · 2020 [cited by applicant]
US 20200366589A1 · Kaplan et al. · 2020 [cited by applicant]
US 20210119913A1 · Li · 2021 [cited by examiner]
US 20210288881A1 · Zhang · 2021 [cited by applicant]
US 20210385149A1 · Suryanarayana · 2021 [cited by examiner]
US 20220094638A1 · Dutta · 2022 [cited by applicant]
R. Liu, S. Li, H. Wang and Z. Tang, “A QoS Routing Optimization Algorithm Based on Hierarchical Multi-Controller Coordination,” 2019 IEEE 4th Advanced Information Technology, Electronic and Automation Control Conference… [cited by examiner]
F. Francois and E. Gelenbe, “Optimizing Secure SDN-Enabled Inter-Data Centre Overlay Networks through Cognitive Routing,” 2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telec… [cited by examiner]
Cisco, “Policies Configuration Guide for Vedge Routers, Cisco SD-WAN Releases 19.1,19.2, and 19.3,” Cisco Systems, Inc., Jul. 3, 2019, 266 Pages. [cited by applicant]
Filsfils C., et al., Segment Routing Architecture, Internet Engineering Task Force, Request for Comments: 8402, Jul. 2018, pp. 1-32. [cited by applicant]