GLOBECOM 2017 - 2017 IEEE Global Communications Conference 2017
DOI: 10.1109/glocom.2017.8254748
|View full text |Cite
|
Sign up to set email alerts
|

Cluster Leader Election Problem for Distributed Controller Placement in SDN

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(9 citation statements)
references
References 11 publications
0
8
0
1
Order By: Relevance
“…The authors in [141, 161] estimate the number of controllers using clustering techniques. To make the solution scalable, researchers have proposed heuristic [61] and meta‐heuristic [119] solution strategies.…”
Section: Cpp Solution Methodsmentioning
confidence: 99%
“…The authors in [141, 161] estimate the number of controllers using clustering techniques. To make the solution scalable, researchers have proposed heuristic [61] and meta‐heuristic [119] solution strategies.…”
Section: Cpp Solution Methodsmentioning
confidence: 99%
“…In datacenters, Ksentini et al [37] takes the controller as a participant in the game and optimizes the distance between controllers through game theory; Zhang et al [27] transforms the CPP problem into the solution space pole by adding constraint parameters to cut the solution space of the original problem; Ishigaki gradually approaching a given target based on constraints of performance metrics. In WANs, Ishigaki et al [38] considers CPP as a weighted minimum set coverage problem and propose greedy algorithm to solve it, but ignore the limitation of bandwidth, which is solved in [39] 1) BARGAINING GAME Ksentini et al [37] presents the optimal controller placement SDN networks. The proposed solution aims to integrate three key objectives: minimizing latency, minimizing communication overhead between controllers and ensuring load balancing for optimal layout and controller count.…”
Section: Cc-avg Latencymentioning
confidence: 99%
“…Based on graph optimization theory, Ishigaki et al [38] considers the communication overhead between controllers and proposes the problem of minimizing the distance between controllers. The article considers this problem as a weighted minimum set coverage problem and proves that the problem is NP-hard.…”
Section: ) Greedy Algorithmmentioning
confidence: 99%
“…No primeiro caso, a promoção a líder será feita pelo GCC-Controlador que tomará como métrica a distância do candidato para coordenada do VANT-Controlador e qualidade do enlace de comunicação com GCC-Controlador [16]. No segundo caso, onde não há conectividade com o GCC-Controlador, as aeronaves deveram executar o processo de eleição de forma autônoma.…”
Section: Arquitetura Sd-fanetunclassified