Method and system for dynamic distributed data caching

• US 8,205,044 B2
• Filed: 02/14/2011
• Issued: 06/19/2012
• Est. Priority Date: 01/12/2001
• Status: Expired due to Term

• Current Assignee: Microsoft Corporation
• Original Assignee: Parallel Networks, LLC (epicRealm Licensing LP)
• Inventors: Lowery, Keith A., Chin, Bryan S., Consolver, David A., DeMasters, Gregg A.
• Primary Examiner(s): ELMORE, STEPHEN C
• Application Number:
  US13/026,966
• Publication Number:
  US 20110161421A1
• Time in Patent Office: 491 Days
• Field of Search: 711/130, 711/154, 711/158, 709/216, 709/221, 709/223, 709/240
• 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 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 system for dynamic distributed data caching, comprising:

one or more peer members;

a master member, the master member and the one or more peer members forming a cache community for data storage, the master member operable to select one of the one or more peer members to become a new master member, the master member operable to update a peer list for the cache community by removing itself from the peer list, the master member 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.

2. The system of claim 1, wherein the master member is operable to receive a reply to the nominate master message from the selected peer member, the master member operable to shut down in response to the reply.

3. The method of claim 1, wherein the master member is operable to determine that a reply to the nominate master message has not been received from the selected peer member, the master member operable to select a new peer member to become the new master of the cache community.

4. The method of claim 1, wherein the master member selects the one of the one or more peer members to be the new master member based on bandwidth availability at the selected peer member.

5. The method of claim 1, wherein the master member selects the one of the one or more peer members to be the new master member based on processing capability at the selected peer member.

6. The system of claim 1, wherein the selected peer member is operable to forward the updated peer list to other members of the cache community.

7. The system of claim 1, wherein the selected peer member is operable to send an update master request to a cache server for updating a community list for the cache community.

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

forming by a master member a cache community with the master member and one or more peer members;

selecting by the master member one of the one or more peer members to become a new master member;

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

sending by the master member a nominate master message and an updated peer list to a peer member selected by the master member to become the new master member.

9. The method of claim 8, further comprising:

receiving a reply at the master member to the nominate master message from the selected peer member;

shutting down the master member in response to the reply.

10. The method of claim 8, further comprising:

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

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

11. The method of claim 8, wherein the master member selects the one of the one or more peer members to be the new master member based on bandwidth availability at the selected peer member.

12. The method of claim 8, wherein the master member selects the one of the one or more peer members to be the new master member based on processing capability at the selected peer member.

13. The method of claim 8, further comprising:

forwarding by the selected peer member the updated peer list to other members of the cache community.

14. The method of claim 8, further comprising:

sending by the selected peer member an update master request to a cache server for updating a community list for the cache community.

15. A non-transitory computer readable storage medium including code for dynamic distributed data caching, the code operable to:

form by a master member a cache community with the master member and one or more peer members;

select by the master member one of the one or more peer members to become a new master member;

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

send by the master member a nominate master message and an updated peer list to a peer member selected by the master member to become the new master member.

16. The non-transitory computer readable storage medium of claim 15, wherein the code is further operable to:

receive a reply at the master member to the nominate master message from the selected peer member;

shut down the master member in response to the reply.

17. The non-transitory computer readable storage medium of claim 15, wherein the code is further operable to:

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

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

18. The non-transitory computer readable storage medium of claim 15, wherein the code selects the one of the one or more peer members to be the new master member based on bandwidth availability or processing capability at the selected peer member.

19. The non-transitory computer readable storage medium of claim 15, wherein the code is further operable to:

forward at the selected peer member the updated peer list to other members of the cache community.

20. The non-transitory computer readable storage medium of claim 15, wherein the code is further operable to:

send at the selected peer member an update master request to a cache server for updating a community list for the cache community.