Method and System for Dynamic Distributed Data Caching

• US 20160285995A1
• Filed: 06/10/2016
• Published: 09/29/2016
• Est. Priority Date: 01/12/2001
• Status: Active Grant

• Current Assignee: Parallel Networks, LLC (epicRealm Licensing LP)
• Original Assignee: Parallel Networks, LLC (epicRealm Licensing LP)
• Inventors: Lowery, Keith A, Chin, Bryan S, Consolver, David A, DeMasters, Gregg A
• Granted Patent: US 9,602,618 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/9537 Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
• CPC Class Codes: G06F 16/9574 of access to content, e.g. by caching
• CPC Class Codes: H04L 43/16 Threshold monitoring
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1046 Joining mechanisms
• CPC Class Codes: H04L 67/1048 Departure or maintenance mechanisms
• CPC Class Codes: H04L 67/1068 Discovery involving direct consultation or announcement among potential requesting and potential source peers
• CPC Class Codes: H04L 67/108 characterised by resources being split in blocks or fragments
• 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 67/568 Storing data temporarily at an intermediate stage, e.g. caching

Abstract

A method and system for dynamic distributed data caching is presented. The system includes one or more peer members and a master member. The master member and the one or more peer members form cache community for data storage. The master member is operable to select one of the one or more peer members to become a new master member. The master member is operable to update a peer list for the cache community by removing itself from the peer list. The master member is operable to send a nominate master message and an updated peer list to a peer member selected by the master member to become the new master member.

Claims

1. A client system in a cache community for community data caching, comprising:

a storage space including a dedicated cache portion operable to cache content in the cache community;

a cache module operable to manage content cached in the cache portion of the storage space, the cache module including a location table operable to identify locations of caches within the cached community where content should be cached;

a processor operable to generate a request for content, the cache module operable to intercept and process the request, determine where the content should be located, query a remote cache module for the content if the content should be located at the remote cache module, and deliver requested content from any cache in the cache community when cached or from an origin server when not cached;

wherein the cache module is configurable to limit consumption of resources in the client system.

2. The client system of claim 1, wherein the cache module is configurable to limit a size of the cached portion in the storage space for storing cached content.

3. The client system of claim 1, wherein the cache module is configurable to limit an amount of processor time used in storing cached content.

4. The client system of claim 1, wherein the cache module is configurable to limit storing of cached content to when the client system is idle.

5. The client system of claim 4, wherein the client system is idle when processor usage is below a particular threshold.

6. The client system of claim 4, wherein the client system is idle when a screen saver is active.

7. The client system of claim 7, wherein the cache module is configurable to limit an amount of bandwidth on a link to the cache community.

8. A method for community data caching, comprising:

allocating a dedicated cache portion in a storage space of a distributed location as part of a cache community for caching content;

managing content cached in the cache portion of the storage space;

populating a location table at the distributed location, the location table identifying each distributed location of cache portions within the cached community where particular content is desired to be cached;

intercepting a request for content;

determining where the content should be located;

sending a query to a particular distributed location where the content should be located;

delivering the requested content from the particular distributed location when cached therein;

retrieving the content from an origin server when the requested content is not cached at the particular distributed location;

dynamically limiting consumption of resources in the distributed location for data caching.

9. The method of claim 8, wherein a size of the cached portion in the storage space is dynamically set for storing cached content as a percentage of an entire space of the storage space.

10. The method of claim 8, wherein an amount of processor time used in storing cached content is dynamically set as a percentage of an entire processor time.

11. The method of claim 8, wherein storing of cached content is limited to when the distributed location is idle.

12. The method of claim 11, wherein the distributed location is idle when processor usage is below a particular threshold.

13. The method of claim 11, wherein the distributed location is idle when a screen saver is active.

14. The method of claim 8, wherein an amount of bandwidth on a link to the cache community is dynamically set.

19. The computer readable medium of claim 11, wherein the distributed location is idle when processor usage is below a particular threshold or when a screen saver is active.

20. The computer readable medium of claim 11, wherein an amount of bandwidth on a link to the cache community is dynamically set.

15. A non transitory computer readable medium including code for community data caching, the code operable to:

allocate a dedicated cache portion in a storage space of a distributed location as part of a cache community for caching content;

manage content cached in the cache portion of the storage space;

populate a location table at the distributed location, the location table identifying each distributed location of cache portions within the cached community where particular content is desired to be cached;

intercept a request for content;

determine where the content should be located;

send a query to a particular distributed location where the content should be located;

deliver the requested content from the particular distributed location when cached therein;

retrieve the content from an origin server when the requested content is not cached at the particular distributed location;

dynamically limit consumption of resources in the distributed location for data caching.

16. The computer readable medium of claim 15, wherein a size of the cached portion in the storage space is dynamically set for storing cached content as a percentage of an entire space of the storage space.

17. The computer readable medium claim 15, wherein an amount of processor time used in storing cached content is dynamically set as a percentage of an entire processor time.

18. The computer readable medium of claim 15, wherein storing of cached content is limited to when the distributed location is idle.