A K-means-based network partition algorithm for controller placement in software defined network
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
McKeown (2008) · doi:10.1145/1355734.1355746 · Cited by 8,513 · cited 1×
“OpenFlow [7], the most popular SDN-enabling communications protocol between control plane and data plane, initially assumed a single controller for the sake of simplicity.”
BackgroundKnight, S., Nguyen, H. X., Falkner, N., Bowden, R., & Roughan, M. (2011) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2011.111002 · Cited by 1,739 · cited 1×
“The topology of Chinanet is obtained from Topology Zoo [25] which consists of hundreds of network topologies from network providers.”
MethodA comparative study of efficient initialization methods for the k-means clustering algorithm
Celebi, M. E., Kingravi, H. A., & Vela, P. A. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.07.021 · Cited by 1,214 · cited 1×
“The centroid initialization method plays a significant role for the K-means algorithm and many solutions have been proposed [21].”
MethodOnix: a distributed control platform for large-scale production networks
Koponen, T., Casado, M., Gude, N. S., Stribling, J., Poutievski, L., Zhu, M., Ramanathan, R., Iwata, Y., Inoue, H., Hama, T., et al. (2010) · doi:10.5555/1924943.1924968 · Cited by 1,212
HyperFlow: a distributed control plane for OpenFlow
Tootoonchian, A., & Ganjali, Y. (2010) · Workshop on Research on Enterprise Networking · Cited by 1,157
The controller placement problem
Heller, B., Sherwood, R., & McKeown, N. (2012) · Proceedings of the first workshop on Hot topics in software defined networks · doi:10.1145/2342441.2342444 · Cited by 869
Kandoo: a framework for efficient and scalable offloading of control applications
Hassas Yeganeh, S., & Ganjali, Y. (2012) · Proceedings of the first workshop on Hot topics in software defined networks · doi:10.1145/2342441.2342446 · Cited by 641 · cited 2×
“This motivates the studies on multi-controller placement, e.g., Onix [8], DevoFlow [9], Kandoo [10], HyperFlow [11] and Devolved controllers [12].”
BackgroundDevoFlow: scaling flow management for high-performance networks
Curtis, A. R., Mogul, J. C., Tourrilhes, J., Yalagandula, P., Sharma, P., & Banerjee, S. (2011) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2043164.2018466 · Cited by 543
A new initialization technique for generalized Lloyd iteration
Katsavounidis, I. X., Kuo, C. ‐. J., & Zhang, Z. (1994) · IEEE Signal Processing Letters · doi:10.1109/97.329844 · Cited by 372 · cited 1×
“The initialization method proposed by Katsavounidis et al [22] can achieve preferable local minimum, so we adopt the idea of [22] and propose an optimized Kmeans.”
MethodOn the Capacitated Controller Placement Problem in Software Defined Networks
Yao, G., Bi, J., Li, Y., & Guo, L. (2014) · IEEE Communications Letters · doi:10.1109/lcomm.2014.2332341 · Cited by 366 · cited 4×
“[5] moved forward by considering both the latency and the controller capacity.”
BackgroundInfluentialOptimal Model for the Controller Placement Problem in Software Defined Networks
Sallahi, A., & St-Hilaire, M. (2015) · IEEE Communications Letters · doi:10.1109/lcomm.2014.2371014 · Cited by 234 · cited 2×
“The controller placement problem is known as an NP-Hard [4] [5] and time consuming [6].”
BackgroundSurvivor: An enhanced controller placement strategy for improving SDN survivability
Muller, L. F., Oliveira, R. R., Luizelli, M. C., Gaspary, L. P., & Barcellos, M. P. (2014) · 2014 IEEE Global Communications Conference · doi:10.1109/glocom.2014.7037087 · Cited by 189 · cited 1×
“The general goal of [16] was to maximize connectivity between forwarding devices and controllers instances.”
BackgroundOn the controller placement for designing a distributed SDN control layer
Jimenez, Y., Cervello-Pastor, C., & Garcia, A. J. (2014) · 2014 IFIP Networking Conference · doi:10.1109/ifipnetworking.2014.6857117 · Cited by 162 · cited 1×
“In the most of existing works, K-center is widely used [4] [17] [18] to place controllers into the entire network.”
MethodOn the placement of controllers in software-defined networks
Hu, Y., Wang, W., Gong, X., Que, X., & Cheng, S. (2012) · 中国邮电高校学报:英文版 · doi:10.1016/s1005-8885(11)60438-x · Cited by 145 · cited 1×
“further [15] studied the placement problem for reliability and proposed a greedy algorithm for efficient placement with good reliability.”
BackgroundOn Resilience of Split-Architecture Networks
Zhang, Y., Beheshti, N., & Tatipamula, M. (2011) · 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011 · doi:10.1109/glocom.2011.6134496 · Cited by 123 · cited 1×
“[14] initiated the study of controller placement in terms of resilience and proposed a min-cut based algorithm to minimize the likelihood of loss of connectivity between the controller and the switch.”
BackgroundHybrid Human Skin Detection Using Neural Network and K-Means Clustering Technique
Al-Mohair, H. K., Mohamad–Saleh, J., & Suandi, S. A. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.04.046 · Cited by 86 · cited 2×
“K-means is a straightforward and effective clustering method which is widely used in the partition problems [19], [20].”
MethodUse of devolved controllers in data center networks
Tam, A. S.-W., Xi, K., & Chao, H. J. (2011) · IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infcomw.2011.5928883 · Cited by 70 · cited 1×
“, Onix [8], DevoFlow [9], Kandoo [10], HyperFlow [11] and Devolved controllers [12].”
BackgroundAn effective approach to alleviating the challenges of transmission control protocol
Wang, G., Ren, Y., & Li, J. (2014) · IET Communications · doi:10.1049/iet-com.2013.0154 · Cited by 38 · cited 1×
“Among these performance metrics, latency plays a critical role in networking performance [1], [2], [3] as it heavily affects quality of service in growing real-time applications.”
BackgroundSelf-citationAppTCP: The design and evaluation of application-based TCP for e-VLBI in fast long distance networks
Wang, G., Wu, Y., Dou, K., Ren, Y., & Li, J. (2013) · Future Generation Computer Systems · doi:10.1016/j.future.2013.12.016 · Cited by 37 · cited 1×
“Among these performance metrics, latency plays a critical role in networking performance [1], [2], [3] as it heavily affects quality of service in growing real-time applications.”
BackgroundSelf-citationDefining a network management architecture
Jiménez, Y., Cervelló-Pastor, C., & Garcia, A. J. (2013) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2013.6733647 · Cited by 19 · cited 1×
“In the most of existing works, K-center is widely used [4] [17] [18] to place controllers into the entire network.”
MethodParallelization of the Algorithm K-means Applied in Image Segmentation
Lopez, C., Perez, L. J. F., & Calla, L. A. R. (2014) · International Journal of Computer Applications · doi:10.5120/15441-4051 · Cited by 5 · cited 2×
“K-means is a straightforward and effective clustering method which is widely used in the partition problems [19], [20].”
Method
Cited by
A Survey on Controller Placement in SDN
Das, T., Sridharan, V., & Gurusamy, M. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2935453 · Cited by 215
“For example, a CPP objective such as control latency has been approached using methodologies such as greedy algorithms [45], [55], k-means [38], [46], [124],”
BackgroundMethodInfluentialSoftware Defined Networking for Improved Wireless Sensor Network Management: A Survey
Ndiaye, M., Hancke, G., & Abu-Mahfouz, A. (2017) · Sensors · doi:10.3390/s17051031 · Cited by 207
“[142] for example, have proposed a K-means algorithm to optimize controller placement thus minimizing network latency.”
Method
Metadata
- Authors
- Wang, G., Zhao, Y., Huang, J., Duan, Q., & Li, J.
- Venue
- 2016 IEEE International Conference on Communications (ICC)
- Publisher
- IEEE
- Published
- 2016-05
- Pages
- 1-6
- ISSN
- 1550-3607 (ISSN-L)
- OpenAlex
- W2482438884
- Cited by
- 168
- References
- 21
- FWCI
- 16.04
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.