Content peering in content centric networks

Jason Min Wang, Xiangming Dai, B. Bensaou
{"title":"Content peering in content centric networks","authors":"Jason Min Wang, Xiangming Dai, B. Bensaou","doi":"10.1109/LCN.2014.6925751","DOIUrl":null,"url":null,"abstract":"The settlement-free peering relationships play a vital role in today's Internet, notably in helping ISPs cope with the dramatic increase in traffic load caused by the recent surge in the demand for videos and user generated content. Because of the added caching capability of CCN, peering in CCN can be expanded to encompass not only content that is permanently stored in the ISP's network, but also content that is temporarily cached at CCN routers in the ISP's network. Intuitively, this content-level peering is likely to benefit the networks involved in the peering relationship; however, this comes at a non-trivial cost. In this paper, we try to answer the question of whether the additional overhead and complexity to extend content-level peering is justifiable in view of the benefits it brings. To this end, we formulate the content-level peering problem as an optimization problem to study its maximum potential benefit. We conduct extensive numerical experiments to evaluate the potential peering benefit under realistic AS-level peering graphs, using realistic video traffic. The experimental results show that the interconnectivity of the peering graph significantly affects the maximum benefit of content-level peering. Compared to local greedy caching, cooperative caching can bring higher peering benefits; yet it is sensitive to parameters like the peering link bandwidth and the AS-level cache size.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"198 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"39th Annual IEEE Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2014.6925751","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The settlement-free peering relationships play a vital role in today's Internet, notably in helping ISPs cope with the dramatic increase in traffic load caused by the recent surge in the demand for videos and user generated content. Because of the added caching capability of CCN, peering in CCN can be expanded to encompass not only content that is permanently stored in the ISP's network, but also content that is temporarily cached at CCN routers in the ISP's network. Intuitively, this content-level peering is likely to benefit the networks involved in the peering relationship; however, this comes at a non-trivial cost. In this paper, we try to answer the question of whether the additional overhead and complexity to extend content-level peering is justifiable in view of the benefits it brings. To this end, we formulate the content-level peering problem as an optimization problem to study its maximum potential benefit. We conduct extensive numerical experiments to evaluate the potential peering benefit under realistic AS-level peering graphs, using realistic video traffic. The experimental results show that the interconnectivity of the peering graph significantly affects the maximum benefit of content-level peering. Compared to local greedy caching, cooperative caching can bring higher peering benefits; yet it is sensitive to parameters like the peering link bandwidth and the AS-level cache size.
内容中心网络中的内容对等
无需结算的对等关系在今天的互联网中发挥着至关重要的作用,特别是在帮助互联网服务提供商应对最近视频和用户生成内容需求激增造成的流量负载急剧增加方面。由于CCN增加了缓存功能,因此CCN中的对等网络可以扩展为不仅包含永久存储在ISP网络中的内容,还包括临时缓存在ISP网络中的CCN路由器上的内容。直观地说,这种内容级对等可能有利于对等关系中涉及的网络;然而,这需要付出不小的代价。在本文中,我们试图回答这样一个问题,即考虑到它带来的好处,扩展内容级对等的额外开销和复杂性是否合理。为此,我们将内容级对等问题作为优化问题来研究其最大潜在效益。我们进行了大量的数值实验来评估在真实的as级对等图下潜在的对等效益,使用真实的视频流量。实验结果表明,对等图的互联性对内容级对等的最大效益有显著影响。与本地贪婪缓存相比,协同缓存可以带来更高的对等效益;但它对对等链路带宽和as级缓存大小等参数很敏感。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信