软件定义网络中基于分段路由的流量调度方法

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

通信学报 ›› 2018, Vol. 39 ›› Issue (11): 23-35.doi: 10.11959/j.issn.1000-436x.2018245

软件定义网络中基于分段路由的流量调度方法

董谦^1,^2,³,李俊¹(),马宇翔^1,²,韩淑君^1,²

¹ 中国科学院计算机网络信息中心，北京 100190
² 中国科学院大学，北京 100049
³ 佛山科学技术学院电子信息工程学院，广东佛山 528000

修回日期:2018-10-10 出版日期:2018-11-01 发布日期:2018-12-10
作者简介:董谦（1986?），男，湖北咸宁人，中国科学院计算机网络信息中心博士生，佛山科学技术学院讲师，主要研究方向为未来互联网、软件定义网络、流量工程等。|李俊（1968?），男，安徽桐城人，博士，中国科学院计算机网络信息中心研究员、总工程师、博士生导师，主要研究方向为未来互联网、网络安全等。|马宇翔（1991?），男，河南开封人，中国科学院计算机网络信息中心博士生，主要研究方向为网络体系结构、网络安全等。|韩淑君（1986?），女，山东高唐人，中国科学院计算机网络信息中心博士生，主要研究方向为网络体系结构、网络功能虚拟化等。
基金资助:
国家重点研发计划基金资助项目(2017YFB1401500);中国科技云建设工程资助项目(Y72923);国家自然科学基金资助项目(61672490)

Traffic scheduling method based on segment routing in software-defined networking

Qian DONG^1,^2,³,Jun LI¹(),Yuxiang MA^1,²,Shujun HAN^1,²

¹ Computer Network Information Center,Chinese Academy of Sciences,Beijing 100190,China
² University of Chinese Academy of Sciences,Beijing 100049,China
³ Department of Electronic and Information Engineering,Foshan University,Foshan 528000,China

Revised:2018-10-10 Online:2018-11-01 Published:2018-12-10
Supported by:
The National Key R＆D Program of China(2017YFB1401500);The China Science and Technology Cloud Project(Y72923);The National Natural Science Foundation of China(61672490)

摘要/Abstract

摘要：

针对软件定义网络流量调度的多商品流问题，提出一种基于分段路由的方法。所提方法预先计算所有源—目的节点间的候选路径集合和相应路径的属性，再结合流的各种需求和约束条件设置候选路径的属性应满足的要求，据此筛选得出流的候选路径集合；基于流的候选路径集合简化了软件定义网络中的多商品流模型，降低了求解难度，支持控制器集中控制和各节点自主控制的工作方式，缓解了控制器的可扩展性问题；还讨论了如何满足网络的节能需求，减少可参与流转发的链路数量。性能评估结果表明，所提方法可满足流的各种需求和约束条件，提高网络性能，减轻求解流量调度问题的计算负担。

关键词: 分段路由, 软件定义网络, 流量调度, 线性规划

Abstract:

In order to address the multi-commodity flow problem for traffic scheduling in software-defined networking,a method based on segment routing was proposed.The proposed method pre-computed sets of candidate paths and attributes of these paths for all source-target nodes,and set the requirements of attributes of candidate paths that should be met combined with various demands and constraints of flows,then generated sets of candidate paths for flows.In the proposed scheme,multi-commodity flow model in software-defined networking was simplified based on sets of candidate paths for flows,the difficulty of solving was reduced,the centralized control by the controller and the autonomous control by nodes were supported,the scalability of controller was improved.In addition,how to meet the energy-saving needs of the network was proposed,i.e.,reducing the number of links that could participate in flow forwarding.The performance evaluation results indicate that the proposed method can meet various demands and constraints of flows,improve network performance,and reduce the computational load of solving the problem of traffic scheduling.

Key words: segment routing, software-defined networking, traffic scheduling, linear programming

中图分类号:

TP393

董谦,李俊,马宇翔,韩淑君. 软件定义网络中基于分段路由的流量调度方法[J]. 通信学报, 2018, 39(11): 23-35.

Qian DONG,Jun LI,Yuxiang MA,Shujun HAN. Traffic scheduling method based on segment routing in software-defined networking[J]. Journal on Communications, 2018, 39(11): 23-35.

图/表 11

表1

图1

图2

图3

图4

图5

图6

表2

图7

图8

表3

参考文献 27

