中国邮电高校学报(英文版) ›› 2017, Vol. 24 ›› Issue (3): 44-50.

• Networks • 上一篇    下一篇

Modeling chunk-based content placement in information centric networking

王国卿1,刘江2,李秀芹1,杨绍禹1,李国佳1   

  1. 1. 华北水利水电大学
    2. 北京邮电大学
  • 收稿日期:2016-11-24 修回日期:2017-06-26 出版日期:2017-06-30 发布日期:2017-06-30
  • 通讯作者: 王国卿 E-mail:wangguoqing@ncwu.edu.cn
  • 基金资助:
    博士启动金

Modeling chunk-based content placement in information centric networking

  • Received:2016-11-24 Revised:2017-06-26 Online:2017-06-30 Published:2017-06-30
  • Contact: Guo-Qing WANG E-mail:wangguoqing@ncwu.edu.cn

摘要: Content-centric networking (CCN) proposes a content-centric paradigm which changes the waist hourglass from Internet protocol (IP) to content chunk. In this paper, based on content chunks, an optimization model of minimizing the total delay time in information centric networking (ICN) is established, and branch-and-bound method and greedy (BG) algorithm is proposed to get the content placement method. As the multipath is natural supported in CCN, chunk-based content placement can decline delay time obviously, even it would increase the calculation amount which can be solved easily by the node’s capacity. Simulation results indicate that the chunk-based content placement scheme is better than the single-based cache policy on the network total delay time, and the best number of each content chunk split is decided by the link density and the number of the nodes in the network.

关键词: information centric networking, branch-and-bound method and greedy algorithm, content placement, chunk-based

Abstract: Content-centric networking (CCN) proposes a content-centric paradigm which changes the waist hourglass from Internet protocol (IP) to content chunk. In this paper, based on content chunks, an optimization model of minimizing the total delay time in information centric networking (ICN) is established, and branch-and-bound method and greedy (BG) algorithm is proposed to get the content placement method. As the multipath is natural supported in CCN, chunk-based content placement can decline delay time obviously, even it would increase the calculation amount which can be solved easily by the node’s capacity. Simulation results indicate that the chunk-based content placement scheme is better than the single-based cache policy on the network total delay time, and the best number of each content chunk split is decided by the link density and the number of the nodes in the network.

Key words: information centric networking, branch-and-bound method and greedy algorithm, content placement, chunk-based

中图分类号: