Profit-Based Caching for Information-centric Network

Jie Duan, Xiong Wang, Sheng Wang, Shizhong Xu
{"title":"Profit-Based Caching for Information-centric Network","authors":"Jie Duan, Xiong Wang, Sheng Wang, Shizhong Xu","doi":"10.1109/DASC.2013.111","DOIUrl":null,"url":null,"abstract":"In-network caching as one of the primary components for ICN (information-centric network) has attracted more and more attentions. In this paper, we present a profit-based caching for ICN. The profit value for the content arriving on a router is determined by request popularity, distance to content source, content size and content duration, etc. The content duration is considered as an important factor in methodology to avoid the error caused by storing the overdue contents, which is the main difference from existing caching scheme. A 0-1 ILP (integer linear programming) is used to formulate whether to cache the coming content or not and eviction objects simultaneously. Also, a near-optimal heuristic algorithm is proposed to find profit-efficient cache decision, which can be quickly deployed. The analytical and simulation results show our profit-based caching scheme can attain a better network profit compare to Least Frequently used (LFU), and totally avoids caching withdrawing contents.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC.2013.111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In-network caching as one of the primary components for ICN (information-centric network) has attracted more and more attentions. In this paper, we present a profit-based caching for ICN. The profit value for the content arriving on a router is determined by request popularity, distance to content source, content size and content duration, etc. The content duration is considered as an important factor in methodology to avoid the error caused by storing the overdue contents, which is the main difference from existing caching scheme. A 0-1 ILP (integer linear programming) is used to formulate whether to cache the coming content or not and eviction objects simultaneously. Also, a near-optimal heuristic algorithm is proposed to find profit-efficient cache decision, which can be quickly deployed. The analytical and simulation results show our profit-based caching scheme can attain a better network profit compare to Least Frequently used (LFU), and totally avoids caching withdrawing contents.
基于利润的信息中心网络缓存
网内缓存作为信息中心网络(ICN)的主要组成部分之一,越来越受到人们的关注。在本文中,我们提出了一种基于利润的ICN缓存。到达路由器的内容的利润值由请求流行度、到内容源的距离、内容大小和内容持续时间等因素决定。该方法将内容持续时间作为一个重要因素来考虑,以避免由于存储过期内容而导致的错误,这是与现有缓存方案的主要区别。使用0-1整数线性规划(ILP)来确定是否缓存即将到来的内容并同时删除对象。同时,提出了一种接近最优的启发式算法来寻找利润有效的缓存决策,该算法可以快速部署。分析和仿真结果表明,与LFU相比,基于利润的缓存方案可以获得更好的网络利润,并且完全避免了对提取内容的缓存。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信