MGOKA: A Multi-Objective Optimization Algorithm for Controller Placement Problem Combining Network Partition with Cluster Fusion in Software Defined Network

Software Defined Network (SDN) has been developed rapidly in technology and popularized in application due to its efficiency and flexibility in network management. In multi-controller SDN architecture, the Controller Placement Problem (CPP) must be solved carefully as it directly affects the whole network performance. This paper proposes a Multi-objective Greedy Optimized K-means Algorithm (MGOKA) to solve this problem to optimize worst-case and average delay between switches and controllers as well as synchronization delay and load balance among controllers for Wide Area Networks (WAN). MGOKA combines the process of network partition based on the K-means algorithm with cluster fusion based on the greedy algorithm and designs a normalization strategy to convert a multi-objective into a single-objective optimization problem. The simulation results depict that in different network scales with different numbers of controllers, the relative optimization rate of our proposed algorithm compared with K-means, K-means++, and GOKA can reach up to 101 . 5%, 109 . 9%, and 79 . 8%, respectively. Moreover, the error rate between MGOKA and the global optimal solution is always less than 4%.

Authors

Institutions

Publication Details

Journal
Wuhan University Journal of Natural Sciences
Published
2024-12-01
DOI
https://doi.org/10.1051/wujns/2024296589
Primary Topic
Software-Defined Networks and 5G
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

MGOKA: A Multi-Objective Optimization Algorithm for Controller Placement Problem Combining Network Partition with Cluster Fusion in Software Defined Network

Xihe Qiu, Changwei Xiao, W. J. Lu, Jue Chen
Wuhan University Journal of Natural Sciences
Software-Defined Networks and 5G
article

MGOKA: A Multi-Objective Optimization Algorithm for Controller Placement Problem Combining Network Partition with Cluster Fusion in Software Defined Network

Xihe Qiu, Changwei Xiao, W. J. Lu, Jue Chen
article en

Abstract

Software Defined Network (SDN) has been developed rapidly in technology and popularized in application due to its efficiency and flexibility in network management. In multi-controller SDN architecture, the Controller Placement Problem (CPP) must be solved carefully as it directly affects the whole network performance. This paper proposes a Multi-objective Greedy Optimized K-means Algorithm (MGOKA) to solve this problem to optimize worst-case and average delay between switches and controllers as well as synchronization delay and load balance among controllers for Wide Area Networks (WAN). MGOKA combines the process of network partition based on the K-means algorithm with cluster fusion based on the greedy algorithm and designs a normalization strategy to convert a multi-objective into a single-objective optimization problem. The simulation results depict that in different network scales with different numbers of controllers, the relative optimization rate of our proposed algorithm compared with K-means, K-means++, and GOKA can reach up to 101 . 5%, 109 . 9%, and 79 . 8%, respectively. Moreover, the error rate between MGOKA and the global optimal solution is always less than 4%.

Wuhan University Journal of Natural SciencesVol. 29(6)
Shanghai University of Engineering Science (CN)
National Natural Science Foundation of China
Industry, innovation and infrastructure
Openalex Percentile: Top 71%
Software-Defined Networks and 5G
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.