A new document placement scheme for cooperative caching on the Internet

Lakshmish Ramaswamy, Ling Liu
{"title":"A new document placement scheme for cooperative caching on the Internet","authors":"Lakshmish Ramaswamy, Ling Liu","doi":"10.1109/ICDCS.2002.1022246","DOIUrl":null,"url":null,"abstract":"Most existing work on cooperative caching has been-focused on serving misses collaboratively. Very few have studied the effect of cooperation on document placement schemes and its potential enhancements on cache hit ratio and latency reduction. In this paper we propose a new document placement scheme, called the Expiration Age based scheme (EA scheme), which takes into account the contentions at individual caches in order to limit the replication of documents within a cache group and increase document hit ratio. The main idea of this new scheme is to view the aggregate disk space of the cache group as a global resource of the group, and uses the concept of cache expiration age to measure the contention of individual caches. The decision of whether to cache a document at a proxy is made collectively, among the caches that already have a copy of this document. The experiments show that the EA scheme yields higher hit rates and better response times compared to the existing document placement schemes used in most of the caching proxies.","PeriodicalId":186210,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 22nd International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2002.1022246","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Most existing work on cooperative caching has been-focused on serving misses collaboratively. Very few have studied the effect of cooperation on document placement schemes and its potential enhancements on cache hit ratio and latency reduction. In this paper we propose a new document placement scheme, called the Expiration Age based scheme (EA scheme), which takes into account the contentions at individual caches in order to limit the replication of documents within a cache group and increase document hit ratio. The main idea of this new scheme is to view the aggregate disk space of the cache group as a global resource of the group, and uses the concept of cache expiration age to measure the contention of individual caches. The decision of whether to cache a document at a proxy is made collectively, among the caches that already have a copy of this document. The experiments show that the EA scheme yields higher hit rates and better response times compared to the existing document placement schemes used in most of the caching proxies.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Internet上协作缓存的一种新的文档放置方案
大多数关于协作缓存的现有工作都集中在协作服务缺失上。很少有人研究协作对文档放置方案的影响及其对缓存命中率和延迟减少的潜在增强。在本文中,我们提出了一种新的文档放置方案,称为基于过期时间的方案(EA方案),该方案考虑了各个缓存中的争用,以限制缓存组内文档的复制并提高文档命中率。该方案的主要思想是将缓存组的总磁盘空间视为组的全局资源,并使用缓存过期时间的概念来度量各个缓存的争用情况。是否在代理上缓存文档的决定是在已经拥有此文档副本的缓存中共同做出的。实验表明,与大多数缓存代理中使用的现有文档放置方案相比,EA方案产生了更高的命中率和更好的响应时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Cooperative computing for distributed embedded systems A self-stabilizing protocol for pipelined PIF in tree networks A pluggable service-to-service communication mechanism for VNA architecture Dynamic replica control based on fairly assigned variation of data with weak consistency for loosely coupled distributed systems Migratory TCP: connection migration for service continuity in the Internet
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1