[1]	WANG N , HO K , PAVLOU G ,et al. An overview of routing optimization for internet traffic engineering[J]. IEEE Communications Surveys＆ Tutorials, 2008,10(1): 36-56.
[2]	FILSFILS C , NAINAR N K , PIGNATARO C ,et al. The segment routing architecture[C]// IEEE Global Communications Conference. 2015: 1-6.
[3]	KREUTZ D , RAMOS F M V , VERISSIMO P E ,et al. Software-defined networking:a comprehensive survey[J]. Proceedings of the IEEE, 2015,103(1): 14-76.
[4]	HARTERT R , VISSICCHIO S , SCHAUS P ,et al. A declarative and expressive approach to control forwarding paths in carrier-grade networks[J]. ACM SIGCOMM Computer Communication Review, 2015,45(4): 15-28.
[5]	MORENO E , BEGHELLI A , CUGINI F . Traffic engineering in segment routing networks[J]. Computer Networks, 2017,114: 23-31.
[6]	BHATIA R , HAO F , KODIALAM M ,et al. Optimized network traffic engineering using segment routing[C]// IEEE International Conference on Computer Communications. 2015: 657-665.
[7]	HARTERT R , SCHAUS P , VISSICCHIO S ,et al. Solving segment routing problems with hybrid constraint programming techniques[C]// International Conference on Principles and Practice of Constraint Programming. 2015: 592-608.
[8]	SCHüLLER T , ASCHENBRUCK N , CHIMANI M ,et al. Traffic engineering using segment routing and considering requirements of a carrier IP network[C]// IFIP Networking Conference and Workshops. 2017: 1-9.
[9]	GIORGETTI A , CASTOLDI P , CUGINI F ,et al. Path encoding in segment routing[C]// IEEE Global Communications Conference. 2015: 1-6.
[10]	LI S , HU D , FANG W ,et al. Source routing with protocol-oblivious forwarding (POF) to enable efficient e-health data transfers[C]// IEEE International Conference on Communications. 2016: 1-6.
[11]	DONG X , GUO Z , ZHOU X ,et al. AJSR:an efficient multiple jumps forwarding scheme in software-defined WAN[J]. IEEE Access, 2017,5: 3139-3148.
[12]	FILSFILS C , MICHIELSEN K , TALAULIKAR K . Segment routing,part I[M]. North Charleston: CreateSpace Independent Publishing PlatformPress, 2017.
[13]	周桐庆, 蔡志平, 夏竟 ,等. 基于软件定义网络的流量工程[J]. 软件学报, 2016,27(2): 394-417.
	ZHOU T Q , CAI Z P , XIA J ,et al. Traffic engineering for software defined networks[J]. Journal of Software, 2016,27(2): 394-417.
[14]	CIANFRANI A , LISTANTI M , POLVERINI M . Incremental deployment of segment routing into an ISP network:a traffic engineering perspective[J]. IEEE/ACM Transactions on Networking, 2017,25(5): 3146-3160.
[15]	GUEDREZ R , DUGEON O , LAHOUD S ,et al. Label encoding algorithm for MPLS segment routing[C]// IEEE International Symposium on Network Computing and Applications. 2016: 113-117.
[16]	CIANFRANI A , LISTANTI M , POLVERINI M . Translating traffic engineering outcome into segment routing paths:the encoding problem[C]// IEEE Conference on Computer Communications Workshops. 2016: 245-250.
[17]	LEE K , TOGUYENI A , NOCE A ,et al. Comparison of multipath algorithms for load balancing in a MPLS network[C]// International Conference on Information Networking. 2005: 463-470.
[18]	LEE K , TOGUYENI A , RAHMANI A . Hybrid multipath routing algorithms for load balancing in MPLS based IP network[C]// IEEE International Conference on Advanced Information Networking and Applications. 2006.
[19]	SUCHARA M , XU D , DOVERSPIKE R ,et al. Network architecture for joint failure recovery and traffic engineering[C]// ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems. 2011: 97-108.
[20]	LECONTE M , DESTOUNIS M , PASCHOS G . Traffic engineering with precomputed pathbooks[C]// IEEE International Conference on Computer Communications. 2018.
[21]	MCKEOWN N , ANDERSON T , BALAKRISHNAN H ,et al. OpenFlow:enabling innovation in campus networks[J]. ACM SIGCOMM Computer Communication Review, 2008,38(2): 69-74.
[22]	HIGHAM D J , HIGHAM N J . MATLAB guide[M]. Philadelphia: Society for Industrial and Applied MathematicsPress, 2016.
[23]	BRANKE J , DEB K. , MIETTINEN K ,et al. Multiobjective optimization:interactive and evolutionary approaches[M]. Berlin: Springer Science ＆ Business MediaPress, 2008.
[24]	ZHANG J , YU F R , WANG S ,et al. Load balancing in data center networks:a survey[J]. IEEE Communications Surveys ＆ Tutorials, 2018,20(3): 2324-2352.
[25]	ZHANG M , YI C , LIU B ,et al. GreenTE:power-aware traffic engineering[C]// The 18th IEEE International Conference on Network Protocols. 2010: 21-30.
[26]	GUROBI OPTIMIZATION , LLC . Gurobi optimizer reference manual[M]. Beaverton: Gurobi OptimizationPress, 2018.
[27]	ORLOWSKI S , WESS?LY R , PIóRO M ,et al. 0 - survivable network design library[J]. Networks, 2010,55(3): 276-286.

方案	网络类型	优化目标	模型	SLD约束	流转发是否可多路径	路径编码方式	计算方式
文献[6]	SR网络	最大链路利用率	LP,ILP	2 segment	是	基于中间节点	集中式计算
文献[4]	SR网络	主要为最大链路利用率，可附加其他	MR	可设定	是	基于中间节点	集中式计算
文献[5]	SR网络	最大链路利用率	ILP	可设定	否	基于编码算法	集中式计算
文献[14]	混合网络	最大链路利用率	MILP	未讨论	否，扩展后可支持	基于编码算法	集中式计算
本方案	SR网络	主要为最大链路利用率或节能效果，可附加其他	LP,ILP,MILP	可设定	是	基于路径预计算	集中式计算或各节点自主计算

