# US 2026/0291854 A1 · Latency-based adaptive routing

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

- Number: US 2026/0291854 A1
- Document ID: US20260291854A1
- Status: Published application
- Kind: A1
- Application number: 19/084,286
- Filed: 2025-03-19
- Published: 2026-09-24
- Earliest claimed: 2025-03-19
- Assignees: Mellanox Technologies, Ltd.
- Applicants: Mellanox Technologies, Ltd.
- Inventors: Eran Gil Beracha; Liron Mula; Gil Mey-Tal
- Web page: https://patentgrep.com/patent/US20260291854A1

## CPC

- H04L 45/125: based on throughput or bandwidth
- H04L 49/9023: for implementing a jitter-buffer
- H04L 47/56: implementing delay-aware scheduling
- H04L 47/6255: {queue load conditions, e.g. longest queue first}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems and methods are described for adaptive routing in a network communication. Systems include circuits to determine a latency for each queue of a plurality of queues, wherein the latency of a respective queue is determined based on a depth of the respective queue and a rate of traffic leaving the respective queue, select one queue from the plurality of queues for forwarding a packet based at least in part on the determined latency for each queue, and forward the packet to the selected queue.

## Claims

### Claim 1

A device comprising one or more circuits to:
determine a latency for each queue of a plurality of queues, wherein the latency of a respective queue is determined based on a depth of the respective queue and a rate of traffic leaving the respective queue;
select one queue from the plurality of queues for forwarding a packet based at least in part on the determined latency for each queue; and
forward the packet to the selected queue.

### Claim 2 (depends on 1)

The device of claim 1, wherein the circuits are further to:
receive data indicating a decrement in an amount of data in the respective queue; and
calculate the rate of traffic leaving the respective queue using the data indicating the decrement.

### Claim 3 (depends on 2)

The device of claim 2, wherein the circuits are further to calculate the rate of traffic leaving the respective queue by dividing the decrement in the amount of data by a time window.

### Claim 4 (depends on 2)

The device of claim 2, wherein the circuits are further to calculate the rate of traffic leaving the respective queue by normalizing the decrement in the amount of data based on a time window.

### Claim 5 (depends on 2)

The device of claim 2, wherein the circuits are further to determine the latency of the respective queue by right-shifting the depth of the respective queue by a logarithm base two of the rate of traffic leaving the respective queue.

### Claim 6 (depends on 1)

The device of claim 1, wherein each queue of the plurality of queues is associated with an egress port.

### Claim 7 (depends on 1)

The device of claim 1, wherein the queues of the plurality of queues are flow queues and the one or more circuits are further to select a traffic queue based on the determined latency for each queue.

### Claim 8 (depends on 1)

The device of claim 1, wherein the circuits are further to assign a grade to each queue of the plurality of queues based on the determined latency and use the grade to select the one queue.

### Claim 9 (depends on 8)

The device of claim 8, wherein the grade is used by an adaptive routing circuit to select the one queue.

### Claim 10

An application-specific integrated controller (ASIC) to:
determine a latency for each queue of a plurality of queues, wherein the latency of a respective queue is determined based on a depth of the respective queue and a rate of traffic leaving the respective queue;
select one queue from the plurality of queues for forwarding a packet based at least in part on the determined latency for each queue; and
forward the packet to the selected queue.

### Claim 11 (depends on 10)

The ASIC of claim 10, further to:
receive data indicating a decrement in an amount of data in the respective queue; and
calculate the rate of traffic leaving the respective queue using the data indicating the decrement.

### Claim 12 (depends on 11)

The ASIC of claim 11, further to calculate the rate of traffic leaving the respective queue by dividing the decrement in the amount of data by a time window.

### Claim 13 (depends on 11)

The ASIC of claim 11, further to calculate the rate of traffic leaving the respective queue by normalizing the decrement in the amount of data based on a time window.

### Claim 14 (depends on 11)

The ASIC of claim 11, further to determine the latency of the respective queue by right-shifting the depth of the respective queue by a logarithm base two of the rate of traffic leaving the respective queue.

### Claim 15 (depends on 10)

The ASIC of claim 10, wherein each queue of the plurality of queues is associated with an egress port.

### Claim 16 (depends on 10)

The ASIC of claim 10, wherein the queues of the plurality of queues are flow queues and the ASIC is further to select a traffic queue based on the determined latency for each queue.

### Claim 17 (depends on 10)

The ASIC of claim 10, further to assign a grade to each queue of the plurality of queues based on the determined latency and use the grade to select the one queue.

### Claim 18 (depends on 17)

The ASIC of claim 17, wherein the grade is used by an adaptive routing circuit to select the one queue.

### Claim 19

A method, comprising:
determining a latency for each queue of a plurality of queues, wherein the latency of a respective queue is determined based on a depth of the respective queue and a rate of traffic leaving the respective queue;
selecting one queue from the plurality of queues for forwarding a packet based at least in part on the determined latency for each queue; and
forwarding the packet to the selected queue.

### Claim 20 (depends on 19)

The method of claim 19, further comprising:
receiving data indicating a decrement in an amount of data in the respective queue; and
calculating the rate of traffic leaving the respective queue using the data indicating the decrement.
