Evaluation of Cache for Bandwidth Optimization in ICN Through Software-Defined Networks

E. B. Nascimento, D. D. J. D. Macedo, E. Moreno, L. C. E. Bona, Miriam A. M. Capretz
{"title":"Evaluation of Cache for Bandwidth Optimization in ICN Through Software-Defined Networks","authors":"E. B. Nascimento, D. D. J. D. Macedo, E. Moreno, L. C. E. Bona, Miriam A. M. Capretz","doi":"10.1109/ISCC.2018.8538498","DOIUrl":null,"url":null,"abstract":"Traffic reduction in network segments through cache implementations has become a major research topic due to the exponential increase in data requests through the network. Even with high-speed connections, the conventional model still depends on point-to-point communication between two systems. Throughout the world, more connected devices are, accessing services and obtaining information. To support this activity, servers must have massive storage to support creation, retrieval, updated and deletion of large amounts of data. Therefore, in studies of Information Centric Networks (ICN), this model has been widely discussed as the new content distribution model for the Internet. To provide improved network management many approaches are using software-defined networks (SDN) to develop flexible content-based networks. This paper proposes to use cache replication for ICN through SDN to avoid duplicated requests in the same connection. The redundant cache reduced the bandwidth consumed by duplicated requests, from a maximum of 3.20 Gbps to 2.07 Gbps, reducing the bandwidth consumption by 11.3%.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Symposium on Computers and Communications (ISCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2018.8538498","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Traffic reduction in network segments through cache implementations has become a major research topic due to the exponential increase in data requests through the network. Even with high-speed connections, the conventional model still depends on point-to-point communication between two systems. Throughout the world, more connected devices are, accessing services and obtaining information. To support this activity, servers must have massive storage to support creation, retrieval, updated and deletion of large amounts of data. Therefore, in studies of Information Centric Networks (ICN), this model has been widely discussed as the new content distribution model for the Internet. To provide improved network management many approaches are using software-defined networks (SDN) to develop flexible content-based networks. This paper proposes to use cache replication for ICN through SDN to avoid duplicated requests in the same connection. The redundant cache reduced the bandwidth consumed by duplicated requests, from a maximum of 3.20 Gbps to 2.07 Gbps, reducing the bandwidth consumption by 11.3%.
基于软件定义网络的ICN带宽优化缓存评价
由于通过网络的数据请求呈指数级增长,通过实现缓存来减少网段的流量已成为一个主要的研究课题。即使有高速连接,传统模式仍然依赖于两个系统之间的点对点通信。在全球范围内,越来越多的连接设备正在访问服务和获取信息。为了支持这种活动,服务器必须有大量的存储来支持大量数据的创建、检索、更新和删除。因此,在信息中心网络(Information Centric Networks, ICN)的研究中,该模型作为新的互联网内容分发模型得到了广泛的讨论。为了提供更好的网络管理,许多方法正在使用软件定义网络(SDN)来开发灵活的基于内容的网络。本文提出通过SDN对ICN使用缓存复制,以避免同一连接中的重复请求。冗余缓存将重复请求占用的带宽从最大3.20 Gbps降低到2.07 Gbps,降低了11.3%的带宽消耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信