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
Como o tráfego do NetNews está aumentando, manter todos os artigos torna-se um problema sério do ponto de vista do desperdício de largura de banda da rede e da quantidade de uso do disco. Além disso, os usuários não leem todos os artigos recebidos. Propusemos vários algoritmos de cache para superar este problema e mostramos que um esquema de pré-busca seletiva oferece o melhor desempenho do sistema entre os propostos. No entanto, como o esquema de pré-busca seletiva empregou uma política de seleção simples, o esquema apresentou baixa taxa de acerto em alguns casos. Portanto, este artigo pretende melhorar o esquema de pré-busca seletiva do ponto de vista da quantidade de uso do disco, bem como da taxa de acertos. Neste artigo, dividimos o esquema em três fatores: intervalo de referência, critério e limite no critério. Através de experimentos de simulação usando logs reais do NetNews, investigamos a influência dos fatores do intervalo de referência e do limite no desempenho do sistema. Como resultado, é mostrado que o intervalo de referência é um fator mais significativo do que o limite, o esquema de pré-busca seletiva com um valor em torno do intervalo de referência de sete dias mantém uma alta taxa de acertos e reduz a quantidade de uso do disco.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -