Network status aware routing in content-centric network

Yue-ping CAI; Jun LIU

doi:10.11959/j.issn.1000-436x.2016114

您当前的位置：

首页 >

文章列表页 >

Network status aware routing in content-centric network

Papers | 更新时间：2024-06-05

- Network status aware routing in content-centric network
- Journal on Communications Vol. 37, Issue 6, Pages: 38-48(2016)
- 作者机构：
  
  重庆大学通信工程学院，重庆 400030
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61301119);Joint Research Fund of Ministry of Education and China Mobile(MCM20150102);Research Fund of Young Scholars for the Doctoral Program of Higher Education of Ministry of Education(20120191120025);Scientific Research Foundation for the Returned Overseas Chinese Scholars of Ministry of Education(1020607820140002)
- DOI：10.11959/j.issn.1000-436x.2016114
  CLC： TP393
- Online First：2016-06，
  
  Published：25 June 2016
- 稿件说明：
移动端阅览
Yue-ping CAI, Jun LIU. Network status aware routing in content-centric network[J]. Journal on Communications, 2016, 37(6): 38-48.
DOI：

Yue-ping CAI, Jun LIU. Network status aware routing in content-centric network[J]. Journal on Communications, 2016, 37(6): 38-48. DOI： 10.11959/j.issn.1000-436x.2016114.

摘要

为了提高内容中心网络的内容分发效率及降低网络开销，提出了网络状态感知的路由机制NSAR(network status aware routing)。NSAR利用从内容服务节点返回的数据分组收集当前网络状态信息，并在回传过程中对路径上各节点上匹配端口的转发概率进行更新，在对后续的兴趣分组进行转发决策时引入转发概率，从而提高内容分发效率。仿真实验表明，与传统内容中心网络路由算法相比，NSAR可以有效地降低内容请求平均时延，减少网络流通分组数以及降低网络带宽开销。

Abstract

To improve the efficiency of content delivery and to reduce the network overhead of content centric network (CCN)

a network status aware routing(NSAR)mechanism was proposed.NSAR utilized data packets from the content server nodes to collect network statuses.The forwarding probability of the matching ports of the nodes on the path would be updated according to the network statuses.The subsequent interest packet forwarding would be based on the updated forwarding probability.Therefore the content delivery efficiency would be improved.Simulation results show that NSAR can effectively reduce the average delay of content requests and the number of packets in network as well as the network bandwidth overhead compared with the traditional routing algorithm in CCN.

关键词

Keywords

references

Cisco . Visual networking index:forecast and methodology,20102015,white paper [EB/OL ] . http://www.cisco.com/go/vni http://www.cisco.com/go/vni .

Google . We knew the Web was big [EB/OL ] . http://googleblog.blogspot.com/2008/07/we-knew-web-was-big.html http://googleblog.blogspot.com/2008/07/we-knew-web-was-big.html .

KOPONEN T , CHAWLA M , CHUN B , et al . A data-oriented (and beyond)network architecture [C ] // ACM SIGCOMM . 2007 : 181 - 192 .

FP7 PURSUIT project [EB/OL ] . http://www.fp7-pursuit.eu/PursuitWeb/ http://www.fp7-pursuit.eu/PursuitWeb/ .

FP7 PSIRP project [EB/OL ] . http://www.psirp.org/ http://www.psirp.org/ .

FP7 SAIL project [EB/OL ] . http://www.sail-project.eu/ http://www.sail-project.eu/ .

FP7 4WARD project [EB/OL ] . http://www.4ward-project.eu/ http://www.4ward-project.eu/ .

FP7 COMET project [EB/OL ] . http://www.comet-project.org/ http://www.comet-project.org/ .

FP7 CONVERGENCE project [EB/OL ] . http://www.ictconvergence.eu/ http://www.ictconvergence.eu/ .

NSF named data networking project [EB/OL ] . http://www.nameddata.net/ http://www.nameddata.net/ .

Content centric networking project [EB/OL ] . http://www.ccnx.org/ http://www.ccnx.org/ .

NSF mobility first project [EB/OL ] . http://mobilityfirst.winlab.rutgers.edu/ http://mobilityfirst.winlab.rutgers.edu/ .

PARC [EB /OL ] . https://en.wikipedia.org/wiki/PARC https://en.wikipedia.org/wiki/PARC .

ZHANG L , ESTRIN D , BURKE J , et al . Named data networking project [R ] . Tech.Report ndn-0001,PARC , 2010 .

EUM S , NAKAUCHI K , MURATA M , et al . CATT:potential based routing with content caching for ICN [C ] // ACM SIGCOMM Workshop on Information-Centric Networking . 2012 : 49 - 54 .

叶润生 , 徐明伟 . 命名数据网络中的邻居缓存路由策略 [J ] . 计算机科学与探索 , 2012 , 6 ( 7 ): 593 - 601 .

YE R S , XU M W . Neighbor cache explore routing strategy in named data network [J ] . Journal of Frontiers of Computer Science and Technology , 2012 , 6 ( 7 ): 593 - 601 .

National science foundation network [EB/OL ] . https://en.wikipedia.org/wiki/National_Science_Foundation_Network https://en.wikipedia.org/wiki/National_Science_Foundation_Network .

CHAI W K , HE D , PSARAS I , PAVLOU G . Cache“less formore”in information-centric networks [C ] // IFIP-TC6 Networking Conference . 2012 : 758 - 770 .

PSARAS I , CHAI W K , PAVLOU G . Probabilistic in-network caching for information-centric networks [C ] // ACM Workshop on Information-Centric Networking . 2012 : 55 - 60 .

Views

792

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Wireless Mesh network secure routing mechanism based on dynamic reputation

Node centrality metric based caching mechanism in content-centric network

Hierarchical division-based cache storage strategy in content-centric networking

Strategy of routing based on layered for underwater wireless sensor networks

Adaptive user behavior's evaluation method based on network status

Related Author

Yue HAN

Hongyu YANG

Xin-wei FAN

Yue-ping CAI

Jun LI

Jiang ZHI

bo WUHai

ming FENGZong

Related Institution

College of Computer Science and Technology, Civil Aviation University of China

Key Laboratory of Dependable Service Computing in Cyber Physical Society,Chongqing University

Computer Network information Center, Chinese Academy of Sciences

University of Chinese Academy of Sciences

College of Computer Science,Sichuan University

AI问答

⁰