Hash-based access to resources in a data processing network

• US 8,024,306 B2
• Filed: 05/16/2007
• Issued: 09/20/2011
• Est. Priority Date: 12/12/2003
• Status: Active Grant

• Current Assignee: Kyndryl Incorporated
• Original Assignee: International Business Machines Corporation
• Inventors: Vijayaraghavan, Srinivas Belur, Aswathanarayana, Tejasvi, Palliyil, Sudarshan, Venkateshamurthy, Shivakumara
• Primary Examiner(s): Dwivedi; Mahesh H
• Application Number:
  US11/749,649
• Publication Number:
  US 20070244920A1
• Time in Patent Office: 1,588 Days
• Field of Search: 707/747, 707/697, 707/698, 713/181
• US Class Current: 707/698
• CPC Class Codes: G06F 16/9014 hash tables
• CPC Class Codes: H04L 67/564 Enhancement of application control based on intercepted application data

Abstract

Provided are methods, apparatus and computer programs for enhanced access to resources within a network, including for controlling use of bandwidth-sensitive connections within a network and/or for automated recovery. Hash values are used as ‘unique’ identifiers for resources distributed across a network, and each one of a set of pool servers store the hash values for a set of computers within a LAN. When a resource is required, a hash value representing the resource can be retrieved and compared with hash values stored at a pool server to determine whether the pool server holds a matching hash value. Any such matching hash value found on the pool server represents an identification of a local copy of the required resource, because of the uniqueness property of secure ash values. The information within the pool server can be used to access the required resource. If a large resource such as a BLOB or new version of a computer program can be obtained from another computer within a LAN, a reduction in reliance on bandwidth-sensitive Internet connections and reduced load on remote servers becomes possible.

Claims

1. A method for accessing resources within a data processing network, comprising:

computing a hash value representing a resource stored at a server data processing system;

embedding the hash value within an address portion of a hyperlink, thereby providing a hash-based resource reference, wherein the hyperlink points to the resource at least partly via the hash value, so that in providing the hyperlink responsive to a request for access to the resource, the resource is locatable via the hash-based resource reference in the hyperlink;

scanning the resource to identify hash-based resource references within hyperlinks of the resource; and

extracting the hash-based resource references from the hyperlinks to generate a modified resource which does not contain the extracted hashes, wherein the computing of a hash value representing a resource stored at a server data processing system includes;

applying a secure hash function to the modified resource to compute the hash value representing the resource, so that the computed hash value representing the resource is independent of the hash value itself, even if the resource reference is cyclic.

2. The method of claim 1, further comprising:

storing a set of hash values computed from a set of resources, wherein the resources are available from at least one data processing system within the network;

receiving a hash value representing a desired resource, and comparing the received hash value with the stored set of hash values to identify a match between the received hash value and any of the stored hash values; and

in response to identifying a match for the received hash value, initiating retrieval of the required resource from said at least one data processing system.

3. The method of claim 2, further comprising:

in response to a failure to identify a match for the received hash value by comparison with the set of hash values, initiating a communication with a data processing apparatus storing a second set of hash values and initiating a comparison between the received hash value and the hash values of the second set of hash values.

4. A computer program product, stored on a computer readable medium comprising a storage device, for accessing resources within a data processing network, said computer program product having instructions for execution by a computer, which, when executed by the computer, cause the computer to implement a method comprising:

computing a hash value representing a resource stored at a server data processing system;

embedding the hash value within an address portion of a hyperlink, thereby providing a hash-based resource reference, wherein the hyperlink points to the resource at least partly via the hash value, so that in providing the hyperlink responsive to a request for access to the resource, the resource is locatable via the hash-based resource reference in the hyperlink;

scanning the resource to identify hash-based resource references within hyperlinks of the resource; and

extracting the hash-based resource references from the hyperlinks to generate a modified resource which does not contain the extracted hashes, wherein the computing of a hash value representing a resource stored at a server data processing system includes;

applying a secure hash function to the modified resource to compute the hash value representing the resource, so that the computed hash value representing the resource is independent of the hash value itself, even if the resource reference is cyclic embedding at least one additional resource reference within the address portion of the hyperlink, to generate a hyperlink that comprises a plurality of resource references; and

embedding within the hyperlink relative priorities associated with the respective resource references.

5. The computer program product of claim 4, further comprising:

storing a set of hash values computed from a set of resources, wherein the resources are available from at least one data processing system within the network;

receiving a hash value representing a desired resource, and comparing the received hash value with the stored set of hash values to identify a match between the received hash value and any of the stored hash values; and

in response to identifying a match for the received hash value, initiating retrieval of the required resource from said at least one data processing system.

6. The computer program product of claim 5, further comprising:

in response to a failure to identify a match for the received hash value by comparison with the set of hash values, initiating a communication with a data processing apparatus storing a second set of hash values and initiating a comparison between the received hash value and the hash values of the second set of hash values.

7. A data processing system comprising:

a computer readable medium, wherein the computer readable medium comprises a storage device, said storage device storing and executing instructions for;

computing a hash value representing a resource stored at a server data processing system;

embedding the hash value within an address portion of a hyperlink, thereby providing a hash-based resource reference, wherein the hyperlink points to the reference at least partly via the hash value, so that in providing the hyperlink responsive to a request for access to the resource, the resource is locatable via the hash-based resource reference in the hyperlink;

scanning the resource to identify hash-based resource references within hyperlinks of the resource; and

extracting the hash-based resource references from the hyperlinks to generate a modified resource which does not contain the extracted hashes, wherein the computing of a hash value representing a resource stored at a server data processing system includes;

applying a secure hash function to the modified resource to compute the hash value representing the resource, so that the computed hash value representing the resource is independent of the hash value itself, even if the resource reference is cyclic;

embedding at least one additional resource reference within the address portion of the hyperlink, to generate a hyperlink that comprises a plurality of resource references; and

embedding within the hyperlink relative priorities associated with the respective resource references.

8. The data processing system of claim 7, wherein in response to a notification that a resource identified by a highest priority resource reference is inaccessible via a server computer, the storage device storing and executing instructions for:

determining the resource reference having a second highest priority;

identifying a respective server computer from the second highest resource reference; and

sending to the respective identified server computer a resource-access request including the second highest resource reference.