Full Text:   <2170>

Summary:  <1699>

CLC number: TP393

On-line Access: 2024-08-27

Received: 2023-10-17

Revision Accepted: 2024-05-08

Crosschecked: 2018-09-10

Cited: 0

Clicked: 5592

Citations:  Bibtex RefMan EndNote GB/T7714

 ORCID:

Jia Li

http://orcid.org/0000-0002-2022-1674

-   Go to

Article info.
Open peer comments

Frontiers of Information Technology & Electronic Engineering  2018 Vol.19 No.9 P.1135-1150

http://doi.org/10.1631/FITEE.1700698


A novel forwarding and routing mechanism design in SDN-based NDN architecture


Author(s):  Jia Li, Ren-chao Xie, Tao Huang, Li Sun

Affiliation(s):  State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China

Corresponding email(s):   renchao_xie@bupt.edu.cn

Key Words:  SDN-based NDN, Forwarding mechanism, QoS routing, Genetic algorithm


Jia Li, Ren-chao Xie, Tao Huang, Li Sun. A novel forwarding and routing mechanism design in SDN-based NDN architecture[J]. Frontiers of Information Technology & Electronic Engineering, 2018, 19(9): 1135-1150.

@article{title="A novel forwarding and routing mechanism design in SDN-based NDN architecture",
author="Jia Li, Ren-chao Xie, Tao Huang, Li Sun",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="19",
number="9",
pages="1135-1150",
year="2018",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.1700698"
}

%0 Journal Article
%T A novel forwarding and routing mechanism design in SDN-based NDN architecture
%A Jia Li
%A Ren-chao Xie
%A Tao Huang
%A Li Sun
%J Frontiers of Information Technology & Electronic Engineering
%V 19
%N 9
%P 1135-1150
%@ 2095-9184
%D 2018
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.1700698

TY - JOUR
T1 - A novel forwarding and routing mechanism design in SDN-based NDN architecture
A1 - Jia Li
A1 - Ren-chao Xie
A1 - Tao Huang
A1 - Li Sun
J0 - Frontiers of Information Technology & Electronic Engineering
VL - 19
IS - 9
SP - 1135
EP - 1150
%@ 2095-9184
Y1 - 2018
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.1700698


Abstract: 
Combining named data networking (NDN) and software-defined networking (SDN) has been considered as an important trend and attracted a lot of attention in recent years. Although much work has been carried out on the integration of NDN and SDN, the forwarding mechanism to solve the inherent problems caused by the flooding scheme and discard of interest packets in traditional NDN is not well considered. To fill this gap, by taking advantage of SDN, we design a novel forwarding mechanism in NDN architecture with distributed controllers, where routing decisions are made globally. Then we show how the forwarding mechanism is operated for interest and data packets. In addition, we propose a novel routing algorithm considering quality of service (QoS) applied in the proposed forwarding mechanism and carried out in controllers. We take both resource consumption and network load balancing into consideration and introduce a genetic algorithm (GA) to solve the QoS constrained routing problem using global network information. Simulation results are presented to demonstrate the performance of the proposed routing scheme.

一种基于SDN的NDN路由转发机制设计

摘要:近年来,命名数据网络(named data networking,NDN)和软件定义网络(software defined networking,SDN)的结合被认为是网络架构创新的重要趋势,吸引了大量关注。虽然关于两者结合已有大量研究成果,但未能解决传统NDN的转发机制存在兴趣包泛洪和丢弃的固有问题。基于SDN在NDN架构设计了一种新型转发机制,在架构中分布式部署集中控制器,进行全局路由决策,并设计了兴趣包和数据包的具体转发流程。基于设计的转发机制,提出一种基于服务质量(quality of service,QoS)的新型路由算法,综合考虑资源消耗和网络负载均衡,并利用改进遗传算法求解。仿真结果表明所提路由转发机制有良好性能。

关键词:基于SDN的NDN;转发机制;QoS路由;遗传算法

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Reference

[1]Ahlgren B, Dannewitz C, Imbrenda C, et al., 2011. A survey of information-centric networking. IEEE Commun Mag, 50(7):26-36.

[2]Ahn CW, Ramakrishna RS, 2002. A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans Evol Comput, 6(6):566-579.

[3]Akyildiz IF, Lee A, Wang P, et al., 2014. A roadmap for traffic engineering in SDN-openflow networks. Comput Netw, 71:1-30.

[4]Aubry E, Silverston T, Chrisment I, 2015. SRSC: SDN-based routing scheme for CCN. Proc IEEE Conf on Network Softwarization, p.1-5.

[5]Chanda A, Westphal C, 2013. ContentFlow: mapping content to flows in software defined networks. https://arxiv.org/pdf/1302.1493v2.pdf

