# US 2026/0089029 A1 · Configuring network elements to perform source-assigned, tag-based forwarding for network connecting endpoint processing units

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

- Number: US 2026/0089029 A1
- Document ID: US20260089029A1
- Status: Published application
- Kind: A1
- Application number: 19/227,468
- Filed: 2025-06-04
- Published: 2026-03-26
- Earliest claimed: 2024-09-21
- Assignees: Delos Data Inc.
- Applicants: Delos Data Inc.
- Inventors: Daniel P. Daly; Edward V. E. Doe; Alain J. E. Gravel
- Web page: https://patentgrep.com/patent/US20260089029A1

## CPC

- H04L 45/24: Multipath
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 9/5083: {Techniques for rebalancing the load in a distributed system}
- G06F 9/547: {Remote procedure calls [RPC]; Web services}
- H04L 45/123: {Evaluation of link metrics (techniques for monitoring network metrics H04L43/08)}
- H04L 47/33: using forward notification
- H04L 67/10: in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46)
- H04L 67/1001: for accessing one among a plurality of replicated servers
- H04L 67/60: Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources (admission control or resource allocation H04L47/70)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Some embodiments provide a method of forwarding data messages between endpoint processing units (EPUs) that are connected through a network having multiple forwarding elements and that perform computations to collectively execute a distributed application. For each of multiple source EPUs, the method identifies a set of one or more paths through the network to forward results of computations performed by the source EPU to a set of destination EPUs. Each path includes a set of one or more hops along the network from the source EPU to a destination EPU. Each hop includes a forwarding element. For each identified path, the method identifies a tag to associate with the path, at each hop in the network along the path, to the next hop in the network, and distributes a record to each hop's forwarding element to associate the tag with a next hop along the identified path.

## Claims

### Claim 1

A method of forwarding data messages between endpoint processing units (EPUs) that are connected through a network comprising a plurality of forwarding elements, and that perform computations to collectively execute a distributed application, the method comprising:
for each of a plurality of source EPUs:
identifying a set of one or more paths through the network to forward results of computations performed by the source EPU to a set of destination EPUs, each path comprising a set of one or more hops along the network from the source EPU to a destination EPU, each hop comprising a forwarding element;
for each identified path:
identifying a tag to associate with the path, at each hop in the network along the path, to the next hop in the network; and
distributing a record to each hop's forwarding element to associate the tag with a next hop along the identified path.

### Claim 2 (depends on 1)

The method of claim 1, wherein the EPUs are graphics processing units (GPUs).

### Claim 3 (depends on 1)

The method of claim 1, wherein the EPUs comprise at least one of graphics processing units (GPUs), tensor processing units (TPUs) and central processing units (CPUs).

### Claim 4 (depends on 1)

The method of claim 1, wherein the forwarding elements are switches that process layer 2 (L2) headers of data message flows that store the results in payloads of the flows.

### Claim 5 (depends on 1)

The method of claim 1, wherein a result from a source EPU is forwarded to a destination EPU in a plurality of payloads of a plurality of data messages in a data message flow that traverses from the source EPU to the destination EPU along the network, each data message having a header, and at least one header of one data message in each flow stores the tag.

### Claim 6 (depends on 5)

The method of claim 5, wherein each header of each data message in each flow stores a tag.

### Claim 7 (depends on 5)

The method of claim 5, wherein
each forwarding element comprising a plurality of ports that connect the forwarding element to the network,
each record at each forwarding element maps a tag to a port of the forwarding element, and
each intervening forwarding element uses the distributed records to identify ports through which to forward data messages associated with the tags.

### Claim 8 (depends on 7)

The method of claim 7, wherein at each forwarding element, each flow's tag is used to identify a next hop along the flow's path to its destination by identifying a port through which the flow should egress the forwarding element, the egress port connected to the next hop through a physical link.

### Claim 9 (depends on 1)

The method of claim 1, wherein the assigned tags are not layer 2 (L2) or layer 3 (L3) network addresses.

### Claim 10 (depends on 9)

The method of claim 9, wherein the header does not store L2 or L3 network addresses.

### Claim 11

A non-transitory machine readable medium storing a program that when executed by a processor at a source endpoint processing unit (EPU) forwards data messages to a plurality of other EPUs through a network, said EPUs performing computations to collectively execute a distributed application, the program comprising sets of instructions:
identifying a set of one or more paths through the network to forward results of computations performed by the source EPU to a set of destination EPUs, each path comprising a set of one or more hops along the network from the source EPU to a destination EPU, each hop comprising a forwarding element;
for each identified path:
identifying a tag to associate with the path, at each hop in the network along the path, to the next hop in the network; and
distributing a record to each hop's forwarding element to associate the tag with a next hop along the identified path.

### Claim 12 (depends on 11)

The non-transitory machine readable medium of claim 11, wherein the EPUs are graphics processing units (GPUs).

### Claim 13 (depends on 11)

The non-transitory machine readable medium of claim 11, wherein the EPUs comprise at least one of graphics processing units (GPUs), tensor processing units (TPUs) and central processing units (CPUs).

### Claim 14 (depends on 11)

The non-transitory machine readable medium of claim 11, wherein the forwarding elements are switches that process layer 2 (L2) headers of data message flows that store the results in payloads of the flows.

### Claim 15 (depends on 11)

The non-transitory machine readable medium of claim 11, wherein a result from a source EPU is forwarded to a destination EPU in a plurality of payloads of a plurality of data messages in a data message flow that traverses from the source EPU to the destination EPU along the network, each data message having a header, and at least one header of one data message in each flow stores the tag.

### Claim 16 (depends on 15)

The non-transitory machine readable medium of claim 15, wherein each header of each data message in each flow stores a tag.

### Claim 17 (depends on 15)

The non-transitory machine readable medium of claim 15, wherein
each forwarding element comprising a plurality of ports that connect the forwarding element to the network,
each record at each forwarding element maps a tag to a port of the forwarding element, and
each intervening forwarding element uses the distributed records to identify ports through which to forward data messages associated with the tags.

### Claim 18 (depends on 17)

The non-transitory machine readable medium of claim 17, wherein at each forwarding element, each flow's tag is used to identify a next hop along the flow's path to its destination by identifying a port through which the flow should egress the forwarding element, the egress port connected to the next hop through a physical link.

### Claim 19 (depends on 11)

The non-transitory machine readable medium of claim 11, wherein the assigned tags are not layer 2 (L2) or layer 3 (L3) network addresses.

### Claim 20 (depends on 19)

The non-transitory machine readable medium of claim 19, wherein the header does not store L2 or L3 network addresses.
