基于软件定义网络的多路径路由算法性能研究
Performance of multipath routing algorithms based on software defined networking paradigm

基于不相交多路径的路由方案在负载平衡、 容错等方面具有明显优势，但存在计算复杂度高的缺点，故对应的分布式算法难以在网络中大规模部署. 通过分析软件定义网络的特点，论证了在其网络中部署不相交路径路由方案的可行性. 其次，基于网络流的性质与不相交路径的图论性质，设计并实现了计算不相交路径的算法. 最后，通过一系列基于不同网络模型的对比实验，验证所提算法较传统最短单条路径路由算法具有更佳的负载均衡. 实验结果表明，该算法的性能与网络中链路能承受的负载极限阈值有关.
Although disjoint multi-path routing has significant advantages in load balancing and fault tolerance，it is difficult to deploy in large-scale networks because of its high time complexity. To tackle this problem，the paper first analyzes the characteristics of software definition networking(SDN) paradigm，and consequently demonstrates the feasibility of the multiple disjoint routing scheme in SDN networks. Then，an algorithm for calculating disjoint paths is implemented based on network flow theory and graph properties of disjoint paths. Last but not the least，by designing a series of experiments in various network models，it is shown that routing based on multiple disjoint paths outperforms traditional routing based on single shortest path in load balancing. Meanwhile，the experimental results indicate that the performance of the algorithm is related to the load limit threshold of the links in networks