With the increasing popularity of the world wide web, it is desirable to store copies of popular documents in client, proxy or server caches and thus reduce the delay times for URL requests. In this paper we study the caching problem for web documents. Specifically, we propose a pyramidal selection scheme which maintains multiple stacks based on document sizes in order to perform efficient cache replacement. In addition we discuss the concept of ``admission control'', which decides whether an object should or should not be cached in the first place. We analyze the performance of our schemes and others by means of event and trace driven simulation. We shall see that the result is an efficient general purpose scheme, whose performance is relatively insensitive to the nature of the work loads.
By: Charu C. Aggarwal, Joel Wolf, Philip Yu, Marina Epelman (MIT)
Published in: RC20619 in 1996
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .