期刊文献+

一种基于SDN和MPTCP的多径并行传输技术

Multipath parallel transfer technology based on SDN and MPTCP
在线阅读 下载PDF
导出
摘要 提出了根据网络信息状态通过SDN控制器来控制MPTCP流量以提高并行传输速率。利用所提出的最宽不相交选路算法,为每个MPTCP连接选择一组可用带宽最宽且链路差距较小的路径集;然后使用可用路径容量的比例作为流量分配到该路径上的概率,进一步减小子流的带宽差距;最后,通过搭建Floodlight仿真实验平台,证明方案能够避免MPTCP的不同子流经过同一路径,并有效地利用路径提升并行传输效率。 This paper proposed to control the MPTCP traffic through the SDN controller to improve the parallel transmission rate according to the network state.This paper used the proposed widest disjoint routing algorithm,it chose a set of available path sets with the widest bandwidth and a smaller link gap for each MPTCP connection,and then it used the ratio of the available path capacity as the probability that the traffic was allocated to the path,further reduced the bandwidth difference of the subflow.Finally,by setting up the Floodlight simulation experiment platform,the result proves that the scheme can avoid different paths of MPTCP going through the same path,and effectively use the path to enhance the parallel transmission efficiency.
作者 卢选民 戴继煌 肖鹏 魏媛媛 Lu Xuanmin;Dai Jihuang;Xiao Peng;Wei Yuanyuan(School of Electronics&Information,Northwestern Polytechnical University,Xi’an 710129,China)
出处 《计算机应用研究》 CSCD 北大核心 2018年第11期3393-3396,共4页 Application Research of Computers
关键词 多路传输控制协议(MPTCP) 多径路由 软件定义网络(SDN) 流量分配 MPTCP(multipath transmission control protocol) multi-path routing software-defined network traffic allocation
  • 相关文献

参考文献3

二级参考文献22

  • 1管驰明,韩光法,汤君友.基于计算机通信网的城市交通流动态管理(TDM)技术分析[J].交通运输系统工程与信息,2006,6(6):26-32. 被引量:5
  • 2王丽爱,周旭东,陈崚.最大团问题研究进展及算法测试标准[J].计算机应用研究,2007,24(7):69-70. 被引量:13
  • 3Bomze I M,Budinich M,Pardalos P M,et al.The maximum clique problem[M]//Handbook of combinatorial optimization.US:Springer,1999:1-74.
  • 4Ross I C,Harary F.On the determination of redundancies in sociometric chains[J].Psychometrika,1952,17(2):195-208.
  • 5Michael R G,Johnson D S.Computers and intractability:a guide to the theory of NP-completeness[M].San Francisco:WH Freeman&Co.,1979.
  • 6Carter R,Park K.How good are genetic algorithms at finding large cliques:an experimental study[R].[S.l.]:Computer Science Department,Boston University,1993.
  • 7Friden C,Hertz A,de Werra D.Stabulus:a technique for finding stable sets in large graphs with tabu search[J].Computing,1989,42(1):35-44.
  • 8Aarts E,Korst J.Simulated annealing and Boltzmann machines:a stochastic approach to combinatorial optimization and neural computing[M].[S.l.]:John Wiley,1990.
  • 9Ballard D H,Gardner P C,Srinivas M A.Graph problems and connectionist architectures[R].[S.l.]:Department of Computer Science,University of Rochester,1987.
  • 10Fomin F V,Grandoni F,Kratsch D.Measure and conquer:a simple O(20.288n)independent set algorithm[C]//Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm,2006:18-25.

共引文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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