Effective caching for NetNews servers

Junishi Funasaka, Keizo Saisho, Akira Fukuda

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)348-354
Number of pages7
JournalIEICE Transactions on Information and Systems
VolumeE84-D
Issue number3
Publication statusPublished - Jan 1 2001
Externally publishedYes

Fingerprint

Servers
Bandwidth
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

Effective caching for NetNews servers. / Funasaka, Junishi; Saisho, Keizo; Fukuda, Akira.

In: IEICE Transactions on Information and Systems, Vol. E84-D, No. 3, 01.01.2001, p. 348-354.

Research output: Contribution to journalArticle

Funasaka, J, Saisho, K & Fukuda, A 2001, 'Effective caching for NetNews servers', IEICE Transactions on Information and Systems, vol. E84-D, no. 3, pp. 348-354.
Funasaka, Junishi ; Saisho, Keizo ; Fukuda, Akira. / Effective caching for NetNews servers. In: IEICE Transactions on Information and Systems. 2001 ; Vol. E84-D, No. 3. pp. 348-354.
@article{80967213a414425a825610d3e7740aaf,
title = "Effective caching for NetNews servers",
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.",
author = "Junishi Funasaka and Keizo Saisho and Akira Fukuda",
year = "2001",
month = "1",
day = "1",
language = "English",
volume = "E84-D",
pages = "348--354",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "3",

}

TY - JOUR

T1 - Effective caching for NetNews servers

AU - Funasaka, Junishi

AU - Saisho, Keizo

AU - Fukuda, Akira

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

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.

UR - http://www.scopus.com/inward/record.url?scp=0035282024&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035282024&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0035282024

VL - E84-D

SP - 348

EP - 354

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 3

ER -