IP Library Granted Patent US 12,556,471
Granted Patent B2
US 12,556,471 · App. 18/396,482 · Granted Feb 17, 2026

Route cost based on route metrics and path type preference

Inventors: Abilash Menon (Boxborough, MA); Markus Jork (Andover, MA); John M. Peterson (Arlington, MA)
Assignee: Juniper Networks, Inc.
H04L45/123H04L45/04H04L45/121H04L45/24
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,556,471
App. No.
18/396,482
Granted
Feb 17, 2026
Kind
B2
Abstract

Techniques are disclosed for computing a cost of an advertised route to a next-hop network device along a path to a destination based at least in part on a preference for the path. In one example, a computing system computes a cost of a route to a next-hop network device along a path to a destination. The computed cost is based at least in part on (1) a metric for the route and (2) a preconfigured preference for the path. In some examples, the preference for the path is based at least in part on (a) a type of the path as compared to other types of other paths to the destination or (b) a latency of the path as compared to other latencies of the other paths. The computing system sends a route advertisement for the route that includes data indicative of the cost of the route.

Claims (51)

1 . A computing system comprising processing circuitry and a storage device, wherein the processing circuitry has access to the storage device and is configured to:

compute, based at least in part on (1) one or more metrics for a route to a next-hop network device along a path to a destination and (2) a preconfigured preference for a path type of the path to the destination in comparison to path types of other paths to the destination, a cost of the route; and

send, via a routing protocol, a route advertisement for the route, wherein the route advertisement includes data indicative of the cost of the route.

2 . The computing system of claim 1 , wherein to compute the cost of the route, the processing circuitry is configured to:

determine, based at least in part on the one or more metrics for the route to the next-hop network device, the cost of the route; and

adjust, based at least in part on the preconfigured preference for the path type of the path to the destination, the cost of the route.

3 . The computing system of claim 1 , wherein the processing circuitry is further configured to compute the cost based further on (3) a latency of the path to the destination in comparison to latencies of other paths to the destination.

4 . The computing system of claim 1 ,

wherein the path comprises a first path to the destination, and

wherein the processing circuitry is configured to perform the computing and the sending in response to detecting a failure of a second path to the destination, wherein at least one network device forming the first path is different from at least one network device forming the second path.

5 . The computing system of claim 1 ,

wherein to compute the cost of the route, the processing circuitry is configured to compute a cost of each of a plurality of routes, each route to a respective next-hop network device along a respective path of a plurality of different paths to the destination, wherein at least two of the plurality of paths traverse different data centers of a plurality of geographically separate data centers, wherein the plurality of different paths comprises the path and the other paths to the destination, and

wherein the respective cost of each respective route of the plurality of routes is based at least in part on (1) one or more respective metrics for the respective route to the respective next-hop network device along the respective path of the plurality of different paths to the destination and (2) a preconfigured preference for a path type of the respective path of the plurality of different paths to the destination.

6 . The computing system of claim 1 ,

wherein to compute the cost of the route, the processing circuitry is configured to:

determine, based at least in part one or more first metrics for a first route to a first next-hop network device along a first path to the destination, a first cost of the first route;

determine, based at least in part one or more second metrics for a second route to a second next-hop network device along a second path to the destination, a second cost of the second route, wherein the first cost of the first route is greater than the second cost of the second route;

adjust, based at least in part on a preconfigured preference for a first path type of the first path to the destination, the first cost of the first route; and

adjust, based at least in part on a preconfigured preference for a second path type of the second path to the destination, the second cost of the second route, wherein the first path type and the second path type are different, and wherein the preconfigured preference for the first path type indicates that the first path type is more preferred and the preconfigured preference for the second path type indicates that the second path type is less preferred, and wherein the adjusted first cost of the first route is less than the adjusted second cost of the second route.

7 . The computing system of claim 6 ,

wherein the first path type comprises a Multiprotocol Label Switching (MPLS) path type, and

wherein the second path type comprises a broadband path type.

8 . The computing system of claim 1 , wherein the routing protocol comprises Border Gateway Protocol (BGP).

9 . A method comprising:

computing, by a computing system comprising processing circuitry and based at least in part on (1) one or more metrics for a route to a next-hop network device along a path to a destination and (2) a preconfigured preference for a path type of the path to the destination in comparison to path types of other paths to the destination, a cost of the route; and

sending, by the computing system and via a routing protocol, a route advertisement for the route, wherein the route advertisement includes data indicative of the cost of the route.

10 . The method of claim 9 , wherein computing the cost of the route comprises:

determining, based at least in part on the one or more metrics for the route to the next-hop network device, the cost of the route; and

adjusting, based at least in part on the preconfigured preference for the path type of the path to the destination, the cost of the route.

11 . The method of claim 9 , wherein computing the cost is based further on (3) a latency of the path to the destination in comparison to latencies of other paths to the destination.

12 . The method of claim 9 ,

wherein the path comprises a first path to the destination, and

wherein the computing and the sending are in response to detecting a failure of a second path to the destination, wherein at least one network device forming the first path is different from at least one network device forming the second path.

