Methods and systems for multi-caching

• US 8,397,027 B2
• Filed: 08/11/2008
• Issued: 03/12/2013
• Est. Priority Date: 08/10/2007
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: EMC Corporation (Dell Technologies Inc.)
• Inventors: Sivakumar, Raghupathy, Velayutham, Aravind, Zhuang, Zhenyun
• Primary Examiner(s): BATAILLE, PIERRE MICHE
• Application Number:
  US12/228,171
• Publication Number:
  US 20090049237A1
• Time in Patent Office: 1,674 Days
• Field of Search: 711/118, 711/147, 711/156, 711/207, 711/203, 711/133, 711/E12.019, 707/999.01, 707/E17.032
• US Class Current: 711/133
• CPC Class Codes: G06F 12/0813 with a network or matrix configuration
• CPC Class Codes: G06F 12/0815 Cache consistency protocols
• CPC Class Codes: G06F 12/126 with special data handling, e.g. priority of data or instructions, handling errors or pinning
• CPC Class Codes: G06F 2212/502 using adaptive policy
• CPC Class Codes: H04L 67/288 Distributed intermediate devices, i.e. intermediate devices for interaction with other intermediate devices on the same level
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching

Abstract

Provided are methods and systems for multi-caching. The methods and systems provided can enhance network content delivery performance in terms of reduced response time and increased throughput, and can reduce communication overhead by decreasing the amount of data that have to be transmitted over the communication paths.

Claims

1. A method for data multi-caching, comprising:

receiving a unique identifier from a first node at a second node;

determining data corresponding to the unique identifier;

if the data corresponding to the unique identifier is present at the second node, transmitting the data to a third node; and

if the data corresponding to the unique identifier is not present at the second node, transmitting a cache mismatch error to the first node.

2. The method of claim 1, wherein receiving a unique identifier from a first node comprises receiving a hash value.

3. The method of claim 1, wherein determining data corresponding to the unique identifier comprises searching a local cache at the second node.

4. The method of claim 1, wherein transmitting the data to a third node comprises transmitting the unique identifier.

5. The method of claim 1, further comprising:

if the data corresponding to the unique identifier is present and the second node is the destination node, retrieving the data.

6. A method for data multi-caching, comprising:

receiving a plurality of data packets;

generating a plurality of first unique identifiers for one or more of the plurality of data packets, wherein one or more of the plurality of first unique identifiers comprises a cryptographic hash and a prioritization factor; and

generating a second unique identifier for one or more of the plurality of first unique identifiers.

7. The method of claim 6, wherein generating a plurality of first unique identifier comprises generating a hash value.

8. The method of claim 7, wherein generating a hash value comprises the MD5 algorithm.

9. The method of claim 6, further comprising, transmitting a set of unique identifiers in a single data packet.

10. The method of claim 6, further comprising:

receiving a third unique identifier for a second plurality of data packets; and

determining if the third unique identifier matches the second unique identifier.

11. A method for data multi-caching, comprising:

receiving a plurality of data packets;

applying a granularity adjustment to the data packets;

generating a plurality of first unique identifier for the adjusted data packets, wherein the plurality of first unique identifiers comprise one or more of a cryptographic hash and a prioritization factor; and

generating a second unique identifier for one or more of the plurality of first unique identifiers.

12. The method of claim 11, wherein applying a granularity adjustment to the data packets comprises segmenting the data packets into a plurality of segments.

13. The method of claim 12, wherein segmenting the data packets into a plurality of segments comprises dividing the data packet based on a Rabin polynomial.

14. The method of claim 11, wherein the prioritization factor comprises one or more of, bandwidth, frequency of access for a data pattern, importance of peer, and performance history.

15. A method for multi-caching, comprising:

determining an inconsistency between a first cache map on a first node and a second cache map on a second node;

transmitting a first set of unique identifiers from the first cache map to the second node;

comparing the first set of unique identifiers from the first cache map to a second set of unique identifiers from the second cache map;

identifying one or more unique identifiers to be discarded from the first cache map; and

transmitting the one or more unique identifiers to be discarded to the first node.

16. The method of claim 15, wherein the first cache map comprises data and unique identifiers associated with the data stored on the first node and the second cache map comprises data and unique identifiers associated with the data stored on the second node.

17. The method of claim 15, wherein determining an inconsistency between a first cache map on a first node and a second cache map on a second node comprises:

generating a first unique identifier for a for a first cache map at a first node;

transmitting the unique identifier to a second node;

generating a second unique identifier for a second cache map at the second node; and

comparing the first unique identifier and the second unique identifier to determine consistency of the first cache map and the second cache map.