# US 11,121,974 B2 · Adaptive private network asynchronous distributed shared memory services

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

- Number: US 11,121,974 B2
- Document ID: US11121974B2
- Status: Granted
- Kind: B2
- Application number: 16/791,776
- Filed: 2020-02-14
- Published: 2020-06-11
- Granted: 2021-09-14
- Earliest claimed: 2010-08-12
- Assignees: Talari Networks Incorporated
- Applicants: Talari Networks Incorporated
- Inventors: Andre N. Fredette; John Edward Dickey
- Web page: https://patentgrep.com/patent/US11121974B2

## CPC

- H04L 47/122: by diverting traffic away from congested entities
- G06F 15/167: using a common memory, e.g. mailbox
- H04L 7/0012: {by comparing receiver clock with transmitter clock}
- H04L 43/062: related to network traffic
- H04L 43/0829: Packet loss
- H04L 43/0858: {One way delays}
- H04L 43/0864: Round trip delays
- H04L 43/087: Jitter
- H04L 43/16: Threshold monitoring
- H04L 45/121: by minimising delays
- H04L 45/124: {using a combination of metrics}
- H04L 45/125: based on throughput or bandwidth
- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- 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

A highly predicable quality shared distributed memory process is achieved using less than predicable public and private internet protocol networks as the means for communications within the processing interconnect. An adaptive private network (APN) service provides the ability for the distributed memory process to communicate data via an APN conduit service, to use high throughput paths by bandwidth allocation to higher quality paths avoiding lower quality paths, to deliver reliability via fast retransmissions on single packet loss detection, to deliver reliability and timely communication through redundancy transmissions via duplicate transmissions on high a best path and on a most independent path from the best path, to lower latency via high resolution clock synchronized path monitoring and high latency path avoidance, to monitor packet loss and provide loss prone path avoidance, and to avoid congestion by use of high resolution clock synchronized enabled congestion monitoring and avoidance.

## Claims

### Claim 1

A method of sharing memory in a network having multiple communication paths between distributed memory nodes, the method comprising:
fragmenting a block of memory having a transmission size exceeding a transmission capacity of a first communication path into a first fragment and a second fragment;
transmitting, using an adaptive private network (APN) service, the first fragment from a transmitting node across the first communication path to a receiving node and transmitting the second fragment from the transmitting node across a second communication path to the receiving node, the second communication path selected from multiple communication paths as having a highest measure of independence among the multiple communication paths, wherein the first and second communication paths are contained within a conduit provided by the APN service, the transmitting node comprises an APN node located at a wide area network (WAN) ingress, the receiving node comprises an APN node located at a WAN egress, the conduit connects the transmitting and receiving nodes across the WAN, and the transmitting of the first and second fragments occurs across the WAN via the conduit;
receiving the first fragment and the second fragment in the receiving node as a combined memory block; and
storing the combined memory block at a location in a distributed memory in the receiving node, the location locked to assure full coherency of the combined memory block in the receiving node.

### Claim 2 (depends on 1)

The method of claim 1 further comprising:
calibrating a first time in the transmitting node and a second time in the receiving node based on a current time in a node having a calibrated shared reference clock wherein the current time from the node having the calibrated shared reference clock is received in the transmitting node and in the receiving node in response to a calibration request made by the transmitting node and by the receiving node.

### Claim 3 (depends on 1)

The method of claim 1 further comprising:
extracting and analyzing tagged data stored within data packets at the receiving node for determination of communication path one way times and WAN link congestion.

### Claim 4 (depends on 1)

The method of claim 1 further comprising:
extracting and analyzing the tagged data stored within data packets at the receiving node for determination of packet loss.

### Claim 5 (depends on 1)

The method of claim 1 further comprising:
selecting multiple communication paths in response to prior path selection.

### Claim 6 (depends on 1)

The method of claim 1 further comprising:
transmitting a duplicate of the first fragment across a third communication path to the receiving node and transmitting a duplicate of the second fragment across a fourth communication path to the receiving node;
selecting the first fragment or the duplicate of the first fragment as the first received first fragment in the receiving node and selecting the second fragment or the duplicate of the second fragment as the first received second fragment in the receiving node; and
combining the first received first fragment and the first received second fragment as the combined compressed report.

### Claim 7

A non-transitory computer readable medium having stored thereon executable instructions that when executed by the processor of a computer control the computer to perform steps comprising:
fragmenting a block of memory having a transmission size exceeding a transmission capacity of a first communication path into a first fragment and a second fragment;
transmitting, using an adaptive private network (APN) service, the first fragment from a transmitting node across the first communication path to a receiving node and transmitting the second fragment from the transmitting node across a second communication path to the receiving node, the second communication path selected from multiple communication paths as having a highest measure of independence among the multiple communication paths, wherein the first and second communication paths are contained within a conduit provided by the APN service, the transmitting node comprises an APN node located at a wide area network (WAN) ingress, the receiving node comprises an APN node located at a WAN egress, the conduit connects the transmitting and receiving nodes across the WAN, and the transmitting of the first and second fragments occurs across the WAN via the conduit;
receiving the first fragment and the second fragment in the receiving node as a combined memory block; and
storing the combined memory block at a location in a distributed memory in the receiving node, the location locked to assure full coherency of the combined memory block in the receiving node.

### Claim 8 (depends on 7)

The non-transitory computer readable medium of claim 7 further comprising:
calibrating a first time in the transmitting node and a second time in the receiving node based on a current time in a node having a calibrated shared reference clock wherein the current time from the node having the calibrated shared reference clock is received in the transmitting node and in the receiving node in response to a calibration request made by the transmitting node and by the receiving node.

### Claim 9 (depends on 7)

The non-transitory computer readable medium of claim 7 further comprising:
extracting and analyzing tagged data stored within data packets at the receiving node for determination of communication path one way times and WAN link congestion.

### Claim 10 (depends on 7)

The non-transitory computer readable medium of claim 7 further comprising:
extracting and analyzing the tagged data stored within data packets at the receiving node for determination of packet loss.

### Claim 11 (depends on 7)

The non-transitory computer readable medium of claim 7 further comprising:
selecting multiple communication paths in response to prior path selection.

### Claim 12 (depends on 7)

The non-transitory computer readable medium of claim 7 further comprising:
transmitting a duplicate of the first fragment across a third communication path to the receiving node and transmitting a duplicate of the second fragment across a fourth communication path to the receiving node;
selecting the first fragment or the duplicate of the first fragment as the first received first fragment in the receiving node and selecting the second fragment or the duplicate of the second fragment as the first received second fragment in the receiving node; and
combining the first received first fragment and the first received second fragment as the combined compressed report.
