Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories
Reexamination Certificate
2006-05-23
2006-05-23
Moazzami, Nasser (Department: 2187)
Electrical computers and digital processing systems: memory
Storage accessing and control
Hierarchical memories
C711S133000, C711S136000, C711S159000, C711S160000
Reexamination Certificate
active
07051161
ABSTRACT:
Admission of new objects into a memory such as a web cache is selectively controlled. If an object is not in the cache, but has been requested a specified number of prior occasions (e.g., if the object has been requested at least once before), it is admitted into the cache regardless of size. If the object has not previously been requested the specified number of times, the object is admitted into the cache if the object satisfies a specified size criterion (e.g., if it is smaller than the average size of objects currently stored in the cache). To make room for new objects, other objects are evicted from the cache on, e.g., a Least Recently Used (LRU) basis. The invention could be implemented on existing web caches, on distributed web caches, in client-side web caching, and in contexts unrelated to web object caching.
REFERENCES:
patent: 6012126 (2000-01-01), Aggarwal et al.
patent: 6266742 (2001-07-01), Challenger et al.
patent: 6272598 (2001-08-01), Arlitt et al.
patent: 6389460 (2002-05-01), Stewart et al.
patent: 6425057 (2002-07-01), Cherkasova et al.
patent: 6463508 (2002-10-01), Wolf et al.
patent: 6532492 (2003-03-01), Presler-Marshall
patent: 6760812 (2004-07-01), Degenaro et al.
patent: 6807607 (2004-10-01), Lamparter
patent: 6826599 (2004-11-01), Shaffer et al.
Krishnamrthy et a., Jun. 1999, IEEE.
Charu Aggarwal et al., “Caching on the World Wide Web,” IEEE Trans. On Knowledge and Data Eng., vol. 11, No. 1, pp. 94-107 (Jan./Feb. 1999).
Lee Bresiau et al., “web Caching and Zipf-like Distributions: Evidence and Implications,” IEEE Infocom, vol. XX, No. Y, pp. 1-9, (1999).
Pel Cao et al., “Cost-Aware WWW Proxy Caching Algorithms,” USENIX Symp. On Internet Tech. And Sys, Monterey, CA pp. 1-14 (Dec. 1997).
Shudong Jin et al., “GreedyDual” Web Caching Algorithm, Proceedings of the 5thInternational Web Caching And Content Delivery Workshop, Lisbon, Portugal, pp. 1-10 (May 2000).
Theodore Johnson et al., “2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm, ” Proc. Of 20thVL/DB Conference, Santiago, Chile, pp. 439-450 (1994).
Elizabeth J. O'Neil et al., “The LRU-K Page Replacement Algorithm for Database Disk Buffering,” Proceedings of ACM SIGMOD '93, Washington, D.C. (May 1993) pp. 1-19.
Luigi Rizzo et al., “Replacement policies for a proxy cache,” UCL-CS Research Note RN/98/13, University College, London (1998) pp. 1-22.
“ISP Caching Deployment Guide” CacheFlow Inc. Version 1.0, pp. 1-12, (Jul. 1998).
“Estimated $4.35 Billion in Ecommerce sales at Risk Each Year” (Jun. 30, 1999) obtained from http://www.intelliquest.com/press/archive/release85.asp.
A. Silberschatz and P.B. Galvin,Operating Systems Concepts, Fifth Edition. (Addison-Wesley, 1998), pp. 302-313.
Dixit Sudhir
Wu Tau
Banner & Witcoff , Ltd.
Moazzami Nasser
Nokia Corporation
LandOfFree
Memory admission control based on object size or request... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Memory admission control based on object size or request..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory admission control based on object size or request... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3585297