Parallel Multi-path Forwarding Strategy for Named Data Networking

被引:4
作者
Bouacherine, Abdelkader [1 ]
Senouci, Mustapha Reda [1 ]
Merabti, Billal [1 ]
机构
[1] Ecole Militaire Polytech, AI Lab, POB 17, Algiers 16111, Algeria
来源
DCNET: PROCEEDINGS OF THE 13TH INTERNATIONAL JOINT CONFERENCE ON E-BUSINESS AND TELECOMMUNICATIONS - VOL. 1 | 2016年
关键词
Named Data Networking; NDN Flow; NDN Fairness; Forwarding Strategy; Forwarding Decisions; Weighted Alpha-proportional Fairness; Flow Assignment Problem; FAIRNESS;
D O I
10.5220/0005964600360046
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Named Data Networking (NDN) is one of the most promising instantiations of the Information Centric Networking (ICN) philosophy. This new design needs a new thinking due to the fact that the definitions of some concepts used in TCP/IP paradigm are no longer appropriate. In this context, flow and fairness concepts are examined and new perspectives are proposed. An important literature exists about forwarding strategies and congestion control in NDN context. Unfortunately, the lack of definitions pushed many researchers to use the TCP/IP heritage. As a consequence, they neither fully benefit from the native multi-path support nor address the fairness problem. In order to overcome such a drawback and to meet end-users fairness while optimizing network throughput, a new Parallel Multi-Path Forwarding Strategy (PMP-FS) is proposed in this paper. The PMP-FS proactively splits traffic by determining how the multiple routes will be used. It takes into consideration NDN in-network caching and NDN Interest aggregation features to achieve weighted alpha fairness among different flows. Obtained preliminary results show that PMP-FS looks promising.
引用
收藏
页码:36 / 46
页数:11
相关论文
共 30 条
  • [1] [Anonymous], TECHNICAL REPORT
  • [2] [Anonymous], TECHNICAL REPORT
  • [3] [Anonymous], 2012, TECHNICAL REPORT
  • [4] [Anonymous], 2013, THESIS
  • [5] [Anonymous], PROPOSED INFORM CENT
  • [6] [Anonymous], ARXIV150202111V1CSNI
  • [7] [Anonymous], TECHNICAL REPORT
  • [8] [Anonymous], 2014, THESIS
  • [9] [Anonymous], IEEE GLOB INT S GI 2
  • [10] Baid A, 2012, IEEE CONF COMPUT, P298, DOI 10.1109/INFCOMW.2012.6193509