IP Library › Granted Patent US 7,315,884
Granted Patent B2
US 7,315,884 · App. 09/825,661 · Granted Jan 1, 2008

Reduction of network retrieval latency using cache and digest

Assignee: Hewlett-Packard Development Company, L.P.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,315,884
App. No.
09/825,661
Filed
Apr 3, 2001
Granted
Jan 1, 2008
Kind
B2
Art Unit
2154
USPC
709/217
Abstract

A system and method for comparing a digest value in an incoming response to a digest index (e.g., a hash table). The digest index includes digest values of data objects already cached at a cache. Data object retrieval is avoided when a match is found between the digest value and a digest value in the digest index.

Claims (70)

1. A method for reducing network retrieval latency, comprising the steps of:

sending a request for a data object to a server;

receiving a header portion of a response to said request;

parsing said header portion for a digest value;

comparing said digest value to a digest index;

retrieving a cached data object from a cache if said digest value has a match in said digest index;

sending said cached data object to a client; and

informing said server to stop sending a remaining portion of said response.

2. The method of claim 1 , further comprising the steps of:

checking said cache for said data object before sending said request to said server; and

sending said data object to said client if said data object is found in said cache.

3. The method of claim 1 , wherein said digest index is a hash table.

4. The method of claim 1 , further comprising the steps of:

receiving said remaining portion of said response from said server if no match for said digest value is found in said digest index based on said comparing step; and

sending said remaining portion of said response to said client.

5. The method of claim 1 , wherein said informing includes the step of:

instructing said server to terminate a connection.

6. The method of claim 1 wherein said informing comprises:

responsive to determining said digest value has a match in said digest index, performing said informing.

7. A method for reducing network retrieval latency, comprising the steps of:

sending a request for a data object to a server;

receiving a server response from said server;

calculating a digest value for said data object based on said server response;

sending a response to a client cache starting with a header portion, said header portion including said digest value and enabling said client cache to compare said digest value to a digest index, retrieve a cached data object from said client cache if said digest value has a match in said digest index, and send said cached data object to a client; and

upon receiving a message from said client cache to stop sending said response, stopping the sending of said response.

8. A method for reducing network retrieval latency, comprising the steps of:

receiving a first request for a data object;

obtaining a digest value of said requested data object;

inserting said digest value into a header portion of a response;

sending said response, starting with said header portion; and

upon receiving a second request to stop sending said response, stopping the sending of said response.

9. The method of claim 8 , wherein said obtaining includes the step of:

retrieving said digest value from a hash table.

10. The method of claim 8 , wherein said obtaining includes the step of:

calculating said digest value based on contents of said data object.

11. A computer program product for use in conjunction with a computer system for reducing network retrieval latency, comprising:

logic code for sending a request for a data object to a server;

logic code for receiving a header portion of a response to said request;

logic code for parsing said header portion for a digest value;

logic code for comparing said digest value to a digest index;

logic code for retrieving a cached data object from a cache if said digest value has a match in said digest index;

logic code for sending said cached data object to a client; and

logic code for informing said server to stop sending a remaining portion of said response.

12. The computer program product of claim 11 , further comprising:

logic code for checking said cache for said data object before sending said request to said server; and

logic code for sending said data object to said client if said data object is found in said cache.

13. The computer program product of claim 11 , wherein said digest index is a hash table.

14. The computer program product of claim 11 , further comprising:

logic code for receiving said remaining portion of said response from said server if no match for said digest value is found in said digest index based on said comparing; and

logic code for sending said remaining portion of said response to said client.

15. The computer program product of claim 11 , wherein said logic code for informing includes:

logic code for instructing said server to terminate a connection.

16. The computer program product of claim 11 , wherein said logic code for informing said server to stop sending a remaining portion of said response comprises:

logic code for performing said informing responsive to said logic code for comparing determining that said received digest value has a match in said digest index.

17. A computer program product for reducing network retrieval latency, comprising:

logic code for sending a request for a data object to a server;

logic code for receiving a server response from said server;

logic code for calculating a digest value for said data object based on said server response;

logic code for sending a response to a client cache starting with a header portion, said header portion including said digest value and enabling said client cache to compare said digest value to a digest index, retrieve a cached data object from said client cache if said digest value has a match in said digest index, and send said cached data object to a client; and

logic code for stopping the send of said response upon receiving a message from said client cache to stop sending said response.

18. A computer program product for reducing network retrieval latency, comprising:

logic code for receiving a first request for a data object;

logic code for obtaining a digest value of said requested data object;

logic code for inserting said digest value into a header portion of a response;

logic code for sending said response, starting with said header portion; and

logic code for stopping the sending of said response upon receiving a second request to stop sending said response.

19. The computer program product of claim 18 , wherein said logic code for obtaining includes:

logic code for retrieving said digest value from a hash table.

20. The computer program product of claim 18 , wherein said logic code for obtaining includes:

logic code for calculating said digest value based on contents of said data object.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 9, 2015
From: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
To: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Reel/Frame 037079/0001 →
CHANGE OF NAME Recorded May 12, 2004
From: COMPAQ INFORMATION TECHNOLOGIES GROUP LP
To: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
Reel/Frame 014628/0103 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 18, 2001
From: COMPAQ COMPUTER CORPORATION
To: COMPAQ INFORMATION TECHNOLOGIES GROUP, L.P.
Reel/Frame 012374/0382 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 3, 2001
From: MOGUL, JEFFREY C.
To: COMPAQ COMPUTER CORPORATION
Reel/Frame 011713/0681 →
Continuity (1)
Related Publication 20020143892A1 · Oct 3, 2002