TY - GEN
T1 - A K-means-based network partition algorithm for controller placement in software defined network
AU - Wang, Guodong
AU - Zhao, Yanxiao
AU - Huang, Jun
AU - Duan, Qiang
AU - Li, Jun
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/7/12
Y1 - 2016/7/12
N2 - Software Defined Networking (SDN), the novel paradigm of decoupling the control logic from packet forwarding devices, has been drawing considerable attention from both academia and industry. As the latency between a controller and switches is a significant factor for SDN, selecting appropriate locations for controllers to shorten the latency becomes one grand challenge. In this paper, we investigate multi-controller placement problem from the perspective of latency minimization. Distinct from previous works, the network partition technique is introduced to simplify the problem. Specifically, the network partition problem and the controller placement problem are first formulated. An optimized K-means algorithm is then proposed to address the problem. Extensive simulations are conducted and results demonstrate that the proposed algorithm can remarkably reduce the maximum latency between centroid and their nodes compared with the standard K-means. Specifically, the maximum latency can reach 2.437 times shorter than the average latency achieved by the standard K-means.
AB - Software Defined Networking (SDN), the novel paradigm of decoupling the control logic from packet forwarding devices, has been drawing considerable attention from both academia and industry. As the latency between a controller and switches is a significant factor for SDN, selecting appropriate locations for controllers to shorten the latency becomes one grand challenge. In this paper, we investigate multi-controller placement problem from the perspective of latency minimization. Distinct from previous works, the network partition technique is introduced to simplify the problem. Specifically, the network partition problem and the controller placement problem are first formulated. An optimized K-means algorithm is then proposed to address the problem. Extensive simulations are conducted and results demonstrate that the proposed algorithm can remarkably reduce the maximum latency between centroid and their nodes compared with the standard K-means. Specifically, the maximum latency can reach 2.437 times shorter than the average latency achieved by the standard K-means.
UR - http://www.scopus.com/inward/record.url?scp=84981350468&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84981350468&partnerID=8YFLogxK
U2 - 10.1109/ICC.2016.7511441
DO - 10.1109/ICC.2016.7511441
M3 - Conference contribution
AN - SCOPUS:84981350468
T3 - 2016 IEEE International Conference on Communications, ICC 2016
BT - 2016 IEEE International Conference on Communications, ICC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE International Conference on Communications, ICC 2016
Y2 - 22 May 2016 through 27 May 2016
ER -