# US 2025/0097153 A1 · Mechanism for detecting and mitigating congestion in a dragonfly network

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

- Number: US 2025/0097153 A1
- Document ID: US20250097153A1
- Status: Published application
- Kind: A1
- Application number: 18/646,410
- Filed: 2024-04-25
- Published: 2025-03-20
- Earliest claimed: 2023-09-14
- Assignees: NVIDIA Corporation
- Applicants: NVIDIA Corp.
- Inventors: John Martin Snyder; Nan Jiang; Dennis Charles Abts; Larry Robert Dennison
- Web page: https://patentgrep.com/patent/US20250097153A1

## CPC

- H04L 47/122: by diverting traffic away from congested entities
- H04L 47/125: by balancing the load, e.g. traffic engineering
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A process to manage congestion in a network involves converting traffic received from the local endpoints to a bandwidth demand for one or more destination endpoint in a remote group, and determining a sum over the destination endpoints of a minimum of a maximum bandwidth of a link and a bandwidth demand to one or more of the remote endpoints.

## Claims

### Claim 1

A network comprising:
a plurality of local endpoints in a local group;
a plurality of remote endpoints in a remote group;
a switch comprising a port for a link between the local group and the remote group; and
logic to:
convert traffic received from the local endpoints to a bandwidth demand for one or more destination endpoint in a remote group; and
determine a sum over the one or more destination endpoints of a minimum of (a) a maximum bandwidth of the link, and (b) a bandwidth demand to one or more of the remote endpoints.

### Claim 2 (depends on 1)

The network of claim 1, further comprising:
logic to determine a portion of the traffic received from the local endpoints to route non-minimally to one or more of the remote endpoints.

### Claim 3 (depends on 2)

The network of claim 2, wherein the portion of the traffic to route non-minimally is determined from a ratio of the maximum bandwidth of the link and the sum.

### Claim 4 (depends on 1)

The network of claim 1, further comprising:
logic to determine a rate of non-minimally routed traffic on the link.

### Claim 5 (depends on 4)

The network of claim 4, wherein the rate of non-minimally routed traffic is endpoint independent.

### Claim 6 (depends on 4)

The network of claim 4, further comprising:
logic to determine an injection rate throttle setting for the non-minimally routed traffic based on the rate of non-minimally routed traffic on the link.

### Claim 7 (depends on 6)

The network of claim 6, wherein the endpoint throttle setting is determined from a ratio of the maximum bandwidth of the link and the rate of non-minimally routed traffic on the link.

### Claim 8 (depends on 1)

The network of claim 1, further comprising:
a plurality of remote endpoint groups; and
logic to:
convert packet flow rates and packet trajectories for the port into aggregate contention metrics for the link; and
broadcast the contention metrics to the remote endpoint groups.

### Claim 9 (depends on 1)

The network of claim 1, further comprising:
logic to determine an injection rate throttle setting for the local endpoints that reduces the depth of a queue for the port.

### Claim 10

A network switch comprising:
a plurality of local ports to endpoints of a local group;
a global port for a global link;
logic to:
convert traffic received from the endpoints of the local group to a bandwidth demand for one or more destination endpoints in a remote group; and
on condition that the bandwidth demand indicates a contention condition, signal one of more of the endpoints of the local group to perform one or both of non-minimal routing and injection throttling.

### Claim 11 (depends on 10)

The network switch of claim 10, wherein the contention condition is determined as a sum over the one or more destination endpoints of a minimum of (a) a maximum bandwidth of the global link, and (b) a bandwidth demand to one or more of the destination endpoints.

### Claim 12 (depends on 10)

The network switch of claim 10, further comprising:
logic to determine and communicate to the endpoints of the local group an extent of traffic to route non-minimally to the one or more of the destination endpoints.

### Claim 13 (depends on 12)

The network switch of claim 12, wherein the extent of the traffic to route non-minimally is determined from a ratio of the maximum bandwidth of the global link and the sum.

### Claim 14 (depends on 10)

The network switch of claim 10, further comprising:
logic to determine a rate of non-minimally routed traffic on the global link.

### Claim 15 (depends on 14)

The network switch of claim 14, wherein the rate of non-minimally routed traffic is endpoint-independent.

### Claim 16 (depends on 14)

The network switch of claim 14, further comprising:
logic to determine an injection traffic throttle setting at the endpoints of the local group for the non-minimally routed traffic based on the rate of non-minimally routed traffic on the global link.

### Claim 17 (depends on 16)

The network switch of claim 16, wherein the endpoint throttle setting is determined from a ratio of a maximum bandwidth of the global link and the rate of non-minimally routed traffic on the global link.

### Claim 18 (depends on 10)

The network switch of claim 10, further comprising:
logic to:
convert packet flow rates and packet trajectories for the global link into aggregate contention metrics for the global link; and
broadcast the contention metrics to the one or more destination endpoints.

### Claim 19

A network contention control process in a Dragonfly network, the process comprising:
in a switch of the Dragonfly network, converting traffic received from endpoints of a local group of the switch to a bandwidth demand for one or more destination endpoints in a remote group; and
on condition that the bandwidth demand indicates a contention condition, generating from the switch a signal one of more of the endpoints of the local group to perform one or both of non-minimal routing and injection throttling.

### Claim 20 (depends on 19)

The process of claim 19, wherein the contention condition is determined as a sum over the one or more destination endpoints of a minimum of (a) a maximum bandwidth of a global link to the remote group, and (b) a bandwidth demand to one or more of the destination endpoints.
