TY - JOUR
T1 - A clustering approach to edge controller placement in software-defined networks with cost balancing
AU - Soleymanifar, Reza
AU - Srivastava, Amber
AU - Beck, Carolyn
AU - Salapaka, Srinivasa
N1 - Publisher Copyright:
Copyright © 2020 The Authors. This is an open access article under the CC BY-NC-ND license
PY - 2020
Y1 - 2020
N2 - In this work we introduce two novel maximum entropy based clustering algorithms to address the problem of Edge Controller Placement (ECP) in wireless edge networks. These networks lie at the core of the fifth generation (5G) wireless systems and beyond. Our algorithms, ECP-LL and ECP-LB, address the dominant leader-less and leader-based controller placement topologies and have linear computational complexity in terms of network size, number of clusters and dimensionality of data. Each algorithm places controllers close to edge node clusters and not far away from other controllers to maintain a reasonable balance between synchronization and delay costs. While the ECP problem can be expressed as a multi-objective mixed integer nonlinear program (MINLP), our algorithms outperform state of the art MINLP solver, BARON both in terms of accuracy and speed. Our proposed algorithms have the competitive edge of avoiding poor local minima through a Shannon entropy term in the clustering objective function. Most ECP algorithms are highly susceptible to poor local minima and greatly depend on initialization.
AB - In this work we introduce two novel maximum entropy based clustering algorithms to address the problem of Edge Controller Placement (ECP) in wireless edge networks. These networks lie at the core of the fifth generation (5G) wireless systems and beyond. Our algorithms, ECP-LL and ECP-LB, address the dominant leader-less and leader-based controller placement topologies and have linear computational complexity in terms of network size, number of clusters and dimensionality of data. Each algorithm places controllers close to edge node clusters and not far away from other controllers to maintain a reasonable balance between synchronization and delay costs. While the ECP problem can be expressed as a multi-objective mixed integer nonlinear program (MINLP), our algorithms outperform state of the art MINLP solver, BARON both in terms of accuracy and speed. Our proposed algorithms have the competitive edge of avoiding poor local minima through a Shannon entropy term in the clustering objective function. Most ECP algorithms are highly susceptible to poor local minima and greatly depend on initialization.
KW - 5G networks
KW - Clustering
KW - Deterministic annealing
KW - Edge controller placement
KW - Software-defined networks
KW - Wireless edge networks
UR - http://www.scopus.com/inward/record.url?scp=85105067748&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85105067748&partnerID=8YFLogxK
U2 - 10.1016/j.ifacol.2020.12.379
DO - 10.1016/j.ifacol.2020.12.379
M3 - Conference article
AN - SCOPUS:85105067748
SN - 2405-8963
VL - 53
SP - 2642
EP - 2647
JO - IFAC-PapersOnLine
JF - IFAC-PapersOnLine
IS - 2
T2 - 21st IFAC World Congress 2020
Y2 - 12 July 2020 through 17 July 2020
ER -