Impact of One-Timer/N-Timer Object Classification on the Performance of Web Cache Replacement Algorithms

Saloua Messaoud Abid, H. Youssef
{"title":"Impact of One-Timer/N-Timer Object Classification on the Performance of Web Cache Replacement Algorithms","authors":"Saloua Messaoud Abid, H. Youssef","doi":"10.1109/WI-IAT.2010.124","DOIUrl":null,"url":null,"abstract":"Web cache replacement Algorithms proposed in the literature try to maximize the Hit Ratio (HR), the Byte Hit Ratio (BHR), and the Delay Saving Ratio (DSR). However, even with an infinite Web cache storage capacity, values of these metrics could not exceed 70% most of the time. This is due to the fact that, given a workload, the first reference to an object is always a miss. Moreover, a statistical analysis of the workload shows that as much as 76% of objects are One-Timers (OT), i.e. they are referenced only once. Caching OT objects usually degrade the performance of all Web cache replacement algorithms. In fact, it may cause the eviction of N-Timer (NT) objects and hence increases the number of misses. In this paper, we present a technique to classify whether a cached object is an OT or not. We show through simulation that classification may significantly enhance the performance of replacement algorithms with respect to the HR, the BHR and the DSR.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IAT.2010.124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Web cache replacement Algorithms proposed in the literature try to maximize the Hit Ratio (HR), the Byte Hit Ratio (BHR), and the Delay Saving Ratio (DSR). However, even with an infinite Web cache storage capacity, values of these metrics could not exceed 70% most of the time. This is due to the fact that, given a workload, the first reference to an object is always a miss. Moreover, a statistical analysis of the workload shows that as much as 76% of objects are One-Timers (OT), i.e. they are referenced only once. Caching OT objects usually degrade the performance of all Web cache replacement algorithms. In fact, it may cause the eviction of N-Timer (NT) objects and hence increases the number of misses. In this paper, we present a technique to classify whether a cached object is an OT or not. We show through simulation that classification may significantly enhance the performance of replacement algorithms with respect to the HR, the BHR and the DSR.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
单定时器/ n定时器对象分类对Web缓存替换算法性能的影响
文献中提出的Web缓存替换算法试图最大化命中率(HR)、字节命中率(BHR)和延迟节省率(DSR)。但是,即使使用无限的Web缓存存储容量,这些指标的值在大多数情况下也不能超过70%。这是因为,给定一个工作负载,对对象的第一次引用总是会错过。此外,对工作负载的统计分析表明,多达76%的对象是一次性(One-Timers, OT)的,即它们只被引用一次。缓存OT对象通常会降低所有Web缓存替换算法的性能。实际上,它可能会导致N-Timer (NT)对象的清除,从而增加失败的次数。本文提出了一种对缓存对象是否为OT进行分类的技术。我们通过仿真表明,分类可以显著提高替换算法在HR、BHR和DSR方面的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Game Theory for Security: Lessons Learned from Deployed Applications A Decision Rule Method for Assessing the Completeness and Consistency of a Data Warehouse Semantic Structure Content for Dynamic Web Pages Enhancing the Performance of Metadata Service for Cloud Computing Improving Diversity of Focused Summaries through the Negative Endorsements of Redundant Facts
×
引用
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