13 . The method of claim 9 ,

wherein computing the cost of the route comprises computing a cost of each of a plurality of routes, each route to a respective next-hop network device along a respective path of a plurality of different paths to the destination, wherein at least two of the plurality of paths traverse different data centers of a plurality of geographically separate data centers, wherein the plurality of different paths comprises the path and the other paths to the destination, and

wherein the respective cost of each respective route of the plurality of routes is based at least in part on (1) one or more respective metrics for the respective route to the respective next-hop network device along the respective path of the plurality of different paths to the destination and (2) a preconfigured preference for a path type of the respective path of the plurality of different paths to the destination.

14 . The method of claim 9 , wherein computing the cost of the route comprises:

determining, based at least in part one or more first metrics for a first route to a first next-hop network device along a first path to the destination, a first cost of the first route;

determining, based at least in part one or more second metrics for a second route to a second next-hop network device along a second path to the destination, a second cost of the second route, wherein the first cost of the first route is greater than the second cost of the second route;

adjusting, based at least in part on a preconfigured preference for a first path type of the first path to the destination, the first cost of the first route; and

adjusting, based at least in part on a preconfigured preference for a second path type of the second path to the destination, the second cost of the second route, wherein the first path type and the second path type are different, and wherein the preconfigured preference for the first path type indicates that the first path type is more preferred and the preconfigured preference for the second path type indicates that the second path type is less preferred, and wherein the adjusted first cost of the first route is less than the adjusted second cost of the second route.

15 . The method of claim 14 ,

wherein the first path type comprises a Multiprotocol Label Switching (MPLS) path type, and

wherein the second path type comprises a broadband path type.

16 . The method of claim 9 , wherein the routing protocol comprises Border Gateway Protocol (BGP).

17 . Non-transitory, computer-readable media comprising instructions that, when executed, cause processing circuitry of a computing system to:

compute, based at least in part on (1) one or more metrics for a route to a next-hop network device along a path to a destination and (2) a preconfigured preference for a path type of the path to the destination in comparison to path types of other paths to the destination, a cost of the route; and

send, via a routing protocol, a route advertisement for the route, wherein the route advertisement includes data indicative of the cost of the route.

18 . The computer-readable media of claim 17 , wherein the instructions are further configured to cause the processing circuitry to:

determine, based at least in part on the one or more metrics for the route to the next-hop network device, the cost of the route; and

adjust, based at least in part on the preconfigured preference for the path type of the path to the destination, the cost of the route.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 27, 2023
From: MENON, ABILASH; JORK, MARKUS; PETERSON, JOHN M.
To: JUNIPER NETWORKS, INC.
Reel/Frame 065958/0981 →
Continuity (2)
Provisional Application 63510765 · Jun 28, 2023
Related Publication 20250007818A1 · Jan 2, 2025
References Cited (19)
US 9729439B2 · MeLampy et al. · 2017 [cited by applicant]
US 10200264B2 · Menon et al. · 2019 [cited by applicant]
US 20040136324A1 · Steinberg · 2004 [cited by examiner]
US 20180062986A1 · Murgia · 2018 [cited by examiner]
US 20200403890A1 · McCulley et al. · 2020 [cited by applicant]
US 20220200887A1 · Menon · 2022 [cited by examiner]
US 20230059537A1 · Gavand · 2023 [cited by examiner]
US 20230116163A1 · Scholz et al. · 2023 [cited by applicant]
US 20230353482A1 · Means · 2023 [cited by examiner]
US 20240305553A1 · Vasseur · 2024 [cited by examiner]
Extended Search Report from counterpart European Application No. 24162219.0 dated Aug. 29, 2024, 8 pp. [cited by applicant]
“Transmission Control Protocol,” DARPA Internet Program, RFC 793, Sep. 1981, 91 pp. [cited by applicant]
Katz et al., “Bidirectional Forwarding Detection (BFD) for IPV4 and IPV6 (Single Hop),” Internet Engineering Task Force (IETF), RFC 5881, Jun. 2010, 7 pp. [cited by applicant]
Katz et al., “Bidirectional Forwarding Detection (BFD),” Internet Engineering Task Force (IETF), RFC 5880, Jun. 2010, 49 pp. [cited by applicant]
Menon et al., “Secure Vector Routing (SVR),” Network Working Group Internet-Draft: draft-menon-svr-01, Mar. 29, 2022, 76 pp. [cited by applicant]
Menon et al., “Secure Vector Routing (SVR),” Network Working Group Internet-Draft: draft-menon-svr-02, Sep. 20, 2022, 96 pp. [cited by applicant]
Menon et al., “Secure Vector Routing (SVR),” Network Working Group, Internet-Draft: draft-menon-svr-00, Oct. 1, 2021, 37 pp. [cited by applicant]
Postel, “User Datagram Protocol,” ISI, RFC 768, Aug. 28, 1980, 3 pp. [cited by applicant]
Response to Extended Search Report dated Aug. 29, 2024, from counterpart European Application No. 24162219.0 filed Jun. 25, 2025, 9 pp. [cited by applicant]