Method and system for dynamic distributed data caching
First Claim
Patent Images
1. A method for dynamic distributed data caching, comprising:
- determining that a first master associated with a cache community is non-operational;
electing a second master from peer members in the cache community to replace the first master, wherein electing the second master includes;
communicating a hold election message to the peer members in the cache community;
receiving at least one response to the hold election message;
selecting one of the peer members to be the second master;
communicating an update master message to a cache server tracking the cache community;
allocating at least one content portion for caching among the peer members in the cache community based on the first master being non-operational.
5 Assignments
0 Petitions
Accused Products
Abstract
A method and system for dynamic distributed data caching is presented. The method includes providing a cache community comprising at least one peer. Each peer has an associated first content portion indicating content to be cached by the respective peer. A client may be allowed to join the cache community. A peer list 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 is associated with each peer based on the addition of the client.
-
Citations
16 Claims
-
1. A method for dynamic distributed data caching, comprising:
-
determining that a first master associated with a cache community is non-operational; electing a second master from peer members in the cache community to replace the first master, wherein electing the second master includes; communicating a hold election message to the peer members in the cache community; receiving at least one response to the hold election message; selecting one of the peer members to be the second master; communicating an update master message to a cache server tracking the cache community; allocating at least one content portion for caching among the peer members in the cache community based on the first master being non-operational. - View Dependent Claims (2, 3, 4)
-
-
5. A method for dynamic distributed data caching, comprising:
-
determining that a first master associated with a cache community is non-operational; electing a second master from peer members in the cache community to replace the first master, and allocating at least one content portion for caching among the peer members in the cache community based on the first master being non-operational, wherein allocating at least one content portion includes; allocating respective content portions to peer members in the cache community; updating an allocation table at the second master to indicate allocation of the respective content portions associated with the respective peer members. - View Dependent Claims (6)
-
-
7. A computer readable medium including code for dynamic distributed data caching, the code operable to:
-
determine that a first master associated with a cache community is non-operational; elect a second master from peer members in the cache community to replace the first master, wherein a second master is elected by; communicating a hold election message to the peer members in the cache community; receiving at least one response to the hold election message; selecting one of the peer members to be the second master; and communicating an update master message to a cache server tracking the cache community; allocate at least one content portion for caching among the peer members in the cache community based on the first master being non-operational. - View Dependent Claims (8)
-
-
9. A computer readable medium including code for dynamic distributed data caching, the code operable to:
-
determine that a first master associated with a cache community is non-operational; elect a second master from peer members in the cache community to replace the first master; and allocate at least one content portion for caching among the peer members in the cache community based on the first master being non-operational, wherein the code that allocates at least one content portion is further operable to; allocate respective content portions to the peer members in the cache community; and update an allocation table at the second master to indicate allocation of the respective content portions associated with the respective peer members. - View Dependent Claims (10)
-
-
11. A system for dynamic distributed data caching comprising:
-
means for determining that a first master associated with a cache community is non-operational; means for electing a second master from peer members in the cache community to replace the first master, wherein the means for electing the second master includes; means for communicating a hold election message to the peer members in the cache community; means for receiving at least one response to the hold election message; means for selecting one of the peer members to be the second master; means for communicating an update master message to a cache server tracking the cache community; means for allocating at least one content portion for caching among the peer members in the cache community based on the first master being non-operational. - View Dependent Claims (12, 13, 14)
-
-
15. A system for dynamic distributed data caching comprising:
-
means for determining that a first master associated with a cache community is non-operational; means for electing a second master from peer members in the cache community to replace the first master; and means for allocating at least one content portion for caching among the peer members in the cache community based on the first master being non-operational, wherein the means for allocating at least one content portion includes; means for allocating respective content portions to peer members in the cache community; means for updating an allocation table at the second master to indicate allocation of the respective content portions associated with the respective peer members. - View Dependent Claims (16)
-
Specification