Local data caching for data transfers on a network of computational devices

• US 9,667,738 B2
• Filed: 11/26/2014
• Issued: 05/30/2017
• Est. Priority Date: 03/24/2014
• Status: Active Grant

• Current Assignee: Tanium Inc.
• Original Assignee: Tanium Inc.
• Inventors: Lincroft, Peter, Hindawi, David, Hindawi, Orion, Lippincott, Lisa
• Primary Examiner(s): Joo, Joshua
• Assistant Examiner(s): Naji, Younes
• Application Number:
  US14/554,711
• Publication Number:
  US 20150271284A1
• Time in Patent Office: 916 Days
• Field of Search: None
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: 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

Abstract

In accordance with some embodiments, a computational machine having one or more processors, a local cache and memory receives from a first machine a data request that is used to request specific data. The computational machine determines whether the computational machine stores the specific data in the local cache. In accordance with a determination that the computational machine does not store the specific data in the local cache, the computational machine responds to the data request by passing the data request to a second machine and returning the specific data to the first machine when the second machine returns the specific data to the computational machine. Additionally, the computational machine determines whether to store the returned specific data in the local cache according to a data caching method.

Claims

1. A method of data caching and distribution, comprising:

at a computational machine having a local cache, wherein the computational machine is coupled in a linear communication orbit that is further coupled to a server via a head node of the linear communication orbit, and the computational machine is distinct from the head node, the linear communication orbit further including a first machine and a second machine;

receiving, via the linear communication orbit, from the first machine a data request that is used to request specific data;

determining whether the computational machine stores the specific data in the local cache; and

in accordance with a determination that the computational machine does not store the specific data in the local cache, responding to the data request, by;

passing, via the linear communication orbit, the data request to the second machine, and

when the second machine returns the specific data to the computational machine, returning, via the linear communication orbit, the specific data to the first machine and determining whether to store the specific data in the local cache according to a data caching method,

wherein the head node, first machine, computational machine and second machine are sequentially ordered in an ordered sequence on the linear communication orbit based on a predefined set of rules, the computational machine is between the first machine and the second machine in said ordered sequence, and the first machine or the second machine is between the computational machine and the head node in said ordered sequence.

2. The method of claim 1, further comprising:

in accordance with a determination that the computational machine stores the specific data in the local cache, responding to the data request by returning the specific data to the first machine.

3. The method of claim 1, wherein:

the data caching method comprises a statistically random method of determining whether to cache respective data received from another machine.

4. The method of claim 1, wherein the data caching method is based on at least one of a size of the specific data, a size of the local cache, a size of available caches in a linear communication orbit that includes the computational machine, and a size of a respective data set that includes the specific data.

5. The method of claim 1, wherein the specific data comprises one of a plurality of shards of an object, wherein the object comprises a data file, software application, software application update, software patch, database, or database update.

6. The method of claim 1, wherein the server is configured to provide the specific data to the head node of the linear communication orbit when no machine of the linear communication orbit stores a cached copy of the specific data.

7. The method of claim 1, wherein the data request comprises a first data request, the method further comprising receiving at the computational machine, after receiving the first data request, a second data request to request the same specific data as the first data request, and in accordance with a determination that predefined criteria are satisfied, forgoing passing the second data request to the second machine.

8. The method of claim 1, wherein the computational machine is an intermediate machine between neighboring machines within the linear communication orbit, the linear communication orbit being organized from a plurality of machines based on a set of rules at a specific time and subject to changes in configuration and membership when one or more machines join or exit the linear communication orbit.

9. The method of claim 8, wherein the computational machine is downstream of the first machine and upstream of the second machine in the linear communication orbit.

10. The method of claim 8, wherein the computational machine is downstream of the second machine and upstream of the first machine in the linear communication orbit.

11. The method of claim 1, wherein the computational machine and the first machine are interconnected by a single local area network.

12. A method of data caching and distribution, comprising:

at a computational machine having a local cache, wherein the computational machine is coupled in a linear communication orbit that is further coupled to a server via a head node of the linear communication orbit, and the computational machine is distinct from the head node, the linear communication orbit further including a second machine and a third machine;

generating a first data request that is used to request specific data;

passing, via the linear communication orbit, the data request to the second machine;

receiving, via the linear communication orbit, at the computational machine, from the third machine, a second data request to request the specific data after the computational machine generates the first data request, and in accordance with a determination that predefined criteria are satisfied, forgoing passing the second data request to the second machine; and

