If-none-match for aggregated page distribution

• US 8,595,320 B2
• Filed: 11/22/2010
• Issued: 11/26/2013
• Est. Priority Date: 11/22/2010
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Sabir, Kenneth S, Tannous, Samuel J
• Primary Examiner(s): Kizou, Hassan
• Assistant Examiner(s): DAYA, TEJIS A
• Application Number:
  US12/951,942
• Publication Number:
  US 20120131132A1
• Time in Patent Office: 1,100 Days
• Field of Search: 711/138, 709/203
• US Class Current: 709/217
• CPC Class Codes: H04L 63/061 for key exchange, e.g. in peer-to-peer networks cryptographic mechanisms or cryptographic arrangements for key agreement H04L9/0838
• CPC Class Codes: H04L 63/123 received data contents, e.g. message integrity
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 67/566 Grouping or aggregating service requests, e.g. for unified processing
• CPC Class Codes: H04L 9/3226 using a predetermined code, e.g. password, passphrase or PIN network architectures or network communication protocols for supporting authentication of entities using passwords in a packet data network H04L63/083

Abstract

Embodiments of the present invention provide a method, system and computer program product for page request management for aggregated page content. In an embodiment of the invention, a method for page request management for aggregated page content can include issuing on behalf of a user a request for dynamically aggregated components in a page. The method further can include inserting into a header of the request a key computed as a combination of identifiers for the aggregated components and last modified data for the aggregated components. Finally, the method can include receiving in response to the request a new page of dynamically aggregated components for the user only if the computed key does not match a key computed for the new page. Otherwise, only a response is received indicating that the page has not been modified.

Claims

1. A content distribution data processing system configured for page request management for aggregated page content, the system comprising:

a processor and memory;

a content server executing in memory of a host computer and configured for communicative coupling to a plurality of content browsers over a computer communications network; and

, an if-none-match module coupled to the content server, the module comprising program code enabled upon execution in the host computer to

(A) extract a key from a request from a requestor received in the content server for dynamically aggregated components in a page,

(B) compute a key for the dynamically aggregated components requested in the request as a combination of identifiers for those of the aggregated components deemed accessible to the user and last modified data for the aggregated components deemed accessible to the user;

(C) compare the extracted and computed keys; and

,

(D) indicate in response to the request when the extracted and computed keys match that the requested page has not been modified in lieu of returning a newly generated form of the page with the dynamically aggregated components to the requestor.

2. The system of claim 1, further comprising a cache of previously generated pages of dynamically aggregated components, each previously generated page comprising an association with a cache key including a combination of identifiers for dynamically aggregated components of a corresponding previously generated page and last modified data for the dynamically aggregated components of the corresponding previously generated page.

3. The system of claim 1, wherein the extracted key is extracted from an entity tag in the request.

4. The system of 1, wherein the key is computed as a combination of identifiers for the aggregated components, last modified data for the aggregated components and a hierarchical path of each of the aggregated components.

5. A computer program product for page request management for aggregated page content, the computer program product comprising:

a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising;

computer readable program code for issuing on behalf of a user from a content browser executing in memory of a computer a request for dynamically aggregated components in a page;

computer readable program code for inserting into a header of the request a key computed as a combination of identifiers for those of the aggregated components deemed accessible to the user and last modified data for the aggregated components deemed accessible to the user; and

,

computer readable program code for receiving in response to the request a new page of dynamically aggregated components for the user only if the computed key does not match a key computed for the new page, but otherwise receiving only a response indicating that the page has not been modified.

6. The computer program product of claim 5, further comprising computer readable program code for generating a hash of the computed key and inserting the hash into the header in lieu of the computed key.

7. The computer program product of claim 5, wherein the computer readable program code for inserting into a header of the request a key computed as a combination of identifiers for the aggregated components and last modified data for the aggregated components, comprises computer readable program code for inserting into a header of the request an entity tag comprising a key computed as a combination of identifiers for the aggregated components and last modified data for the aggregated components.

8. The computer program product of claim 5, wherein the computer readable program code for inserting into a header of the request a key computed as a combination of identifiers for the aggregated components and last modified data for the aggregated components, comprises computer readable program code for inserting into a header of the request a key computed as a combination of identifiers for the aggregated components, last modified data for the aggregated components and a hierarchical path of each of the aggregated components.

9. The computer program product of claim 5, wherein the computer readable program code for receiving in response to the request a new page of dynamically aggregated components for the user only if the computed key does not match a key computed for the new page, but otherwise receiving only a response indicating that the page has not been modified, comprises computer readable program code for receiving in response to the request a new page of dynamically aggregated components for the user only if the computed key does not match a key computed for a cached form of the page, but otherwise receiving only a response indicating that the page has not been modified.