Summary cache: A scalable wide-area Web cache sharing protocol

Summary cache: A scalable wide-area Web cache sharing protocol
复制标题

DOI:
10.1109/90.851975
复制
发表时间:
2000-06-01
影响因子:
3.7
通讯作者:
Broder, AZ
Broder, AZ
中科院分区:
计算机科学2区
文献类型:
--
作者:
Fan, L;Cao, P;Broder, AZ

文献摘要

被引文献

相似文献

在Web代理之间共享库是减少网络流量并减轻网络瓶颈的重要技术。然而,由于现有协议的开销,它并未被广泛部署。在本文中,我们证明了缓存共享的好处,测量现有协议的开销,并在此新协议中提出了一个称为“摘要缓存”的新协议,每个代理都会保留每个参与代理的Cache目录的摘要,并保留在发送任何查询之前,请先检查这些摘要是否有潜在的命中。有两个因素导致我们的协议低开销:摘要仅定期更新,目录表示非常经济,每条条目8位低至8位。使用跟踪驱动的模拟和原型实现,我们表明,与现有协议(例如Internet Cache协议(ICP))相比,摘要缓存将Intercache协议消息的数量减少了25到60倍,可通过减少带宽消耗量超过50%,消除了协议CPU开销的30%至95%,同时保持与TCP几乎相同的高速缓存命中率。因此,摘要缓存范围为大量代理。 (这是[18]的修订版,我们在此版本中添加了更多数据和分析。)。
The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it Is not widely deployed due to the overhead of existing protocols. In this paper we demonstrate the benefits of cache sharing, measure the overhead of the existing protocols, and propose a new protocol called "summary cache," In this new protocol, each proxy keeps a summary of the cache directory of each participating proxy, and checks these summaries for potential hits before sending any queries. Two factors contribute to our protocol's low overhead: the summaries are updated only periodically, and the directory representations are very economical, as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that, compared to existing protocols such as the internet cache protocol (ICP), summary cache reduces the number of intercache protocol messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, eliminates 30% to 95% of the protocol CPU overhead, all while maintaining almost the same cache hit ratio as TCP. Hence summary cache scales to a large number of proxies. (This is a revision of [18], We add more data and analysis in this version.).