# US 2023/0068443 A1 · Dynamic packet routing using prioritized groups

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2023/0068443 A1
- Document ID: US20230068443A1
- Status: Published application
- Kind: A1
- Application number: 17/465,760
- Filed: 2021-09-02
- Published: 2023-03-02
- Earliest claimed: 2021-09-02
- Assignees: Mellanox Technologies, Ltd.
- Applicants: Mellanox Technologies, Ltd.
- Inventors: Barak Gafni; Donald Bruce Sharp
- Web page: https://patentgrep.com/patent/US20230068443A1

## CPC

- H04L 45/122: by minimising distances, e.g. by selecting a route with minimum of number of hops
- H04L 45/121: by minimising delays
- H04L 45/24: Multipath
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

An example method for dynamic packet routing using prioritized groups includes: receiving, by a processing device, routing information specifying a plurality of paths to a network destination, wherein each path is associated with a respective cost metric value; associating a first subset of the plurality of paths with a first priority routing group for the network destination, wherein each path of the first subset satisfies a first cost criterion based on a cost metric value of the path; associating a second subset of the plurality of paths with a second priority routing group for the network destination, wherein each path of the second subset satisfies a second cost criterion; and storing, in a forwarding information data structure, a first definition of the first priority routing group and a second definition of a second priority routing group.

## Claims

### Claim 1

A method comprising:
receiving, by a node , routing information specifying a plurality of paths from the node to a network destination, wherein each path is associated with a respective cost metric value;
associating, by the node, a first subset of the plurality of paths with a first priority routing group for the network destination, wherein each path of the first subset satisfies a first cost criterion based on a cost metric value of the path;
associating, by the node, a second subset of the plurality of paths with a second priority routing group for the network destination, wherein each path of the second subset satisfies a second cost criterion; and
storing, in a forwarding information data structure of the node, a first definition of the first priority routing group and a second definition of the second priority routing group.

### Claim 2 (depends on 1)

The method of claim 1, wherein the network destination is identified by a subnetwork address.

### Claim 3 (depends on 1)

The method of claim 1, wherein each path of the plurality of paths is associated with an identifier of a next-hop network interface.

### Claim 4 (depends on 1)

The method of claim 1, wherein the first cost criterion defines a least cost path.

### Claim 5 (depends on 1)

The method of claim 1, wherein the second cost criterion specifies a cost metric threshold.

### Claim 6 (depends on 1)

The method of claim 1, wherein the first cost metric value reflects one of: a number of hops on the path or a latency of the path.

### Claim 7 (depends on 1)

The method of claim 1, wherein the first priority routing group is represented by a primary group of a routing information base (RIB).

### Claim 8 (depends on 1)

The method of claim 1, wherein the second priority routing group is represented by a backup group of a routing information base (RIB).

### Claim 9 (depends on 1)

The method of claim 1, wherein the forwarding information data structure is represented by a forwarding information base (FIB).

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
identifying, based on the first definition of the first priority routing group and the second definition of a second priority routing group, a network interface for forwarding a network packet to the network destination.

### Claim 11

A system, comprising:
a memory; and
a processing device of a node, coupled to the memory, the processing device of the node to:
receive routing information specifying a plurality of paths from the node to a network destination, wherein each path is associated with a respective cost metric value;
associate a first subset of the plurality of paths with a first priority routing group for the network destination, wherein each path of the first subset satisfies a first cost criterion based on a cost metric value of the path;
associate a second subset of the plurality of paths with a second priority routing group for the network destination, wherein each path of the second subset satisfies a second cost criterion; and
store, in a forwarding information data structure of the node, a first definition of the first priority routing group and a second definition of the second priority routing group.

### Claim 12 (depends on 11)

The system of claim 11, wherein the first cost criterion defines a least cost path, and wherein the second cost criterion specifies a cost metric threshold.

### Claim 13 (depends on 11)

The system of claim 11, wherein the first cost metric value reflects at least one of: a number of hops on the path or a latency of the path.

### Claim 14 (depends on 11)

The system of claim 11, wherein the first priority routing group is represented by a primary group of a routing information base (RIB).

### Claim 15 (depends on 11)

The system of claim 11, wherein the second priority routing group is represented by a backup group of a routing information base (RIB).

### Claim 16 (depends on 10)

The system of claim 10, wherein the forwarding information data structure is represented by a forwarding information base (FIB).

### Claim 17

A non-transitory computer-readable storage medium comprising executable instructions that, when executed by a computing system, cause the computing system to:
receive, by a node, routing information specifying a plurality of paths from the node to a network destination, wherein each path is associated with a respective cost metric value;
associate, by the node, a first subset of the plurality of paths with a first priority routing group for the network destination, wherein each path of the first subset satisfies a first cost criterion based on a cost metric value of the path;
associate, by the node, a second subset of the plurality of paths with a second priority routing group for the network destination, wherein each path of the second subset satisfies a second cost criterion; and
store, in a forwarding information data structure of the node, a first definition of the first priority routing group and a second definition of the second priority routing group.

### Claim 18 (depends on 17)

The non-transitory computer-readable storage medium of claim 17, wherein the first cost criterion defines a least cost path, and wherein the second cost criterion specifies a cost metric threshold.

### Claim 19 (depends on 17)

The non-transitory computer-readable storage medium of claim 17, wherein the first cost metric value reflects at least one of: a number of hops on the path or a latency of the path.

### Claim 20 (depends on 16)

The non-transitory computer-readable storage medium of claim 16, wherein the second priority routing group is represented by a backup group of a routing information base (RIB).
