Method and System for Dynamic Distributed Data Caching

• US 20100241810A1
• Filed: 06/01/2010
• Published: 09/23/2010
• Est. Priority Date: 01/12/2001
• Status: Active Grant

• Current Assignee: Microsoft Corporation
• Original Assignee: Parallel Networks, LLC (epicRealm Licensing LP)
• Inventors: Chin, Bryan S., Consolver, David A., DeMasters, Gregg A., Lowery, Keith A.
• Granted Patent: US 7,890,701 B2
• Time in Patent Office: Days
• US Class Current: 711/130
• 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 method includes providing a cache community (402) comprising at least one peer (413). Each peer has an associated first content portion (511) indicating content to be cached by the respective peer. A client (404) may be allowed to join the cache community. A peer list (426) associated with the cache community is updated to include the client. The peer list indicates the peers in the cache community. A respective second content portion (511) is associated with each peer based on the addition of the client.

Claims

1. A method for dynamic distributed data caching, comprising:

establishing a cache community for data storage, the cache community including a master member;

determining that the master member is to voluntarily leave the cache community;

determining whether the cache community includes other peer members;

selecting a peer member to become a new master of the cache community in response to the cache community including other peer members;

sending a nominate master message to the peer member selected to be the new master of the cache community.

2. The method of claim 1, further comprising:

receiving a response to the nominate master message from the peer member;

shutting down the master member from the cache community.

3. The method of claim 1, further comprising:

determining that a response to the nominate master message has not been received from the peer member;

selecting a new peer member to become the new master of the cache community.

4. The method of claim 1, further comprising:

updating a peer list for the cache community by removing the master member from the peer list.

5. The method of claim 1, further comprising:

sending a remove master request in response to the cache community not including any other peer members.

6. The method of claim 1, wherein the peer member is selected to be the new master member based on either bandwidth availability or processing capability.

7. A computer readable storage medium including executable code for dynamic distributed data caching, the executable code operable to:

establish a cache community for data storage, the cache community including a master member;

determine that the master member is to voluntarily leave the cache community;

determine whether the cache community includes other peer members;

select a peer member to become a new master of the cache community in response to the cache community including other peer members;

send a nominate master message to the peer member selected to be the new master of the cache community.

8. The computer readable storage medium of claim 7, wherein the executable code is further operable to:

receive a response to the nominate master message from the peer member;

shut down the master member from the cache community.

9. The computer readable storage medium of claim 7, wherein the executable code is further operable to:

determine that a response to the nominate master message has not been received from the peer member;

select a new peer member to become the new master of the cache community.

10. The computer readable storage medium of claim 7, wherein the executable code is further operable to:

update a peer list for the cache community by removing the master member from the peer list.

11. The computer readable storage medium of claim 7, wherein the executable code is further operable to:

send a remove master request in response to the cache community not including any other peer members.

12. The computer readable storage medium of claim 7, wherein the executable code is further operable to:

select the peer member be the new master member based on either bandwidth availability or processing capability.

13. A system for dynamic distributed data caching, comprising:

means for establishing a cache community for data storage, the cache community including a master member;

means for determining that the master member is to voluntarily leave the cache community;

means for determining whether the cache community includes other peer members;

means for selecting a peer member to become a new master of the cache community in response to the cache community including other peer members;

means for sending a nominate master message to the peer member selected to be the new master of the cache community.

14. The system of claim 13, further comprising:

means for receiving a response to the nominate master message from the peer member;

means for shutting down the master member from the cache community.

15. The system of claim 13, further comprising:

means for determining that a response to the nominate master message has not been received from the peer member;

means for selecting a new peer member to become the new master of the cache community.

16. The system of claim 13, further comprising:

means for updating a peer list for the cache community by removing the master member from the peer list.

17. The system of claim 13, further comprising:

means for sending a remove master request in response to the cache community not including any other peer members.

18. The system of claim 13, wherein the peer member is selected to be the new master member based on either bandwidth availability or processing capability.