IP Library Patent Application 18774326
Patent Application
App. No. 18/774,326

CONFIGURATION OF A NETWORK USING A FLEX-ALGORITHM ROUTING MECHANISM

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 None
App. No.
18/774,326
Abstract

In some implementations, a first network device may receive an advertisement from a second network device. The advertisement may be associated with indicating that the second network device is configured to support a particular flex-algorithm. The first network device may identify, in the advertisement, an address of the second network device. The first network device may configure a routing table of the first network device to indicate that the second network device is capable of receiving traffic associated with the particular flex-algorithm based on the address. The first network device may perform, using the routing table, an action associated with routing the traffic associated with the particular flex-algorithm.

Claims (47)

1 . A first network device, comprising:

one or more processors to:

associate an address with a flexible algorithm;

advertise, to one or more network devices, information indicating that the address is associated with the flexible algorithm; and

receive network traffic associated with the flexible algorithm based on advertising the information.

2 . The first network device of claim 1 , wherein the one or more processors are to:

calculate a least-cost path according to an Intradomain Gateway Protocol (IGP) for transmitting the network traffic.

3 . The first network device of claim 1 , wherein the information identifies one or more of:

a type of metric associated with calculating a least cost path,

a calculation type associated with calculating a least cost path, or

one or more constraints associated with calculating a least cost path.

4 . The first network device of claim 1 , wherein the one or more processors are to:

determine a cost to transmit the network traffic according to the flexible algorithm.

5 . The first network device of claim 1 , wherein the one or more processors, to advertise information indicating that the address is associated with the flexible algorithm, are to:

advertise one or more flex-algorithm definitions.

6 . The first network device of claim 1 , wherein the first network device utilizes a shortest path first routing protocol.

7 . The first network device of claim 1 , wherein the address is a loopback address.

8 . A method comprising:

advertising, by a network device, a flexible algorithm,

wherein the network device is configured to route traffic according to a flexible algorithm definition, and

wherein a specific address of another network device is designated to receive traffic associated with the flexible algorithm; and

associating, by the network device, the flexible algorithm with the specific address.

9 . The method of claim 8 , wherein the specific address is a loopback address.

10 . The method of claim 8 , wherein the network device is a router.

11 . The method of claim 8 , further comprising:

calculating a least-cost path according to a Intradomain Gateway Protocol (IGP) for transmitting the traffic.

12 . The method of claim 8 , further comprising:

determining a cost to transmit traffic according to the flexible algorithm.

13 . The method of claim 8 , wherein an identifier for the flexible algorithm is included in an advertisement.

14 . The method of claim 8 , wherein the flexible algorithm includes information that identifies one or more of:

a type of metric associated with calculating a least cost path, or

a calculation type associated with calculating a least cost path.

15 . A non-transitory computer-readable medium storing a set of instructions, the set of instructions comprising:

one or more instructions that, when executed by one or more processors of a first network device, cause the first network device to:

associate an address with a flexible algorithm;

advertise, to one or more network devices, information indicating that the address is associated with the flexible algorithm; and

receive network traffic associated with the flexible algorithm based on advertising the information.

16 . The non-transitory computer readable medium of claim 15 , wherein the one or more instructions further cause the first network device to:

determine a cost to transmit network traffic according to the flexible algorithm.

17 . The non-transitory computer readable medium of claim 15 , wherein the one or more instructions further cause the first network device to:

transmit, using the address, the network traffic based on a route path having a least-cost according to the flexible algorithm.

18 . The non-transitory computer readable medium of claim 15 , wherein the one or more instructions further cause the first network device to:

calculate a least-cost path according to an Intradomain Gateway Protocol (IGP) for the network traffic.

19 . The non-transitory computer readable medium of claim 15 , wherein the information identifies one or more of:

a type of metric associated with calculating a least cost path, or

a calculation type associated with calculating a least cost path.

20 . The non-transitory computer readable medium of claim 15 , wherein the information identifies a protocol as being an Intradomain Gateway Protocol (IGP).

Assignments (1)
NUNC PRO TUNC ASSIGNMENT Recorded May 6, 2026
From: JUNIPER NETWORKS, INC.
To: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Reel/Frame 075513/0034 →