期刊文献+

一种基于SDN的数据中心负载均衡路由算法 被引量:2

A Load-balancing Routing Algorithm of Data-Center Based on SDN
下载PDF
导出
摘要 随着数据中心网络对带宽和容错性等方面要求的不断提高,越来越多的数据中心开始采用胖树拓扑结构,胖树拓扑结构可以为任意两个不同POD的服务器提供多条等价路径,从而带来了高带宽和高容错性。然而,传统的路由算法并不能很好发挥胖树结构带来的性能提升,会造成很大的带宽浪费。因此,研究了一种基于SDN的数据中心负载均衡路由算法,依赖SDN控制器获取的数据中心网络全局信息,作出最优的负载均衡路由决策,从而降低网络拥塞的概率,并提高带宽利用率。 With the sustained growth of the requirement of data-center's network for bandwidth and fault tolerance,more and more data-centers begin to use fat-tree topology,which can provide multiple equivalent paths for two servers from different POD,which brings high bandwidth and high fault tolerance.However,the traditional routing algorithm does not give full play to the perfor⁃mance improvement brought by the fat-tree structure,which will cause a lot of bandwidth waste.Therefore,a load-balancing rout⁃ing algorithm of data-center based on SDN is studied,relying on the global information of data-center's network obtained by the SDN controller to make optimal load-balancing routing decisions.Therefor,it can reduce the probability of network congestion and improve bandwidth utilization.
作者 徐新羽 戴新发 夏静 李文铖 XU Xinyu;DAI Xinfa;XIA Jing;LI Wencheng(Wuhan Digital Engineering Institute,Wuhan 430205)
出处 《舰船电子工程》 2021年第7期129-132,共4页 Ship Electronic Engineering
关键词 SDN 负载均衡 路由选择 SDN load-balancing routing
  • 相关文献

参考文献3

二级参考文献34

  • 1吴吉义,沈千里,章剑林,沈忠华,平玲娣.云计算:从云安全到可信云[J].计算机研究与发展,2011,48(S1):229-233. 被引量:54
  • 2陈海焱,陈金富,杨雄平,陈波,陈驾宇.配电网中计及短路电流约束的分布式发电规划[J].电力系统自动化,2006,30(21):16-21. 被引量:56
  • 3陈为,张嵩,鲁爱东.数据可视化的基本原理与方法[M].北京:科学出版社,2013.
  • 4Gilbert A C, Levchenko K. Compressing network graphs [ C ]// Proceedings of the LinkKDD workshop at the 10th ACM con- ference on KDD. [ s. 1. ] : [ s. n. ] ,2004.
  • 5Holten D, van Wijk J J. Force-directed edge bundling for graph visualization [ J ]. Computer Graphics Forum, 2009,28 (3) :983-990.
  • 6Eades P. A heuristics for graph drawing [ J ]. Congressus Nu- merantium, 1989,42 : 146-160.
  • 7Hagberg A A, Schuh D A, Swart P J. Exploring network struc- ture, dynamics, and function using NetworkX [ C ]//Proc of the 7th python in science conference. [ s. 1. ] : [ s. n. ] ,2008.
  • 8Fruchterman T M J, Reingold E M. Graph drawing by force- directed placement [ J ]. Software : Practice and Experience, 1991,21 ( 11 ) : 1129-1164.
  • 9Brandes U. On variants of shortest-path betweenness centralityand their generic computation [ J 1- Social Networks, 2008,30 (2) :136-145.
  • 10Holme P, Kim B J. Growing scale-free networks with tunable clustering[ J ]. Physical Review E ,2002,65 (2) :026107.

共引文献59

同被引文献15

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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