%0 Journal Article
%A HUANG Tao
%A WANG Jian
%A XIE Ren-chao
%T A Heuristic Algorithm for Constructing Control-Traffic Routing Tree in Software-Defined Networks
%D 2015
%R 10.13190/j.jbupt.2015.03.013
%J Journal of Beijing University of Posts and Telecommunications
%P 82-87
%V 38
%N 3
%X <p>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.</p>
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2015.03.013