Distributed caching architecture for computer networks

• US 20020103848A1
• Filed: 11/29/2000
• Published: 08/01/2002
• Est. Priority Date: 11/29/2000
• Status: Active Grant

• Current Assignee: Augur Vision, Inc., Broadspider Networks, Inc. (OpenLocker Holdings, Inc.)
• Original Assignee: Broadspider Networks, Inc. (OpenLocker Holdings, Inc.)
• Inventors: Pitio, Walter Michael, Giacomini, Peter Joseph, Shugard, Donald David, Rodriguez, Hector Francisco
• Granted Patent: US 7,225,219 B2
• Time in Patent Office: Days
• US Class Current: 709/200
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• 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/2885 Hierarchically arranged intermediate devices, e.g. for hierarchical caching
• CPC Class Codes: H04L 67/561 Adding application-functional data or data for application control, e.g. adding metadata
• CPC Class Codes: H04L 67/564 Enhancement of application control based on intercepted application data
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]

Abstract

A distributed chaching technique for use in computer networks is disclosed. The illustrative embodiment is particularly advantageous in computer networks that comprises a hierarchical topology because it removes some of the computational tasks associated with chaching away from the network nodes that act as caches to other network nodes that are less burdened with computational tasks. Furthermore, some embodiments of the present invention use hash tables to facilitate the storage and retrieval of cached resources. The illustrative embodiment of the present invention comprises: hashing at a first processor a first resource identifier to create a hash key, wherein the first resource identifier identifies a first resource; transmitting from the first processor to a second processor the hash key and a request for the first resource; and receiving at the first processor a second resource in response to the transmission of the hash key and the request for the first resource from the first processor to the second processor.

Claims

1. A method comprising:

hashing at a first processor a first resource identifier to create a hash key, wherein said first resource identifier identifies a first resource;

transmitting from said first processor to a second processor said hash key and a request for said first resource; and

receiving at said first processor a second resource in response to the transmission of said hash key and said request for said first resource.

2. The method of claim 1 further comprising receiving at said first processor a second resource identifier in response to the transmission of said hash key and said request for said first resource.

3. The method of claim 2 wherein said first processor verifies that said second resource is said first resource by comparing said second resource identifier to said first resource identifier.

4. The method of claim 1 further comprising transmitting from said first processor to said second processor said first resource identifier in addition to said hash key and said request for said first resource.

5. The method of claim 4 wherein said second processor stores said second resource and said second resource identifier in a data structure that is indexed by said hash key.

6. The method of claim 5 wherein said second processor verifies that said second resource is said first resource by comparing said second resource identifier to said first resource identifier.

7. The method of claim 1 wherein said hash key and said request for said first resource are transmitted from said first processor to said second processor when said all or a portion of said hash key is contained in a list of valid hash keys associated with said first processor.

8. An apparatus comprising:

a first processor for hashing a first resource identifier to create a hash key, wherein said first resource identifier identifies a first resource;

a transmitter for transmitting said hash key and a request for said first resource to a second processor; and

a receiver for receiving a second resource in response to the transmission of said hash key and said request for said first resource.

9. The apparatus of claim 8 wherein said receiver also receives a second resource identifier in response to the transmission of said hash key and said request for said first resource.

10. The apparatus of claim 9 wherein said first processor verifies that said second resource is said first resource by comparing said second resource identifier to said first resource identifier.

11. The apparatus of claim 8 wherein said transmitter also transmits to said second processor said first resource identifier in addition to said hash key and said request for said first resource.

12. The apparatus of claim 11 wherein said second processor stores said second resource and said second resource identifier in a data structure that is indexed by said hash key.

13. The apparatus of claim 12 wherein said second processor verifies that said second resource is said first resource by comparing said second resource identifier to said first resource identifier.

14. The apparatus of claim 8 wherein said hash key and said request for said first resource are transmitted from said first processor to said second processor when said all or a portion of said hash key is contained in a list of valid hash keys associated with said first processor.

15. A method comprising:

receiving a request for a first resource and a hash key that is a hashed function of a first resource identifier;

retrieving said first resource and said first resource identifier from a data structure that is indexed by said hash key; and

transmitting said first resource and said first resource identifier in response to said request for said first resource.

16. An apparatus comprising:

a receiver for receiving a request for a first resource and a hash key that is a hashed function of a first resource identifier;

a processor for retrieving said first resource and said first resource identifier from a data structure that is indexed by said hash key; and

a transmitter for transmitting said first resource and said first resource identifier in response to said request for said first resource.

17. A method comprising:

receiving at a first processor a first resource identifier that identifies a first resource, a hash key that is a hashed function of said first resource identifier, and a request for a first resource;

retrieving a second resource and a second resource identifier from a data structure that is indexed by said hash key;

verifying that said second resource is said first resource by comparing said second resource identifier to said first resource identifier; and

transmitting said second resource to said first processor when said second resource is verified as said first resource.

18. An apparatus comprising:

a receiver for receiving at a first processor a first resource identifier that identifies a first resource, a hash key that is a hashed function of said first resource identifier, and a request for a first resource;

a processor for retrieving a second resource and a second resource identifier from a data structure that is indexed by said hash key, and for verifying that said second resource is said first resource by comparing said second resource identifier to said first resource identifier; and

a transmitter for transmitting said second resource to said first processor when said second resource is verified as said first resource.

19. A method comprising:

hashing at a first processor a first resource identifier to create a hash key, wherein said first resource identifier identifies a first resource;

transmitting from said first processor to a second processor said hash key and a request for said first resource when said all or a portion of said hash key is contained in a list of valid hash keys associated with said first processor; and

receiving at said first processor said first resource in response to the transmission of said hash key and said request for said first resource.

20. An apparatus comprising:

a processor for hashing at a first processor a first resource identifier to create a hash key, wherein said first resource identifier identifies a first resource, and for verifying that all or a portion of said hash key is contained in a list of valid hash keys;

a transmitter for transmitting from said first processor to a second processor said hash key and a request for said first resource; and

a receiver for receiving said first resource in response to the transmission of said hash key and said request for said first resource.

21. A method comprising:

receiving at a first processor a request for a first resource and a first hash key that is a hashed function of a first resource identifier;

retrieving a second resource and a first portion of a second hash key from a data structure that is indexed by a first portion of said first hash key;

verifying that said second resource is said first resource by comparing a second portion of said first hash key to said first portion of said second hash key; and

transmitting said second resource to said first processor when said second resource is verified as said first resource.

22. An apparatus comprising:

a receiver for receiving at a first processor a request for a first resource and a first hash key that is a hashed function of a first resource identifier;

a processor for retrieving a second resource and a first portion of a second hash key from a data structure that is indexed by a first portion of said first hash key, and for verifying that said second resource is said first resource by comparing a second portion of said first hash key to said first portion of said second hash key; and

a transmitter for transmitting said second resource to said first processor when said second resource is verified as said first resource.