Back to Search
Start Over
A K-means-based network partition algorithm for controller placement in software defined network
- Source :
- ICC
- Publication Year :
- 2016
- Publisher :
- IEEE, 2016.
-
Abstract
- 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.
- Subjects :
- Computer science
Distributed computing
Network partition
Packet forwarding
020206 networking & telecommunications
02 engineering and technology
Network topology
Network traffic control
Load management
Control system
0202 electrical engineering, electronic engineering, information engineering
020201 artificial intelligence & image processing
Software-defined networking
Algorithm
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- 2016 IEEE International Conference on Communications (ICC)
- Accession number :
- edsair.doi...........28630bc57911d40dc87b0f366299777f