一种软件定义网络中基于博弈的混合路由算法  

Game-based hybrid routing algorithm in software defined networking

作　　者：任泽荣 陈庶樵[1] 方馨蔚 江逸茗[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,郑州450002

出　　处：《计算机应用研究》2017年第1期197-201,共5页Application Research of Computers

基　　金：创新群体资助项目(61521003);国家"973"计划资助项目(2012CB315901;2013CB329104);国家自然科学基金资助项目(61372121);国家"863"计划资助项目(2013AA013505)

摘　　要：现存软件定义网络中的流量工程算法考虑单一,难以实现流量均衡,且缺乏对端到端的时延优化。对此提出一种博弈混合路由算法,以少量的显式路由与基于目的的聚合流量配置,在保证流量均衡的同时,优化网络的平均端对端时延。聚合流量配置采用纳什议价博弈理论对流量均衡与端对端时延优化场景进行联合优化建模,并设计了相应的启发式算法进行求解。实验结果表明,与现有算法相比,流量均衡程度和平均端对端时延均得到一定程度的改善,在Splintlink拓扑中,最大链路利用率平均减少6%,平均端对端时延减少12%。In software defined networking, the existed traffic engineering algorithms only consider single factor, which was difficult to achieve traffic balance, and lack of end-to-end delay optimization. This paper presented the game-based hybrid routing algorithm to ensure traffic balance and optimize the average end-to-end delay, with a small amount of explicit routing and destination-based aggregated traffic configuration. The aggregated traffic configuration used Nash bargaining game theory to build the joint optimization model between traffic balance and the optimization of end-to-end delay, and designed a heuristic algorithm to obtain the near-optimal solution. Results show that, compared with the existed algorithms, the proposed algorithm improves the degree of traffic balance and average end-to-end delay, reducing the maximization link utilization by 6% and average end-to-end delay by 12% in Splintlink topology.

关 键 词：软件定义网络 流量工程 流量均衡 时延优化 

分 类 号：TP393.07[自动化与计算机技术—计算机应用技术]