Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2015, Vol. 38 ›› Issue (3): 82-87.doi: 10.13190/j.jbupt.2015.03.013

• Papers • Previous Articles     Next Articles

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

WANG Jian, HUANG Tao, XIE Ren-chao   

  1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2014-07-22 Online:2015-06-28 Published:2015-06-26

Abstract:

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.

Key words: software-defined networks, controller location, control message routing tree, average latency, reliability

CLC Number: