Automatic selecting of required NetNews articles

Since the traffic of NetNews is increasing, storage of all articles becomes a serious problem from the viewpoint of wasting network bandwidth and the amount of disk usage. In addition, not all incoming articles are read by users. We have proposed several caching algorithms to overcome this problem and shown that a selective prefetch scheme gives the best system performance among the proposed ones. However, since the selective prefetch scheme employed a simple prefetching policy, the scheme gave a low hit ratio in some cases. Therefore, the paper improves the selective prefetch scheme from the viewpoint of the amount of disk usage as well as hit ratio. We divide the scheme into three factors: reference span, criterion, and threshold in criterion. Through simulation experiments using actual NetNews logs, we investigate the influence of the factors of the reference span and the threshold to system performance. As a result, it is shown that the reference span is a more significant factor than the threshold and when the selective prefetch scheme has a value of around seven days, reference span keeps a high hit ratio and reduces the amount of disk usage.

[1]  James E. Pitkow,et al.  Yet Robust Caching Algorithm Based on Dynamic Access Patterns , 1994, WWW Spring 1994.

[2]  Michael J. Feeley,et al.  The Measured Access Characteristics of World-Wide-Web Client Proxy Caches , 1997, USENIX Symposium on Internet Technologies and Systems.

[3]  Igor Tatarinov,et al.  Static caching in Web servers , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[4]  Akira Fukuda,et al.  Evaluation of Caching Algorithm for NetNews , 1999, Applied Informatics.

[5]  Jon Crowcroft,et al.  Prefetching in World Wide Web , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[6]  Edward A. Fox,et al.  Removal Policies in Network Caches for World-Wide Web Documents , 1996, SIGCOMM.