F	条件	cost_p相对最短路径的比值
F	条件	<1.25	<1.50	<1.75
Germany50-F₁	sld_p≤3,Con,SP	1.20	1.07	1.00
Germany50-F₁	sld_p≤3,nCon,SP	1.36	1.30	1.23
Germany50-F₁	sld _p≤3,Con,MP	1.20	1.07	1.00
Germany50-F₁	sld _p≤3,nCon,MP	1.26	1.23	1.05
Germany50-F₂	sld _p≤3,Con,SP	1.20	1.07	1.00
Germany50-F₂	sld _p≤3,nCon,SP	1.38	1.30	1.22
Germany50-F₂	sld _p≤3,Con,MP	1.20	1.07	1.00
Germany50-F₂	sld _p≤3,nCon,MP	1.30	1.19	1.09
Germany50-F₃	sld _p≤3,Con,SP	1.20	1.08	1.00
Germany50-F₃	sld _p≤3,nCon,SP	1.37	1.31	1.12
Germany50-F₃	sld _p≤3,Con,MP	1.20	1.08	1.00
Germany50-F₃	sld _p≤3,nCon,MP	1.27	1.25	1.06

软件定义网络中基于分段路由的流量调度方法

Traffic scheduling method based on segment routing in software-defined networking

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 11

参考文献 27

相关文章 15

Metrics

推荐阅读 0

条件	GéANT-F₁	GéANT-F₁	GéANT-F₁
sld_p=1	36	36	36
sld _p≤2,nCon,SP	28	27	28
sld _p≤2,nCon,MP	28	27	28
sld _p≤3,nCon,SP	24	22	22
sld _p≤3,nCon,MP	24	22	22
sld _p≤4,nCon,SP	22	21	21
sld _p≤4,nCon,MP	22	21	21

[1]	王东滨, 吴东哲, 智慧, 郭昆, 张勖, 时金桥, 张宇, 陆月明. 软件定义网络抗拒绝服务攻击的流表溢出防护[J]. 通信学报, 2023, 44(2): 1-11.
[2]	刘帅, 关杰, 胡斌, 马宿东. 基于MILP的轻量级密码算法ACE的差分分析[J]. 通信学报, 2023, 44(1): 39-48.
[3]	聂宏蕊, 李绍胜, 刘勇. 时间敏感网络中基于IEEE 802.1Qch标准的优化调度机制[J]. 通信学报, 2022, 43(9): 12-26.
[4]	沙宗轩, 霍如, 孙闯, 汪硕, 黄韬. 基于深度强化学习的转发效能感知流量调度算法[J]. 通信学报, 2022, 43(8): 30-40.
[5]	尹长川, 李妍珏, 朱海龙, 何欣欣, 韩文璇. HSTC：TSN中的混合流量调度机制[J]. 通信学报, 2022, 43(6): 119-132.
[6]	燕昺昊, 刘勤让, 沈剑良, 汤先拓, 梁栋. 软件定义网络中一种快速无循环路径迁移策略[J]. 通信学报, 2022, 43(5): 24-35.
[7]	吴平, 常朝稳, 左志斌, 马莹莹. 基于地址重载的SDN分组转发验证[J]. 通信学报, 2022, 43(3): 88-100.
[8]	李传煌, 陈泱婷, 唐晶晶, 楼佳丽, 谢仁华, 方春涛, 王伟明, 陈超. QL-STCT：一种SDN链路故障智能路由收敛方法[J]. 通信学报, 2022, 43(2): 131-142.
[9]	裴金川, 胡宇翔, 田乐, 胡涛, 李子勇. 联合路由规划的时间敏感网络流量调度方法[J]. 通信学报, 2022, 43(12): 54-65.
[10]	吴平, 常朝稳, 马莹莹. 基于端址重载的SDN包转发验证[J]. 通信学报, 2021, 42(7): 70-83.
[11]	常朝稳, 金建树, 韩培胜, 祝现威. 基于属性签名标识的SDN数据包转发验证方案[J]. 通信学报, 2021, 42(6): 131-144.
[12]	周启钊, 于俊清, 李冬. SDN控制层泛洪防御机制研究：检测与缓解[J]. 通信学报, 2021, 42(11): 41-53.
[13]	李硕朋, 方娟, 陈肯. 基于SRv6的确定性网络服务共享保护方案[J]. 通信学报, 2021, 42(10): 32-42.
[14]	姚蓝,兰巨龙. 基于联盟博弈的自适应SDN交换机迁移机制[J]. 通信学报, 2020, 41(8): 1-10.
[15]	王耀民,王霞,董易,张松海,施心陵. 基于斐波那契树优化算法的数据中心流量调度策略[J]. 通信学报, 2020, 41(6): 112-127.