信息中心网络中基于链路拥塞和生存期的网络内缓存方案

Jiahui Kong, Lanlan Rui, Haoqiu Huang, Xiaomei Wang
{"title":"信息中心网络中基于链路拥塞和生存期的网络内缓存方案","authors":"Jiahui Kong, Lanlan Rui, Haoqiu Huang, Xiaomei Wang","doi":"10.1109/CITS.2017.8035289","DOIUrl":null,"url":null,"abstract":"Ubiquitous in-network caching is one of the important aspects of the Information-Centric Networking (ICN), which has been a hot topic of ICN research. Many works have tried to propose better caching schemes to solve the drawbacks of the default en-route scheme, but most of them are insufficient to improve performance of entire network for just considering single layer optimization factor. Also considering that the network exists to serve its users, user-centric performance metrics, in particular the download delay, are equally important as the common metrics such as cache hit rate in performance evaluation. And approaches designed with congestion-sensitive download delay in mind can obtain better performance and user experience. In this paper, we propose and evaluate a novel Link Congestion and lifetime Based In-Networking Caching Schemes (LCLCS), which takes fully account of link congestion, Betweenness centrality and content popularity, aiming to observably optimize network delay and maintain acceptable cache rate. Through simulation, we can prove that network latency and hop reduction rate of our policy are significantly better than existing policies at least 51.5%, while the cache hit ratio is relatively improved by at least 19.1% under network congestion.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Link congestion and lifetime based in-network caching scheme in Information Centric Networking\",\"authors\":\"Jiahui Kong, Lanlan Rui, Haoqiu Huang, Xiaomei Wang\",\"doi\":\"10.1109/CITS.2017.8035289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ubiquitous in-network caching is one of the important aspects of the Information-Centric Networking (ICN), which has been a hot topic of ICN research. Many works have tried to propose better caching schemes to solve the drawbacks of the default en-route scheme, but most of them are insufficient to improve performance of entire network for just considering single layer optimization factor. Also considering that the network exists to serve its users, user-centric performance metrics, in particular the download delay, are equally important as the common metrics such as cache hit rate in performance evaluation. And approaches designed with congestion-sensitive download delay in mind can obtain better performance and user experience. In this paper, we propose and evaluate a novel Link Congestion and lifetime Based In-Networking Caching Schemes (LCLCS), which takes fully account of link congestion, Betweenness centrality and content popularity, aiming to observably optimize network delay and maintain acceptable cache rate. Through simulation, we can prove that network latency and hop reduction rate of our policy are significantly better than existing policies at least 51.5%, while the cache hit ratio is relatively improved by at least 19.1% under network congestion.\",\"PeriodicalId\":314150,\"journal\":{\"name\":\"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)\",\"volume\":\"123 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CITS.2017.8035289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CITS.2017.8035289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

无处不在的网络缓存是信息中心网络(ICN)的一个重要方面,一直是信息中心网络研究的热点。许多研究都试图提出更好的缓存方案来解决默认路由方案的缺点,但大多只考虑单层优化因素,不足以提高整个网络的性能。此外,考虑到网络的存在是为了服务用户,以用户为中心的性能指标,特别是下载延迟,在性能评估中与缓存命中率等常见指标同等重要。考虑到对拥塞敏感的下载延迟设计的方法可以获得更好的性能和用户体验。在本文中,我们提出并评估了一种新的基于链路拥塞和生命周期的网络缓存方案(LCLCS),该方案充分考虑了链路拥塞、中间性中心性和内容流行度,旨在显著优化网络延迟并保持可接受的缓存率。通过仿真,我们可以证明我们的策略的网络延迟和跳数减少率明显优于现有策略至少51.5%,而在网络拥塞情况下,缓存命中率相对提高至少19.1%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Link congestion and lifetime based in-network caching scheme in Information Centric Networking
Ubiquitous in-network caching is one of the important aspects of the Information-Centric Networking (ICN), which has been a hot topic of ICN research. Many works have tried to propose better caching schemes to solve the drawbacks of the default en-route scheme, but most of them are insufficient to improve performance of entire network for just considering single layer optimization factor. Also considering that the network exists to serve its users, user-centric performance metrics, in particular the download delay, are equally important as the common metrics such as cache hit rate in performance evaluation. And approaches designed with congestion-sensitive download delay in mind can obtain better performance and user experience. In this paper, we propose and evaluate a novel Link Congestion and lifetime Based In-Networking Caching Schemes (LCLCS), which takes fully account of link congestion, Betweenness centrality and content popularity, aiming to observably optimize network delay and maintain acceptable cache rate. Through simulation, we can prove that network latency and hop reduction rate of our policy are significantly better than existing policies at least 51.5%, while the cache hit ratio is relatively improved by at least 19.1% under network congestion.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信