期刊文献+

基于SDN的多目标路径优化算法研究

Research on Multi-Objective Path Optimization Algorithm Based on SDN
下载PDF
导出
摘要 SDN网络是基于跳数的最短路径转发策略,当有大量的突发流量,这种策略非常的不灵活,极易形成网络的拥塞,进而影响网络的服务质量.为此,基于SDN网络的结构特点,将SDN网络拓扑中的链路资源信息用到多目标路由算法中,通过多目标路由优化选出最佳路径.结果表明,与传统的路由算法相比,多目标路径优化算法在数据吞吐量、链路利用率、平均时延及数据丢包率等方面均具有较好的性能提升,使网络拥塞发生的概率大幅降低. At present, SDN network is the shortest path forwarding strategy based on hops. When there is a large number of burst traffic, this strategy is very inflexible, and it is very easy to form network congestion,thus affecting the network quality of service. According to the structural characteristics of SDN network, this paper applies the link resource information in SDN network topology to the multi-objective routing algorithm,and selects the best path through multi-objective routing optimization. Experimental results show that, compared with traditional routing algorithms, the multi-objective path optimization algorithm proposed in this paper has better performance improvement in data throughput, link utilization, average delay and data packet loss rate, which greatly reduces the probability of network congestion.
作者 潘晓君 PAN Xiao-jun(School of Information Engineering,Anhui Business Vocational College,Hefei 231131,Anhui,China)
出处 《喀什大学学报》 2022年第6期62-65,共4页 Journal of Kashi University
基金 安徽省人文社科重点项目“区块链视域下网络安全产教融合应用研究”(2022AH052788)。
关键词 SDN 多目标路径优化 网络拥塞 SDN multi-objective path optimization network congestion
  • 相关文献

参考文献6

二级参考文献34

  • 1卢学强,梁雪慧,卢学军.神经网络方法及其在非线性时间序列预测中的应用[J].系统工程理论与实践,1997,17(6):97-99. 被引量:56
  • 2Lin Pingping, Hart J, Krishnaswamy U, et al. Seamless Interworking of SDN and IP[J]. ACM Sigcomm Computer Communication Review,2013,43(4) :475-476.
  • 3Jain S, Kumar A, Mandal S, et al. B4 : Experience with a Globally-deployed Software Defined WAN [ J ]. ACM Sigcomm Computer Communication Review, 2013, 43(4) :3-14.
  • 4Guo Yingya, Wang Zhiliang, Xia Yin, et al. Traffic Engineering in SDN/OSPF Hybrid Network [ C ]// Proceedings of IEEE the 22nd International Conference on Network Protocols. Washington D. C., USA: IEEE Press ,2014:563-568.
  • 5Vardi Y. Network Tomography: Estimating Source- destination Traffic Intensities from Link Data I J ]. Journal of the American Statistical Association, 1996, 91 (433) :365-377.
  • 6Cao Jin, Davis D, Vander W S, et al. Time-varying Network Tomography : Router Link Data [ J ]. Journal of the American Statistical Association, 2000, 95 ( 452 ) .. 1063-1075.
  • 7Zhang Yin,Roughan M, Duffield N, et al. Fast Accurate Computation of Large-scale IP Traffic Matrices from Link Loads I J ]. ACM SIGMETRICS Performance Evaluation Review ,2003,31 ( 1 ) :206-217.
  • 8Nucci A,Cruz R,Taft N,et al. Design of IGP Link WeightChanges for Estimation of Traffic Matrices[CJ//Pro- ceedings of the 23rd Annual Joint Conference of IEEE Computer and Communications Societies. Washington D.C., USA :IEEE Press ,2004:2341-2351.
  • 9Papagiannaki K, Taft N, Lakhina A. A Distributed Approach to Measure IP Traffic Matrices I C 1// Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement. New York, USA: ACM Press, 2004 : 161-174.
  • 10Lakhina A, Papagiannaki K, Crovella M, et al. Structural Analysis of Network Traffic Flowsl C 1//Proceedings of Joint International Conference on Measurement and Modeling of Computer Systems. New York, USA : ACM Press ,2004:61-72.

共引文献50

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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