Analysis of the LRU Cache StartUp Phase and Convergence Time and Error Bounds on Approximations by Fagin and Che

G. Haßlinger, K. Ntougias, Frank Hasslinger, O. Hohlfeld
{"title":"Analysis of the LRU Cache StartUp Phase and Convergence Time and Error Bounds on Approximations by Fagin and Che","authors":"G. Haßlinger, K. Ntougias, Frank Hasslinger, O. Hohlfeld","doi":"10.23919/WiOpt56218.2022.9930556","DOIUrl":null,"url":null,"abstract":"We compare exact and approximate performance evaluation methods of the Least Recently Used (LRU) caching strategy, which is widely applied in local caches and in distributed web cache architectures in core and edge networks. Based on the independent reference model (IRM), the LRU startup behaviour and convergence time (CT) is derived. The result is related to hit ratio approximations by Fagin and Che et al. We evaluate the precision of the approximations by identifying maximum errors, which are shown to decrease with the cache size. For different object sizes, we extend the analytical LRU hit ratio formula, which is tractable for small caches. The Che and CT approximations are subject to larger deviations for high variability of the object sizes and small caches due to partially unused cache space. We propose an estimation scheme for the fraction of unused LRU cache space, which is shown to improve the accuracy.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WiOpt56218.2022.9930556","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We compare exact and approximate performance evaluation methods of the Least Recently Used (LRU) caching strategy, which is widely applied in local caches and in distributed web cache architectures in core and edge networks. Based on the independent reference model (IRM), the LRU startup behaviour and convergence time (CT) is derived. The result is related to hit ratio approximations by Fagin and Che et al. We evaluate the precision of the approximations by identifying maximum errors, which are shown to decrease with the cache size. For different object sizes, we extend the analytical LRU hit ratio formula, which is tractable for small caches. The Che and CT approximations are subject to larger deviations for high variability of the object sizes and small caches due to partially unused cache space. We propose an estimation scheme for the fraction of unused LRU cache space, which is shown to improve the accuracy.
LRU缓存启动阶段和收敛时间的分析以及Fagin和Che逼近的误差界
LRU (Least Recently Used)缓存策略广泛应用于核心网络和边缘网络的本地缓存和分布式web缓存架构中,我们比较了LRU缓存策略的精确和近似性能评估方法。基于独立参考模型(IRM),推导了LRU的启动行为和收敛时间(CT)。结果与Fagin和Che等人的命中率近似有关。我们通过识别最大误差来评估近似的精度,最大误差随着缓存大小的增加而减小。对于不同的对象大小,我们扩展了解析LRU命中率公式,该公式适用于小缓存。由于对象大小的高度可变性和由于部分未使用的缓存空间而导致的小缓存,Che和CT近似值受到较大偏差的影响。我们提出了一种LRU未使用缓存空间比例的估计方案,该方案被证明可以提高准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信