[6]Dixit A, Hao F, Mukherjee S, et al., 2013. Towards an elastic distributed SDN controller. ACM SIGCOMM Comput Commun Rev, 43(4):7-12.

[7]Eum S, Jibiki M, Murata M, et al., 2015. A design of an ICN architecture within the framework of SDN. Proc 7th Int Conf on Ubiquitous and Future Networks, p.141-146.

[8]Feamster N, Rexford J, Zegura E, 2014. The road to SDN: an intellectual history of programmable networks. ACM SIGCOMM Comput Commun Rev, 44(2):87-98.

[9]Feng J, Jiang N, Wang SQ, 2012. Distributed QoS routing algorithm based on Partheno-GA. Proc Int Conf on Intelligent System Design and Engineering Application, p.247-250.

[10]Goldberg DE, 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Co., Reading, Mass.

[11]Hou HF, Li F, Wang HY, 2008. QoS multicast routing algorithm with multiple constraints based on GA. Proc Int Conf on Machine Learning and Cybernetics, p.1374-1378.

[12]Hou R, Chang YZ, Yang LQ, 2017. Multi-constrained QoS routing based on PSO for named data networking. IET Commun, 11(8):1251-1255.

[13]Jacobson V, Smetters DK, Briggs NH, et al., 2009a. VoCCN: voice-over content-centric networks. Proc Workshop on Re-architecting the Internet, p.1-6.

[14]Jacobson V, Smetters DK, Thornton JD, et al., 2009b. Networking named content. Proc 5th Int Conf on Emerging Networking Experiments and Technologies, p.1-12.

[15]Othman OMM, Okamura K, 2010. Design and implementation of application based routing using OpenFlow. Proc 5th Int Conf on Future Internet Technologies, p.60-67.

[16]Punhani A, Nitin, 2011. A QoS based routing using genetic algorithm. Proc World Congress on Information and Communication Technologies, p.793-797.

[17]Riedl A, 2002. A hybrid genetic algorithm for routing optimization in IP networks utilizing bandwidth and delay metrics. Proc IEEE Workshop on IP Operations and Management, p.166-170.

[18]Sakurauchi Y, McGeer R, Takada H, 2010. Open web: seamless proxy interconnection at the switching layer. Proc Int Conf on Networking and Computing, p.285-289.

[19]Salsano S, Blefari-Melazzi N, Detti A, et al., 2013. Information centric networking over SDN and OpenFlow: architectural aspects and experiments on the OFELIA testbed. Comput Netw, 57(16):3207-3221.

[20]Shin DW, Chong EKP, Siegel HJ, 2001. A multiconstraint QoS routing scheme using the depth-first search method with limited crankbacks. Proc IEEE Workshop on High Performance Switching and Routing, p.385-389.

[21]Son J, Kim D, Kang HS, et al., 2016. Forwarding strategy on SDN-based content centric network for efficient content delivery. Proc Int Conf on Information Networking, p.220-225.

[22]Syrivelis D, Parisis G, Trossen D, et al., 2012. Pursuing a software defined information-centric network. Proc European Workshop on Software Defined Networking, p.103-108.

[23]Wang HZ, Zhang P, Xiong L, et al., 2016. A secure and high-performance multi-controller architecture for software-defined networking. Front Inform Technol Electron Eng, 17(7):634-646.

[24]Wang XH, Wang GX, 2001. An algorithm for QoS routing to optimize network resource utilization. Proc Int Conf on Info-Tech and Info-Net, p.474-479.

[25]Wang Y, Ma XL, Lao YT, et al., 2014. A two-stage heuristic method for vehicle routing problem with split deliveries and pickups. J Zhejiang Univ-Sci C (Comput rm & Electron), 15(3):200-210.

[26]Whitley D, 1994. A genetic algorithm tutorial. Stat Comput, 4(2):65-85.

[27]Xylomenos G, Ververidis CN, Siris VA, et al., 2014. A survey of information-centric networking research. IEEE Commun Surv Tutor, 16(2):1024-1049.

[28]Yang Q, Sun T, 2008. Routing protocol for wireless sensor networks based on least hop. Comput Eng, 34(22):129-131 (in Chinese).

[29]Yussof S, See OH, 2010. A robust GA-based QoS routing algorithm for solving multi-constrained path problem. J Comput, 5(9):1322-1334.

[30]Zhang LX, Afanasyev A, Burke J, et al., 2014. Named data networking. ACM SIGCOMM Comput Commun Rev, 44(3):66-73.

[31]Zhao YF, Chen XY, 2011. Improvement and analysis of GA on finding QoS routing. Proc Int Conf on Electronic & Mechanical Engineering and Information Technology, p.4293-4296.

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - 2024 Journal of Zhejiang University-SCIENCE