2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI) 2015
DOI: 10.1109/kbei.2015.7436121
|View full text |Cite
|
Sign up to set email alerts
|

Controller placement in software-defined WAN using multi objective genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
20
0
2

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 40 publications
(22 citation statements)
references
References 11 publications
0
20
0
2
Order By: Relevance
“…In 978-3-901882-98-2 © 2017 IFIP this way, similarly to the MOCO approach [7], the authors in [8], proposed to use a standard NSGA II genetic algorithm to deal with a three objective placement strategy, minimizing the latency between nodes and their respective controllers, minimizing the inter-controllers latency and minimizing the unbalance between clusters. However, the number of controllers is considered as a fixed parameter.…”
Section: Related Workmentioning
confidence: 99%
“…In 978-3-901882-98-2 © 2017 IFIP this way, similarly to the MOCO approach [7], the authors in [8], proposed to use a standard NSGA II genetic algorithm to deal with a three objective placement strategy, minimizing the latency between nodes and their respective controllers, minimizing the inter-controllers latency and minimizing the unbalance between clusters. However, the number of controllers is considered as a fixed parameter.…”
Section: Related Workmentioning
confidence: 99%
“…One way to solve an NP‐hard problem is to design efficient heuristic algorithms (such as particle swarm optimization (PSO), teacher learning‐based optimization (TLBO), Jaya, and Varna‐based optimization (VBO)) for CPP. Optimization‐based solutions for the CPP exist in the literature . However, the reliability of the controller placement has not been considered while minimizing total average latency.…”
Section: Introductionmentioning
confidence: 99%
“…CPP is an NP-hard problem. The papers [3,4] discuss CPP and provide heuristic based optimization solutions for it. Gao et al [4] introduced a PSO-based algorithm to solve this problem.…”
Section: Introductionmentioning
confidence: 99%