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

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

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

CLC Number:

TP393

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.

Figures/Tables 11

References 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.

Metrics

Recommended 0

No Suggested Reading articles found!

方案	网络类型	优化目标	模型	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

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 11

References 27

Related Articles 15

Metrics

Recommended 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]	Hongrui NIE, Shaosheng LI, Yong LIU. Optimized scheduling mechanism based on IEEE 802.1Qch standard in time-sensitive networking [J]. Journal on Communications, 2022, 43(9): 12-26.
[2]	Zongxuan SHA, Ru HUO, Chuang SUN, Shuo WANG, Tao HUANG. Forwarding efficiency aware traffic scheduling algorithm based on deep reinforcement learning [J]. Journal on Communications, 2022, 43(8): 30-40.
[3]	Changchuan YIN, Yanjue LI, Hailong ZHU, Xinxin HE, Wenxuan HAN. HSTC: hybrid traffic scheduling mechanism in time-sensitive networking [J]. Journal on Communications, 2022, 43(6): 119-132.
[4]	Ping WU, Chaowen CHANG, Zhibin ZUO, Yingying MA. Address overloading-based packet forwarding verification in SDN [J]. Journal on Communications, 2022, 43(3): 88-100.
[5]	Jinchuan PEI, Yuxiang HU, Le TIAN, Tao HU, Ziyong LI. Time-sensitive network traffic scheduling method with joint routing planning [J]. Journal on Communications, 2022, 43(12): 54-65.
[6]	Ping WU, Chaowen CHANG, Yingying MA. Port address overloading based packet forwarding verification in SDN [J]. Journal on Communications, 2021, 42(7): 70-83.
[7]	Shuopeng LI, Juan FANG, Ken CHEN. DetNet service share protection scheme based on SRv6 [J]. Journal on Communications, 2021, 42(10): 32-42.
[8]	Lan YAO,Julong LAN. Adaptive SDN switch migration mechanism based on coalitional game [J]. Journal on Communications, 2020, 41(8): 1-10.
[9]	Yaomin WANG,Xia WANG,Yi DONG,Songhai ZHANG,Xinling SHI. Data center traffic scheduling strategy based on Fibonacci tree optimization algorithm [J]. Journal on Communications, 2020, 41(6): 112-127.
[10]	Julong LAN,Xueshuai ZHANG,Yuxiang HU,Penghao SUN. Software-defined networking QoS optimization based on deep reinforcement learning [J]. Journal on Communications, 2019, 40(12): 60-67.
[11]	Xuanli WU,Xu CHEN. Joint energy efficiency and spectral efficiency optimization algorithm for UDN under the restriction of interference threshold and backhaul capacity [J]. Journal on Communications, 2019, 40(12): 86-97.
[12]	Qian DONG,Jun LI,Yuxiang MA. Traffic scheduling method based on centralized control in named data networking [J]. Journal on Communications, 2018, 39(7): 68-80.
[13]	Zheng-you LIANG,Yu-mei YAO. Study of energy efficient WBAN topology optimization in IEEE 802.15.6 [J]. Journal on Communications, 2016, 37(6): 1-10.
[14]	Chun-yu MIAO,Li-na CHEN,Guo-yong DAI,Fan YANG,Qing-zhang CHEN. Minimum number oriented relay node deployment algorithm in two-tiered WSN [J]. Journal on Communications, 2016, 37(4): 139-148.
[15]	Qiang ZHU,Hui-qiang WANG,Chun-guang MA,Guang-sheng FENG,Hong-wu LV. Reliable heuristic mapping method for survivable virtual network [J]. Journal on Communications, 2015, 36(7): 109-119.