启发式构建软件定义网络的控制消息路由树算法  

A Heuristic Algorithm for Constructing Control-Traffic Routing Tree in Software-Defined Networks

作　　者：王健[1] 黄韬[1] 谢人超[1] 

机构地区：[1]北京邮电大学网络与交换技术国家重点实验室,北京100876

出　　处：《北京邮电大学学报》2015年第3期82-87,共6页Journal of Beijing University of Posts and Telecommunications

基　　金：国家重点基础研究发展计划(973计划)项目(2012CB3;15801);国家自然科学基金项目(61302089;61300184)

摘　　要：为了分析控制器位置和控制消息路由树对软件定义网络控制平面性能(如控制消息平均时延、控制消息路由树可靠性)的影响,建立相关数学模型,提出启发式的路由树搜索算法、最短路径算法和贪婪算法并对该模型进行优化.仿真结果显示,在相同的网络拓扑条件下,启发式路由树搜索算法能有效地在控制消息平均时延和控制消息路由树可靠性2个性能指标上取得均衡,其综合性能明显优于最短路径算法和贪婪算法.For analyzing the impact of both controller location and control messages routing tree on the performance of software-defined networking control plane（ e. g. the average latency of control messages,the routing tree reliability）,the corresponding mathematical model was built,and three algorithms,which are the heuristic routing tree algorithm,the shortest path algorithm and greedy algorithm,were also proposed to optimize the model for this controller placement problem. The evaluation results show that the proposed heuristic routing tree algorithm achieves a trade-off between control messages average latency and routing tree reliability,and obviously performs better than the shortest path algorithm and greedy algorithm.

关 键 词：软件定义网络 控制器位置 控制消息路由树 平均时延 可靠性 

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