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
Hash routing ialah algoritma untuk sistem caching WWW yang diedarkan yang mencapai kadar hit yang tinggi dengan menghalang pertindihan objek antara cache. Walau bagaimanapun, salah satu kelemahan penghalaan cincang ialah kekurangan keteguhan terhadap kegagalan. Oleh kerana WWW menjadi perkhidmatan penting di Internet, keupayaan toleransi kesalahan sistem yang menyediakan perkhidmatan WWW menjadi penting. Dalam kertas kerja ini, kami mencadangkan a penghalaan cincang pendua algoritma, lanjutan daripada penghalaan hash. Algoritma kami memperkenalkan lebihan minimum untuk mengekalkan prestasi sistem apabila beberapa nod caching ranap. Di samping itu, kami secara pilihan membenarkan setiap nod untuk cache objek yang diminta oleh pelanggan setempatnya (caching tempatan), yang mungkin membazirkan kapasiti cache sistem tetapi ia boleh mengurangkan trafik rangkaian antara nod caching. Kami menilai pelbagai aspek prestasi sistem seperti kadar hit, kadar ralat dan trafik rangkaian melalui simulasi dan membandingkannya dengan algoritma lain. Keputusan menunjukkan bahawa algoritma kami mencapai toleransi kesalahan tinggi dan prestasi tinggi dengan overhed sistem yang rendah.
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
Eiji KAWAI, Kadohito OSUGA, Ken-ichi CHINEN, Suguru YAMAGUCHI, "Duplicated Hash Routing: A Robust Algorithm for a Distributed WWW Cache System" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 5, pp. 1039-1047, May 2000, doi: .
Abstract: Hash routing is an algorithm for a distributed WWW caching system that achieves a high hit rate by preventing overlaps of objects between caches. However, one of the drawbacks of hash routing is its lack of robustness against failure. Because WWW becomes a vital service on the Internet, the capabilities of fault tolerance of systems that provide the WWW service come to be important. In this paper, we propose a duplicated hash routing algorithm, an extension of hash routing. Our algorithm introduces minimum redundancy to keep system performance when some caching nodes are crashed. In addition, we optionally allow each node to cache objects requested by its local clients (local caching), which may waste cache capacity of the system but it can cut down the network traffic between caching nodes. We evaluate various aspects of the system performance such as hit rates, error rates and network traffic by simulations and compare them with those of other algorithms. The results show that our algorithm achieves both high fault tolerance and high performance with low system overhead.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_5_1039/_p
Salinan
@ARTICLE{e83-d_5_1039,
author={Eiji KAWAI, Kadohito OSUGA, Ken-ichi CHINEN, Suguru YAMAGUCHI, },
journal={IEICE TRANSACTIONS on Information},
title={Duplicated Hash Routing: A Robust Algorithm for a Distributed WWW Cache System},
year={2000},
volume={E83-D},
number={5},
pages={1039-1047},
abstract={Hash routing is an algorithm for a distributed WWW caching system that achieves a high hit rate by preventing overlaps of objects between caches. However, one of the drawbacks of hash routing is its lack of robustness against failure. Because WWW becomes a vital service on the Internet, the capabilities of fault tolerance of systems that provide the WWW service come to be important. In this paper, we propose a duplicated hash routing algorithm, an extension of hash routing. Our algorithm introduces minimum redundancy to keep system performance when some caching nodes are crashed. In addition, we optionally allow each node to cache objects requested by its local clients (local caching), which may waste cache capacity of the system but it can cut down the network traffic between caching nodes. We evaluate various aspects of the system performance such as hit rates, error rates and network traffic by simulations and compare them with those of other algorithms. The results show that our algorithm achieves both high fault tolerance and high performance with low system overhead.},
keywords={},
doi={},
ISSN={},
month={May},}
Salinan
TY - JOUR
TI - Duplicated Hash Routing: A Robust Algorithm for a Distributed WWW Cache System
T2 - IEICE TRANSACTIONS on Information
SP - 1039
EP - 1047
AU - Eiji KAWAI
AU - Kadohito OSUGA
AU - Ken-ichi CHINEN
AU - Suguru YAMAGUCHI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2000
AB - Hash routing is an algorithm for a distributed WWW caching system that achieves a high hit rate by preventing overlaps of objects between caches. However, one of the drawbacks of hash routing is its lack of robustness against failure. Because WWW becomes a vital service on the Internet, the capabilities of fault tolerance of systems that provide the WWW service come to be important. In this paper, we propose a duplicated hash routing algorithm, an extension of hash routing. Our algorithm introduces minimum redundancy to keep system performance when some caching nodes are crashed. In addition, we optionally allow each node to cache objects requested by its local clients (local caching), which may waste cache capacity of the system but it can cut down the network traffic between caching nodes. We evaluate various aspects of the system performance such as hit rates, error rates and network traffic by simulations and compare them with those of other algorithms. The results show that our algorithm achieves both high fault tolerance and high performance with low system overhead.
ER -