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
O cache distribuído da Web permite que vários clientes acessem rapidamente um conjunto de páginas da Web populares. Esquemas convencionais de cache distribuído da Web, por exemplo, o protocolo de cache da Internet e o roteamento de hash, exigem o envio de muitas mensagens de consulta entre servidores de cache e/ou impõem uma grande carga nos servidores de cache quando eles estão amplamente dispersos. Para superar esses problemas, propomos um método de cache de consulta baseado em hash usando uma função hash e um método de cache de consulta. Este método pode encontrar objetos armazenados em cache entre vários servidores de cache usando apenas uma mensagem de consulta, permitindo a construção de um servidor de cache Web distribuído eficiente e em larga escala. Comparado aos métodos convencionais, esse método reduz a sobrecarga do servidor de cache e a latência de recuperação de objetos.
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
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
Copiar
@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},}
Copiar
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 -