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

董谦; 李俊; 马宇翔; 韩淑君

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

您当前的位置：

首页 >

文章列表页 >

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

学术论文 | 更新时间：2024-06-05

- 软件定义网络中基于分段路由的流量调度方法
- Traffic scheduling method based on segment routing in software-defined networking
- 通信学报 2018年39卷第11期页码：23-35
- 作者机构：
  
  1. 中国科学院计算机网络信息中心，北京 100190
  2. 中国科学院大学，北京 100049
  3. 佛山科学技术学院电子信息工程学院，广东佛山 528000
- 作者简介：
  
  [ "董谦（1986−），男，湖北咸宁人，中国科学院计算机网络信息中心博士生，佛山科学技术学院讲师，主要研究方向为未来互联网、软件定义网络、流量工程等。" ]
  [ "李俊（1968−），男，安徽桐城人，博士，中国科学院计算机网络信息中心研究员、总工程师、博士生导师，主要研究方向为未来互联网、网络安全等。" ]
  [ "马宇翔（1991−），男，河南开封人，中国科学院计算机网络信息中心博士生，主要研究方向为网络体系结构、网络安全等。" ]
  [ "韩淑君（1986−），女，山东高唐人，中国科学院计算机网络信息中心博士生，主要研究方向为网络体系结构、网络功能虚拟化等。" ]
- 基金信息：
  
  国家重点研发计划基金资助项目(2017YFB1401500);中国科技云建设工程资助项目(Y72923);国家自然科学基金资助项目(61672490)
- DOI：10.11959/j.issn.1000-436x.2018245
  中图分类号： TP393
- 网络出版日期：2018-11，
  
  纸质出版日期：2018-11-25
- 稿件说明：
移动端阅览
董谦, 李俊, 马宇翔, 等. 软件定义网络中基于分段路由的流量调度方法[J]. 通信学报, 2018,39(11):23-35.

Qian DONG, Jun LI, Yuxiang MA, et al. Traffic scheduling method based on segment routing in software-defined networking[J]. Journal on communications, 2018, 39(11): 23-35.
董谦, 李俊, 马宇翔, 等. 软件定义网络中基于分段路由的流量调度方法[J]. 通信学报, 2018,39(11):23-35. DOI： 10.11959/j.issn.1000-436x.2018245.

Qian DONG, Jun LI, Yuxiang MA, et al. Traffic scheduling method based on segment routing in software-defined networking[J]. Journal on communications, 2018, 39(11): 23-35. DOI： 10.11959/j.issn.1000-436x.2018245.

摘要

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

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.

关键词

Keywords

references

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 .

FILSFILS C , NAINAR N K , PIGNATARO C , et al . The segment routing architecture [C ] // IEEE Global Communications Conference . 2015 : 1 - 6 .

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 .

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 .

MORENO E , BEGHELLI A , CUGINI F . Traffic engineering in segment routing networks [J ] . Computer Networks , 2017 , 114 : 23 - 31 .

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 .

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 .

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 .

GIORGETTI A , CASTOLDI P , CUGINI F , et al . Path encoding in segment routing [C ] // IEEE Global Communications Conference . 2015 : 1 - 6 .

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 .

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 .

FILSFILS C , MICHIELSEN K , TALAULIKAR K . Segment routing,part I [M ] . North Charleston : CreateSpace Independent Publishing PlatformPress , 2017 .

周桐庆 , 蔡志平 , 夏竟 , 等 . 基于软件定义网络的流量工程 [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 .

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 .

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 .

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 .

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 .

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 .

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 .

LECONTE M , DESTOUNIS M , PASCHOS G . Traffic engineering with precomputed pathbooks [C ] // IEEE International Conference on Computer Communications . 2018 .

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 .

HIGHAM D J , HIGHAM N J . MATLAB guide [M ] . Philadelphia : Society for Industrial and Applied MathematicsPress , 2016 .

BRANKE J , DEB K. , MIETTINEN K , et al . Multiobjective optimization:interactive and evolutionary approaches [M ] . Berlin : Springer Science ＆ Business MediaPress , 2008 .

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 .

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 .

GUROBI OPTIMIZATION , LLC . Gurobi optimizer reference manual [M ] . Beaverton : Gurobi OptimizationPress , 2018 .

ORLOWSKI S , WESSÄLY R , PIÓRO M , et al . 0 - survivable network design library [J ] . Networks , 2010 , 55 ( 3 ): 276 - 286 .

浏览量

1713

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于集中控制的命名数据网络流量调度方法

基于INT感知的5G核心网用户面流量调度系统

联合路由规划的时间敏感网络流量调度方法

基于深度强化学习的转发效能感知流量调度算法

HSTC：TSN中的混合流量调度机制