# US 2003/0229675 A1 · Effective garbage collection from a Web document distribution cache at a World Wide Web source site

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0229675 A1
- Document ID: US20030229675A1
- Status: Published application
- Kind: A1
- Application number: 10/165,082
- Filed: 2002-06-06
- Published: 2003-12-11
- Earliest claimed: 2002-06-06
- Assignees: International Business Machines Corporation
- Inventors: Andrew Dunshea; James Newman Chen
- Web page: https://patentgrep.com/patent/US20030229675A1

## CPC

- H04L 67/02: based on web technology, e.g. hypertext transfer protocol [HTTP]
- H04L 67/5682: Policies or rules for updating, deleting or replacing the stored data
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Protocols based upon recency of use of Web documents have, in the past, been relatively satisfactory in clearing of caches. However, the greatly accelerated use of the Web both in numbers of users and in the sizes of Web documents demands more effective processes for Web cache clearing. Accordingly, there is determined for each Web document in the cache, a retrieval hardship factor. Then, in the clearing of documents from the cache, this retrieval hardship factor will be used in combination with the recency of use protocols in determining which documents are to be cleared from the cache. The retrieval hardship factor may be effectively used in combination with either most recently used (MRU) or least recently used (LRU) cache garbage collection procedures. The hardship retrieval factor is preferably determined for each accessed and cached Web document by the owner or host of the Web site, i.e. the resource location or source database on the Web. At least the following three attributes are used in this determination of the hardship retrieval factor: the total CPU time for retrieving the document from a resource database; bandwidth use involved in retrieving the document from a resource database; and interference with other network traffic involved in retrieving the document from a resource database.

## Claims

### Claim 1

In a World Wide Web (Web) communication network with user access via a plurality of data processor controlled interactive receiving display stations for displaying Web documents transmitted to said receiving display stations from resource locations remote from said stations, a Web server system for accessing said Web documents from resource databases and transmitting said Web documents onto said Web comprising:
a cache for temporarily storing a plurality of accessed Web documents;
means for determining for each of said individual documents in said cache, a retrieval hardship factor; and
means for clearing selected stored individual documents from said cache based upon recency of use of said documents and said retrieval hardship factor.

### Claim 2 (depends on 1)

The Web system of claim 1 wherein said recency of use of said cache documents is based on most recently used (MRU) documents.

### Claim 3 (depends on 1)

The Web system of claim 1 wherein said recency of use of said cache documents is based on least recently used (LRU) documents.

### Claim 4 (depends on 1)

The Web system of claim 1 further having means for determining said retrieval hardship factor for each cache document including the attribute of the total CPU time for retrieving the document from a resource database.

### Claim 5 (depends on 4)

The Web system of claim 4 wherein said means for determining said retrieval hardship factor for each cache document further includes the attribute of bandwidth use involved in retrieving the document from a resource database.

### Claim 6 (depends on 5)

The Web system of claim 5 wherein said means for determining said retrieval hardship factor for each cache document further includes the attribute of interference with other network traffic involved in retrieving the document from a resource database.

### Claim 7 (depends on 1)

The Web system of claim 1 wherein said means for clearing selected stored individual documents includes:
means for establishing levels of recency of use; and
means for clearing all documents at each level of recency of use failing to have a retrieval hardship factor respectively selected for each of said levels of recency of use.

### Claim 8

In a Web communication network with user access via a plurality of data processor controlled interactive receiving display stations for displaying Web documents transmitted to said receiving display stations from resource locations remote from said stations, and a Web server system for accessing said Web documents from resource databases and transmitting said Web documents onto said Web, a method for temporarily caching a plurality of accessed Web documents comprising:
determining for each of said individual documents in said cache, a retrieval hardship factor; and
clearing selected stored individual documents from said cache based upon recency of use of said documents and said retrieval hardship factor.

### Claim 9 (depends on 8)

The method of claim 8 wherein said recency of use of said cached documents is based on most recently used (MRU) documents.

### Claim 10 (depends on 8)

The method of claim 8 wherein said recency of use of said cached documents is based on least recently used (LRU) documents.

### Claim 11 (depends on 8)

