K-means Assisted Simulated Annealing Algorithm for Controller Placement 


Vol. 50,  No. 5, pp. 773-780, May  2025
10.7840/kics.2025.50.5.773


PDF Full-Text
  Abstract

The multi-controller placement problem (MCPP) in software-defined networking is a complex optimization problem. This paper proposes the K-means Assisted Simulated Annealing Controller Placement (KASA-CP) algorithm, which combines k-means and simulated annealing to address MCPP efficiently. KASA-CP improves the computational efficiency of simulated annealing by using k-means for initial placement, ensuring effective operation in large-scale networks. Experimental results show that KASA-CP outperforms the basic simulated annealing algorithm in terms of execution time and average latency.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Related Articles
  Cite this article

[IEEE Style]

H. Kim, D. Ryoo, H. Choi, S. Lee, J. Kim, J. Park, H. Park, K. Kim, S. Ahn, S. Pack, "K-means Assisted Simulated Annealing Algorithm for Controller Placement," The Journal of Korean Institute of Communications and Information Sciences, vol. 50, no. 5, pp. 773-780, 2025. DOI: 10.7840/kics.2025.50.5.773.

[ACM Style]

Haeun Kim, Dongkyun Ryoo, Hongrok Choi, Sanghoon Lee, Junhyeong Kim, Jinho Park, Hyun Park, Kihun Kim, Sungjoon Ahn, and Sangheon Pack. 2025. K-means Assisted Simulated Annealing Algorithm for Controller Placement. The Journal of Korean Institute of Communications and Information Sciences, 50, 5, (2025), 773-780. DOI: 10.7840/kics.2025.50.5.773.

[KICS Style]

Haeun Kim, Dongkyun Ryoo, Hongrok Choi, Sanghoon Lee, Junhyeong Kim, Jinho Park, Hyun Park, Kihun Kim, Sungjoon Ahn, Sangheon Pack, "K-means Assisted Simulated Annealing Algorithm for Controller Placement," The Journal of Korean Institute of Communications and Information Sciences, vol. 50, no. 5, pp. 773-780, 5. 2025. (https://doi.org/10.7840/kics.2025.50.5.773)
Vol. 50, No. 5 Index