when the second machine returns, via the linear communication orbit, the specific data to the computational machine, returning, via the linear communication orbit, the specific data to the third machine,

wherein the head node, third machine, computational machine and second machine are sequentially ordered in an ordered sequence on the linear communication orbit based on a predefined set of rules, the computational machine is between the third machine and the second machine in said ordered sequence, and the third machine or second machine is between the head node and the computational machine in said ordered sequence.

13. A non-transitory computer-readable medium, having instructions stored thereon, which when executed by one or more processors cause the processors to perform operations comprising:

at a computational machine that has a local cache, wherein the computational machine is coupled in a linear communication orbit that is further coupled to a server via a head node of the linear communication orbit, and the computational machine is distinct from the head node, the linear communication orbit further including a first machine and a second machine;

receiving, via the linear communication orbit, from the first machine a data request that is used to request specific data;

determining whether the computational machine stores the specific data in the local cache; and

in accordance with a determination that the computational machine does not store the specific data in the local cache, responding to the data request, by;

passing, via the linear communication orbit, the data request to the second machine, and

when the second machine returns the specific data to the computational machine, returning, via the linear communication orbit, the specific data to the first machine and determining whether to store the specific data in the local cache according to a data caching method,

wherein the head node, first machine, computational machine and second machine are sequentially ordered in an ordered sequence on the linear communication orbit based on a predefined set of rules, the computational machine is between the first machine and the second machine in said ordered sequence, and the first machine or the second machine is between the computational machine and the head node in said ordered sequence.

14. The non-transitory computer-readable medium of claim 13, wherein the instructions, when executed by the one or more processors cause the one or more processors to perform further operations comprising:

in accordance with a determination that the computational machine stores the specific data in the local cache, responding to the data request by returning the specific data to the first machine.

15. The non-transitory computer-readable medium of claim 13, wherein the data caching method comprises a statistically random method of determining whether to cache respective data received from another machine.

16. The non-transitory computer-readable medium of claim 13, wherein the data caching method is based on at least one of a size of the specific data, a size of the local cache, a size of available caches in a linear communication orbit that includes the computational machine, and a size of a respective data set that includes the specific data.

17. The non-transitory computer-readable medium of claim 13, wherein the specific data comprises one of a plurality of shards of an object, wherein the object comprises a data file, software application, software application update, software patch, database, or database update.

18. The non-transitory computer-readable medium of claim 13, wherein the server is configured to provide the specific data to the head node of the linear communication orbit when no machine of the linear communication orbit stores a cached copy of the specific data.

19. A computational machine, comprising:

one or more processors;

a local cache; and

memory having instructions stored thereon, which when executed by the one or more processors cause the processors to perform operations, comprising;

at the computational machine, wherein the computational machine is coupled in a linear communication orbit that is further coupled to a server via a head node of the linear communication orbit, and the computational machine is distinct from the head node, the linear communication orbit further including a first machine and a second machine;

receiving, via the linear communication orbit, from the first machine a data request that is used to request specific data;

determining whether the computational machine stores the specific data in the local cache; and

in accordance with a determination that the computational machine does not store the specific data in the local cache, responding to the data request, by;

passing, via the linear communication orbit, the data request to the second machine, and

when the second machine returns the specific data to the computational machine, returning, via the linear communication orbit, the specific data to the first machine and determining whether to store the specific data in the local cache according to a data caching method;

wherein the head node, first machine, computational machine and second machine are sequentially ordered in an ordered sequence on the linear communication orbit based on a predefined set of rules, the computational machine is between the first machine and the second machine in said ordered sequence, and the first machine or the second machine is between the computational machine and the head node in said ordered sequence.

20. The computational machine of claim 19, wherein the instructions, when executed by the one or more processors cause the one or more processors to perform further operations comprising:

in accordance with a determination that the computational machine stores the specific data in the local cache, responding to the data request by returning the specific data to the first machine.

21. The computational machine of claim 19, wherein the data caching method comprises a statistically random method of determining whether to cache respective data received from another machine.

22. The computational machine of claim 19, wherein the data caching method is based on at least one of a size of the specific data, a size of the local cache, a size of available caches in a linear communication orbit that includes the computational machine, and a size of a respective data set that includes the specific data.

23. The computational machine of claim 19, wherein the specific data comprises one of a plurality of shards of an object, wherein the object comprises a data file, software application, software application update, software patch, database, or database update.

24. The computational machine of claim 19, wherein the server is configured to provide the specific data to the head node of the linear communication orbit when no machine of the linear communication orbit stores a cached copy of the specific data.