Adaptive private network asynchronous distributed shared memory services

• US 8,452,846 B2
• Filed: 08/12/2011
• Issued: 05/28/2013
• Est. Priority Date: 08/12/2010
• Status: Active Grant

• Current Assignee: Talari Networks Incorporated (Oracle Corporation)
• Original Assignee: Talari Networks Incorporated (Oracle Corporation)
• Inventors: Fredette, Andre N., Dickey, John Edward
• Primary Examiner(s): SALL, EL HADJI MALICK
• Application Number:
  US13/208,825
• Publication Number:
  US 20120042032A1
• Time in Patent Office: 655 Days
• Field of Search: 709/203, 709/214, 709/219, 709/224, 710/22, 710/28
• US Class Current: 709/214
• CPC Class Codes: G06F 15/167 using a common memory, e.g. mailbox
• CPC Class Codes: H04L 43/062 related to network traffic
• CPC Class Codes: H04L 43/0829 Packet loss
• CPC Class Codes: H04L 43/0858 One way delays
• CPC Class Codes: H04L 43/0864 Round trip delays
• CPC Class Codes: H04L 43/087 Jitter
• CPC Class Codes: H04L 43/16 Threshold monitoring
• CPC Class Codes: H04L 45/121 by minimising delays
• CPC Class Codes: H04L 45/124 using a combination of metrics
• CPC Class Codes: H04L 45/125 based on throughput or bandwidth
• CPC Class Codes: H04L 47/122 by diverting traffic away from congested entities
• CPC Class Codes: 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]
• CPC Class Codes: H04L 7/0012 by comparing receiver clock with transmitter clock

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

1. A method for using distributed shared memory for communicating between loosely coupled computing systems, the method comprising:

calibrating a first time in a first node and a second time in a second node based on a current time received from a network control point (NCP);

transmitting a block of memory from the first node over a first communication path to the second node and a duplicate block of memory from the first node over a second communication path having a measure of independence from the first communication path to the second node that is greater than measured levels of independence of other available communication paths, wherein the block of memory and the duplicate block of memory are both tagged with a corresponding send time according to the calibrated first time;

selecting the block of memory or the duplicate block of memory as the first block of memory received in the second node and tagged with an arrival time according to the calibrated second time, wherein the send time and arrival time of the first block of memory received in the second node are analyzed taking into account previous transmission measurements at the second node and used to generate a second node path quality report; and

transmitting the second node path quality report from the second node to the first node, wherein path selection for transmission of a second block of memory is based on the second node path quality report.

2. The method of claim 1, wherein the calibrating is repeated over time to adjust the first time in the first node and the second time in the second node to the current time in the NCP.

3. The method of claim 1, wherein the calibrating is in response to a first clock request message from the first node and in response to a second clock request message from the second node.

4. The method of claim 1, wherein the calibrating comprises:

transmitting a clock request from the first node over a first path to the NCP and a duplicated clock request from the first node over a second path to the NCP; and

selecting the clock request or the duplicated clock request as the first received clock request in the NCP which responds to the first node with the current time in the NCP.

5. The method of claim 4 further comprises:

transmitting the current time in the NCP from the NCP over a third path to the first node;

transmitting a current time of a second transmit in the NCP from the NCP over a fourth path to the first node; and

selecting the current time in the NCP or the current time of the second transmit as the first received current time in the NCP, wherein the round trip latency of the clock request is minimized.

6. The method of claim 1 further comprising:

transmitting a first node path quality report from the first node to the second node, wherein path selection for transmission of the second node path quality report is based on the first node path quality report.

7. The method of claim 1, wherein congestion is determined by comparing how many data packets were sent by the first node with an indication how many data packets were received by the second node.

8. The method of claim 7 further comprising:

fragmenting the second block of memory into a first fragment and a second fragment;

transmitting the first fragment from the first node over the first communication path to the second node and the second fragment from the first node over the second communication path to the second node, wherein the first fragment and the second fragment are both tagged with a corresponding send time according to the calibrated first time; and

receiving and combining the transmitted first fragment and the transmitted second fragment as a transmitted second block of memory in the second node and tagged with associated arrival times according to the calibrated second time, wherein an updated second node path quality report is generated based on the send times and arrival times of the first fragment and the second fragment for transmission from the second node to the first node.

9. The method of claim 8, wherein next path selection for transmission of a next block of memory is based on the updated second node path quality report.

10. An apparatus for using distributed shared memory for communicating between nodes in a loosely coupled computing system, the apparatus comprising:

means for calibrating a first time in a first node and a second time in a second node based on a current time received from a network control point (NCP);

means for transmitting a block of memory from the first node over a first communication path to the second node and a duplicate block of memory from the first node over a second communication path having a measure of independence from the first communication path to the second node that is greater than measured levels of independence of other available communication paths, wherein the block of memory and the duplicate block of memory are both tagged with a corresponding send time according to the calibrated first time;

means for selecting the block of memory or the duplicate block of memory as the first block of memory received in the second node and tagged with an arrival time according to the calibrated second time, wherein the send time and arrival time of the first block of memory received in the second node are analyzed taking into account previous transmission measurements at the second node and used to generate a second node path quality report; and

means for transmitting the second node path quality report from the second node to the first node, wherein path selection for transmission of a second block of memory is based on the second node path quality report.

11. The apparatus of claim 10, wherein transmission of the second block of memory comprises:

means for fragmenting the second block of memory into a first fragment and a second fragment;

means for transmitting the first fragment from the first node over the first communication path to the second node and the second fragment from the first node over the second communication path to the second node, wherein the first fragment and the second fragment are both tagged with a corresponding send time according to the calibrated first time; and

means for receiving and combining the transmitted first fragment and the transmitted second fragment as a transmitted second block of memory in the second node and tagged with associated arrival times according to the calibrated second time, wherein an updated second node path quality report is generated based on the send times and arrival times of the first fragment and the second fragment for transmission from the second node to the first node.

12. The apparatus of claim 11, wherein path selection for transmission of a next block of memory is based on the updated second node path quality report.