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
La mise en cache Web distribuée permet à plusieurs clients d'accéder rapidement à un pool de pages Web populaires. Les schémas de mise en cache Web distribués classiques, par exemple le protocole de cache Internet et le routage de hachage, nécessitent l'envoi de nombreux messages de requête entre les serveurs de cache et/ou imposent une charge importante aux serveurs de cache lorsqu'ils sont largement dispersés. Pour surmonter ces problèmes, nous proposons une méthode de mise en cache des requêtes basée sur le hachage utilisant à la fois une fonction de hachage et une méthode de mise en cache des requêtes. Cette méthode peut trouver des objets mis en cache parmi plusieurs serveurs de cache en utilisant un seul message de requête, permettant ainsi la construction d'un serveur de cache Web distribué à grande échelle efficace. Par rapport aux méthodes conventionnelles, cette méthode réduit la surcharge du serveur de cache et la latence de récupération des objets.
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.
Copier
Takuya ASAKA, Hiroyoshi MIWA, Yoshiaki TANAKA, "Hash-Based Query Caching Method for Distributed Web Caching in Wide Area Networks" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 6, pp. 907-914, June 1999, doi: .
Abstract: Distributed Web caching allows multiple clients to quickly access a pool of popular Web pages. Conventional distributed Web caching schemes, e. g. , the Internet cache protocol and hash routing, require the sending of many query messages among cache servers and/or impose a large load on the cache servers when they are widely dispersed. To overcome these problems, we propose a hash-based query caching method using both a hash function and a query caching method. This method can find cached objects among several cache servers by using only one query message, enabling the construction of an efficient large-scale distributed Web cache server. Compared to conventional methods, this method reduces cache server overhead and object retrieval latency.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_6_907/_p
Copier
@ARTICLE{e82-b_6_907,
author={Takuya ASAKA, Hiroyoshi MIWA, Yoshiaki TANAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={Hash-Based Query Caching Method for Distributed Web Caching in Wide Area Networks},
year={1999},
volume={E82-B},
number={6},
pages={907-914},
abstract={Distributed Web caching allows multiple clients to quickly access a pool of popular Web pages. Conventional distributed Web caching schemes, e. g. , the Internet cache protocol and hash routing, require the sending of many query messages among cache servers and/or impose a large load on the cache servers when they are widely dispersed. To overcome these problems, we propose a hash-based query caching method using both a hash function and a query caching method. This method can find cached objects among several cache servers by using only one query message, enabling the construction of an efficient large-scale distributed Web cache server. Compared to conventional methods, this method reduces cache server overhead and object retrieval latency.},
keywords={},
doi={},
ISSN={},
month={June},}
Copier
TY - JOUR
TI - Hash-Based Query Caching Method for Distributed Web Caching in Wide Area Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 907
EP - 914
AU - Takuya ASAKA
AU - Hiroyoshi MIWA
AU - Yoshiaki TANAKA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 1999
AB - Distributed Web caching allows multiple clients to quickly access a pool of popular Web pages. Conventional distributed Web caching schemes, e. g. , the Internet cache protocol and hash routing, require the sending of many query messages among cache servers and/or impose a large load on the cache servers when they are widely dispersed. To overcome these problems, we propose a hash-based query caching method using both a hash function and a query caching method. This method can find cached objects among several cache servers by using only one query message, enabling the construction of an efficient large-scale distributed Web cache server. Compared to conventional methods, this method reduces cache server overhead and object retrieval latency.
ER -