期刊文献+

SDN网络中基于业务划分的路由选择机制 被引量:3

Routing Mechanism Based on Business Differentiating in Software Defined Network
下载PDF
导出
摘要 软件定义网络(SDN)是一种新型的网络架构,其路径是根据全局网络拓扑计算得到的。然而,当前SDN网络中依然存在负载不均衡和不能满足网络流量QoS要求的问题。为此,根据SDN控制器掌握全局网络信息的特点,结合网络感知功能和基于流量的业务划分,利用K最短路径算法,提出一种基于业务划分的路由选择机制。实验结果表明,该机制能够为不同业务类型的数据流选择一条最能满足其QoS要求的路径,并使整个网络达到负载均衡,进而提高了底层网络资源的利用率。 Software defined network is a novel network architecture whose data path is obtained based on the global to- pology. In current SDN network, load balance and QoS assurance are the crucial issues which are unresolved perfectly. To this end, according to the global network information hold by the SDN controller, we proposed a differentiated busi- ness based routing mechanism in which the function of network awareness, the traffic-based business differentiating and the K shortest path algorithm are applied. Experimental results show that this mechanism can choose an optimal path which satisfies the QoS requirements for different types of data traffics, balance the load of entire network and improve the utilization of the underlying network resources.
作者 李兵奎 庄雷 马丁 胡颖 王国卿 景晨凯 LI Bing-kui ZHUANG Lei MA Ding HU Ying WANG Guo-qing JING Chen-kai(School of Information Engineering, Zhengzhou University, Zhengzhou 450001, China College of Information Science and Engineering, Henan University of Technology, Zhengzhou 450001, China)
出处 《计算机科学》 CSCD 北大核心 2017年第3期118-122,共5页 Computer Science
基金 国家重点基础研究发展计划(973计划)项目(2012CB315901) 国家自然科学基金资助项目(61379079) 河南省科技厅攻关项目(122102210042)资助
关键词 软件定义网络 业务划分 K最短路径 网络感知 Software defined network, Business differentiating, K shortest paths, Network awareness
  • 相关文献

参考文献5

二级参考文献97

  • 1唐治果,李乐民,虞红芳.针对MPLS网络流量工程的链路关键性路由算法[J].电子与信息学报,2007,29(5):1187-1190. 被引量:13
  • 2Masip-Bruin X,Yannuzzi M,Domingo-Pascual J,et al.Research challenges in QoS routing[J].IEEE Computer Communications,2006,29(5):563-581.
  • 3Orda A.QoS routing:Challenges and solution approaches[C]∥IEEE Computer Society.2005:2-xxii.
  • 4Sridharan A,Guérin R,Diot C.Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks[J].IEEE/ACM Trans.Netw,2005,13(2):234-247.
  • 5Wang Z,Wang Y,Zhang L.Internet traffic engineering without full-mesh overlaying[C]∥Proc.INFOCOM 2001.2001:565-571.
  • 6Fortz B,Thorup M.Internet Traffic Engineering by Optimizing OSPF Weights[C]∥Proceedings of the INFOCOM 2000.2000:519-528.
  • 7Cao Z,Wang Z,Zegura E.Performance of hashing-based schemes for Intemet load balancing[C]∥Proceedings of IEEE INFOCOM.2000,1:332-341.
  • 8Zinin A,Cisco Routing.PacketForwarding and Intra-domain Routing Protocals[M].Section 5.5.1:Addison Wesley,2002.
  • 9Chim T W,Yeung K L.Traffic distribution over equal-cost multi-paths[C]∥Proceedings of IEEE International Conference on Communications.2004.2:1207-1211.
  • 10Szeto W,Boutaba R,Iraqi Y.Dynamic Online Routing Algorithm for MPLS Traffic Engineering[C]∥NETWORKING2002.2002:936-946.

共引文献442

同被引文献7

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部