The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Memandangkan trafik NetNews semakin meningkat, menyimpan semua artikel menjadi masalah serius dari sudut pandangan pembaziran lebar jalur rangkaian dan jumlah penggunaan cakera. Di samping itu, pengguna tidak membaca semua artikel yang masuk. Kami telah mencadangkan beberapa algoritma caching untuk mengatasi masalah ini dan menunjukkan bahawa skim prefetch terpilih memberikan prestasi sistem terbaik antara yang dicadangkan. Walau bagaimanapun, memandangkan skim prefetch terpilih menggunakan dasar pemilihan yang mudah, skim tersebut memberikan nisbah hit rendah dalam beberapa kes. Oleh itu, kertas kerja ini berhasrat untuk menambah baik skim prafetch terpilih dari sudut pandangan jumlah penggunaan cakera serta nisbah hit. Dalam kertas ini, kami membahagikan skema kepada tiga faktor: rentang rujukan, kriteria, dan ambang dalam kriteria. Melalui eksperimen simulasi menggunakan log NetNews sebenar, kami menyiasat pengaruh faktor rentang rujukan dan ambang kepada prestasi sistem. Hasilnya, ditunjukkan bahawa rentang rujukan adalah faktor yang lebih penting daripada ambang, skim prafetch terpilih dengan nilai sekitar tempoh rujukan tujuh hari mengekalkan nisbah hit tinggi dan mengurangkan jumlah penggunaan cakera.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Junichi FUNASAKA, Keizo SAISHO, Akira FUKUDA, "Effective Caching for NetNews Servers" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 3, pp. 348-354, March 2001, doi: .
Abstract: Since the traffic of NetNews is increasing, keeping all articles becomes serious problem from a viewpoint of waste of network bandwidth and the amount of disk usage. In addition, users read not all incoming articles. 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 selecting policy, the scheme gave low hit ratio in some cases. Therefore, this paper intends to improve the selective prefetch scheme from a viewpoint of the amount of disk usage as well as hit ratio. In this paper, 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 more significant factor than the threshold, the selective prefetch scheme with a value around the seven days reference span keeps high hit ratio and reduces the amount of disk usage.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_3_348/_p
Salinan
@ARTICLE{e84-d_3_348,
author={Junichi FUNASAKA, Keizo SAISHO, Akira FUKUDA, },
journal={IEICE TRANSACTIONS on Information},
title={Effective Caching for NetNews Servers},
year={2001},
volume={E84-D},
number={3},
pages={348-354},
abstract={Since the traffic of NetNews is increasing, keeping all articles becomes serious problem from a viewpoint of waste of network bandwidth and the amount of disk usage. In addition, users read not all incoming articles. 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 selecting policy, the scheme gave low hit ratio in some cases. Therefore, this paper intends to improve the selective prefetch scheme from a viewpoint of the amount of disk usage as well as hit ratio. In this paper, 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 more significant factor than the threshold, the selective prefetch scheme with a value around the seven days reference span keeps high hit ratio and reduces the amount of disk usage.},
keywords={},
doi={},
ISSN={},
month={March},}
Salinan
TY - JOUR
TI - Effective Caching for NetNews Servers
T2 - IEICE TRANSACTIONS on Information
SP - 348
EP - 354
AU - Junichi FUNASAKA
AU - Keizo SAISHO
AU - Akira FUKUDA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2001
AB - Since the traffic of NetNews is increasing, keeping all articles becomes serious problem from a viewpoint of waste of network bandwidth and the amount of disk usage. In addition, users read not all incoming articles. 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 selecting policy, the scheme gave low hit ratio in some cases. Therefore, this paper intends to improve the selective prefetch scheme from a viewpoint of the amount of disk usage as well as hit ratio. In this paper, 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 more significant factor than the threshold, the selective prefetch scheme with a value around the seven days reference span keeps high hit ratio and reduces the amount of disk usage.
ER -