Minimizing Bandwidth Cost of CCN: A Coordinated In-Network Caching Approach

Yuemei Xu, Zihou Wang, Yang Li, Tao Lin, W. An, S. Ci
{"title":"Minimizing Bandwidth Cost of CCN: A Coordinated In-Network Caching Approach","authors":"Yuemei Xu, Zihou Wang, Yang Li, Tao Lin, W. An, S. Ci","doi":"10.1109/ICCCN.2015.7288426","DOIUrl":null,"url":null,"abstract":"To reduce data access latency, network traffic volume and server load, in-network caching was proposed and has become an intrinsic component of the content-centric network (CCN) architecture. The content-oriented characteristics of in-network caching, such as arbitrary topology, volatile content locations and line speed requirements, make routers content-aware and supportive of fast content distribution. Meanwhile, they also raise new challenges in content placement and request routing, namely, how to optimally make content storage decisions and provision individual router's bandwidth to serve user requests, so as to minimize the bandwidth cost under storage and link capacity limit. To address this problem, we build a distributed in-network caching model to formulate the content placement and request routing in CCN, aiming at minimizing the bandwidth cost with strict storage and bandwidth constraints. Based on the proposed model, we design a scalable, adaptive and low-complexity in-network caching scheme for content placement and request routing and analyze the performance gains via simulations on a real ISP network topology and traffic traces. The experimental results show the proposed model and scheme are superior. Compared with the existing works, we also observe significant performance enhancements in terms of hit ratio of requests, reduction of server load, and bandwidth cost.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2015.7288426","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

To reduce data access latency, network traffic volume and server load, in-network caching was proposed and has become an intrinsic component of the content-centric network (CCN) architecture. The content-oriented characteristics of in-network caching, such as arbitrary topology, volatile content locations and line speed requirements, make routers content-aware and supportive of fast content distribution. Meanwhile, they also raise new challenges in content placement and request routing, namely, how to optimally make content storage decisions and provision individual router's bandwidth to serve user requests, so as to minimize the bandwidth cost under storage and link capacity limit. To address this problem, we build a distributed in-network caching model to formulate the content placement and request routing in CCN, aiming at minimizing the bandwidth cost with strict storage and bandwidth constraints. Based on the proposed model, we design a scalable, adaptive and low-complexity in-network caching scheme for content placement and request routing and analyze the performance gains via simulations on a real ISP network topology and traffic traces. The experimental results show the proposed model and scheme are superior. Compared with the existing works, we also observe significant performance enhancements in terms of hit ratio of requests, reduction of server load, and bandwidth cost.
最小化CCN的带宽成本:一种协调的网络内缓存方法
为了减少数据访问延迟、网络流量和服务器负载,提出了网络内缓存,并已成为内容中心网络(CCN)体系结构的固有组成部分。网络内缓存面向内容的特性,如任意拓扑、易变的内容位置和线路速度要求,使路由器能够感知内容并支持快速内容分发。同时,它们也对内容放置和请求路由提出了新的挑战,即如何最优地做出内容存储决策,并为用户请求提供单个路由器的带宽,从而在存储和链路容量限制下使带宽成本最小化。为了解决这个问题,我们建立了一个分布式网络缓存模型来制定CCN中的内容放置和请求路由,旨在在严格的存储和带宽约束下最小化带宽成本。基于所提出的模型,我们设计了一种可扩展、自适应和低复杂性的网络内缓存方案,用于内容放置和请求路由,并通过对真实ISP网络拓扑和流量轨迹的模拟分析了性能增益。实验结果表明,所提出的模型和方案具有较好的优越性。与现有的工作相比,我们还观察到在请求命中率、服务器负载减少和带宽成本方面的显著性能增强。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信