The method of claim 8 wherein the step of determining said retrieval hardship factor for each cache document uses the attribute of the total CPU time for retrieving the document from a resource database.

### Claim 12 (depends on 11)

The method of claim 11 wherein the step of determining said retrieval hardship factor for each cache document further uses the attribute of bandwidth use involved in retrieving the document from a resource database.

### Claim 13 (depends on 12)

The method of claim 12 wherein the step of determining said retrieval hardship factor for each cache document further uses the attribute of interference with other network traffic involved in retrieving the document from a resource database.

### Claim 14 (depends on 8)

The method of claim 8 wherein the step of clearing selected stored individual documents includes:
establishing levels of recency of use of documents; and
clearing all documents at each level of recency of use failing to have a retrieval hardship factor respectively selected for each of said levels of recency of use.

### Claim 15

A computer program having code recorded on a computer readable medium for accessing Web documents from resource databases and transmitting said Web documents onto the Web communication network with user access via a plurality of data processor controlled interactive receiving display stations for displaying Web documents transmitted to said receiving display stations from resource locations remote from said stations, and a Web server system for accessing said Web documents from said resource databases and transmitting said Web documents onto said Web, said program comprising:
a cache for temporarily storing a plurality of accessed Web documents;
means for determining for each of said individual documents in said cache, a retrieval hardship factor; and
means for clearing selected stored individual documents from said cache based upon recency of use of said documents and said retrieval hardship factor.

### Claim 16 (depends on 15)

The computer program of claim 15 wherein said recency of use of said cache documents is based on most recently used (MRU) documents.

### Claim 17 (depends on 15)

The computer program of claim 15 wherein said recency of use of said cache documents is based on least recently used (LRU) documents.

### Claim 18 (depends on 15)

The computer program of claim 15 further having means for determining said retrieval hardship factor for each cache document including the attribute of the total CPU time for retrieving the document from a resource database.

### Claim 19 (depends on 18)

The computer program of claim 18 wherein said means for determining said retrieval hardship factor for each cache document further includes the attribute of bandwidth use involved in retrieving the document from a resource database.

### Claim 20 (depends on 19)

The computer program of claim 19 wherein said means for determining said retrieval hardship factor for each cache document further includes the attribute of interference with other network traffic involved in retrieving the document from a resource database.

### Claim 21 (depends on 15)

The computer program of claim 15 wherein said means for clearing selected stored individual documents includes:
means for establishing levels of recency of use; and
means for clearing all documents at each level of recency of use failing to have a retrieval hardship factor respectively selected for each of said levels of recency of use.

### Claim 22

In a computer managed communication network with user access via a plurality of data processor controlled receiving stations for displaying network documents transmitted to said receiving display stations from resource locations remote from said stations, a network server system for accessing said network documents from resource databases and transmitting said documents onto said network comprising:
a cache for temporarily storing a plurality of accessed network documents;
means for determining for each of said individual documents in said cache, a retrieval hardship factor; and
means for clearing selected stored individual documents from said cache based upon recency of use of said documents and said retrieval hardship factor.

### Claim 23

In a computer managed communication network with user access via a plurality of data processor controlled interactive receiving display stations for displaying network documents transmitted to said receiving display stations from resource locations remote from said stations, and a network server system for accessing said network documents from resource databases and transmitting said documents onto said network, a method for temporarily caching a plurality of accessed network documents comprising:
determining for each of said individual documents in said cache, a retrieval hardship factor; and
clearing selected stored individual documents from said cache based upon recency of use of said documents and said retrieval hardship factor.

### Claim 24

A computer program having code recorded on a computer readable medium for accessing network documents from resource databases and transmitting said network documents onto a communication network with user access via a plurality of data processor controlled interactive receiving display stations for displaying network documents transmitted to said receiving display stations from resource locations remote from said stations, and a network server system for accessing said documents from said resource databases and transmitting said documents onto said communication network, said program comprising:
a cache for temporarily storing a plurality of accessed network documents;
means for determining for each of said individual documents in said cache, a retrieval hardship factor; and
means for clearing selected stored individual documents from said cache based upon recency of use of said documents and said retrieval hardship factor.
