以信息为中心的网络缓存管理

Jie Duan, Xiong Wang, Sheng Wang, Shizhong Xu
{"title":"以信息为中心的网络缓存管理","authors":"Jie Duan, Xiong Wang, Sheng Wang, Shizhong Xu","doi":"10.1109/CSE.2014.353","DOIUrl":null,"url":null,"abstract":"In-network caching as a fundamental characteristic of ICN has been paid more attentions. How to cache is an important problem should to be answered by ICN designers and ISPs. Our argument is how to program a better cache placement within a funds limit. That is, an Internet Service Provider (ISP) wants to invest on deploying some cache equipment on the ICN router to improve the network performance. A mathematical model is built to describe the following problems simultaneously: cache type, cache location and cache capacity. And then a heuristic algorithm is presented: an Integer Linear Programming (ILP) is used for helping to achieve initial solution, while inter-layer iterative adjustment algorithm is proposed to meet the funds constraint and reduce latency. Simulation results shows that our algorithm can improve the network performance effectively, which is practical for ISP.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Cache Management for Information-centric Networking\",\"authors\":\"Jie Duan, Xiong Wang, Sheng Wang, Shizhong Xu\",\"doi\":\"10.1109/CSE.2014.353\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In-network caching as a fundamental characteristic of ICN has been paid more attentions. How to cache is an important problem should to be answered by ICN designers and ISPs. Our argument is how to program a better cache placement within a funds limit. That is, an Internet Service Provider (ISP) wants to invest on deploying some cache equipment on the ICN router to improve the network performance. A mathematical model is built to describe the following problems simultaneously: cache type, cache location and cache capacity. And then a heuristic algorithm is presented: an Integer Linear Programming (ILP) is used for helping to achieve initial solution, while inter-layer iterative adjustment algorithm is proposed to meet the funds constraint and reduce latency. Simulation results shows that our algorithm can improve the network performance effectively, which is practical for ISP.\",\"PeriodicalId\":258990,\"journal\":{\"name\":\"2014 IEEE 17th International Conference on Computational Science and Engineering\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 17th International Conference on Computational Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSE.2014.353\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 17th International Conference on Computational Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSE.2014.353","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

网络内缓存作为ICN的一个基本特性,越来越受到人们的关注。如何缓存是ICN设计者和网络服务提供商应该回答的一个重要问题。我们的论点是如何在资金限制内编程更好的缓存放置。也就是说,互联网服务提供商(ISP)希望在ICN路由器上投资部署一些缓存设备,以提高网络性能。建立了一个数学模型来同时描述缓存类型、缓存位置和缓存容量等问题。然后提出了一种启发式算法:利用整数线性规划(ILP)帮助实现初始解,同时提出了层间迭代调整算法来满足资金约束和减少延迟。仿真结果表明,该算法能有效提高网络性能,对ISP具有实用价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cache Management for Information-centric Networking
In-network caching as a fundamental characteristic of ICN has been paid more attentions. How to cache is an important problem should to be answered by ICN designers and ISPs. Our argument is how to program a better cache placement within a funds limit. That is, an Internet Service Provider (ISP) wants to invest on deploying some cache equipment on the ICN router to improve the network performance. A mathematical model is built to describe the following problems simultaneously: cache type, cache location and cache capacity. And then a heuristic algorithm is presented: an Integer Linear Programming (ILP) is used for helping to achieve initial solution, while inter-layer iterative adjustment algorithm is proposed to meet the funds constraint and reduce latency. Simulation results shows that our algorithm can improve the network performance effectively, which is practical for ISP.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信