Evolutionary Algorithms in Software Defined Networks: Techniques, Applications, and Issues

doi:10.3969/j.issn.1673-5188.2017.03.004

ZTE Communications ›› 2017, Vol. 15 ›› Issue (3): 20-36.DOI: 10.3969/j.issn.1673-5188.2017.03.004

收稿日期:2017-06-08 出版日期:2017-08-25 发布日期:2019-12-24

Evolutionary Algorithms in Software Defined Networks: Techniques, Applications, and Issues

LIAO Lingxia¹, Victor C. M. Leung¹, LAI Chin-Feng²

1. Department of Electrical and Computer Engineering, University of British Columbia, Vancouver BC V6T 1Z4, Canada
2. Department of Engineering Science, National Cheng Kung University, Tainan, China

Received:2017-06-08 Online:2017-08-25 Published:2019-12-24
About author:LIAO Lingxia (liaolx@ece.ubc.ca) is currently a Ph.D. candidate of Department of Electrical and Computer Engineering of the University of British Columbia (UBC), Canada. She had a bachelor degree from Tsinghua University, China and a master degree from UBC. She was a science researcher in Computer Science Department of UBC, and the R&D director and the general manager of high performance computing of Inspur Group, China. She had over ten years’ experience working in computer and network industry. Her current research interests are E-hearthcare, cloud computing, software defined networking, network function virtualization, network monitoring and optimization, and next generation network. She has contributed multiple technical papers and book chapters in these areas.|Victor C.M. Leung (vleung@ece.ubc.ca) is a professor of Electrical and Computer Engineering and holder of the TELUS Mobility Research Chair at the University of British Columbia (UBC). He has contributed some 1000 technical papers, 37 book chapters and 12 book titles in the areas of wireless networks and mobile systems. He was a Distinguished Lecturer of the IEEE Communications Society. He is serving/has served on the editorial boards of the IEEE Journal on Selected Areas in Communications, IEEE Access, IEEE Transactions on Wireless Communications, IEEE Transactions on Computers, IEEE Transactions on Vehicular Technology, IEEE Wireless Communications Letters and several other journals, and has contributed to the organizing and technical program committees of numerous conferences. Dr. Leung was a winner of the 2011 UBC Killam Research Prize, the IEEE Vancouver Section Centennial Award, the 2017 Canadian Award for Telecommunications Research. He co-authored a paper that won the 2017 IEEE Communications Society Fred W. Ellersick Prize.|LAI Chin-Feng (cinfon@ieee.org) is an associate professor at Department of Engineering Science, National Cheng Kung University, China and Department of Computer Science and Information Engineering, National Chung Cheng University, China since 2016. He received the Ph.D. degree in Department of Engineering Science from National Cheng Kung University, China in 2008. He received Best Paper Awards from IEEE 17th CCSE, 2014 International Conference on Cloud Computing, IEEE 10th EUC, and IEEE 12th CIT. He has more than 100 paper publications and 4 papers selected to TOP 1% most cited articles by Essential Science Indicators (ESI). He serves as an associate editor-in-chief, editor, or associate editor for many journals and is TPC Co-Chair for many conferences during 2012-2017. His research focuses on Internet of Things, body sensor networks, E-healthcare, mobile cloud computing, cloud-assisted multimedia network, embedded systems, etc. He has been an IEEE senior member since 2014.

摘要/Abstract

Abstract:

A software defined networking (SDN) system has a logically centralized control plane that maintains a global network view and enables network-wide management, optimization, and innovation. Network-wide management and optimization problems are typically very complex with a huge solution space, large number of variables, and multiple objectives. Heuristic algorithms can solve these problems in an acceptable time but are usually limited to some particular problem circumstances. On the other hand, evolutionary algorithms (EAs), which are general stochastic algorithms inspired by the natural biological evolution and/or social behavior of species, can theoretically be used to solve any complex optimization problems including those found in SDNs. This paper reviews four types of EAs that are widely applied in current SDNs: Genetic Algorithms (GAs), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and Simulated Annealing (SA) by discussing their techniques, summarizing their representative applications, and highlighting their issues and future works. To the best of our knowledge, our work is the first that compares the techniques and categorizes the applications of these four EAs in SDNs.

Key words: SDN, evolutionary algorithms, Genetic Algorithms, Particle Swarm Optimization, Ant Colony Optimization, Simulated Annealing

. [J]. ZTE Communications, 2017, 15(3): 20-36.

LIAO Lingxia, Victor C. M. Leung, LAI Chin-Feng. Evolutionary Algorithms in Software Defined Networks: Techniques, Applications, and Issues[J]. ZTE Communications, 2017, 15(3): 20-36.

图/表 9

参考文献 98

[1]	ONF, “Software-defined networking: the new norm for networks, ” Open Networking Foundation white paper, Apr. 13, 2012, retrieved Aug. 22, 2014.
[2]	OpenFlow Switch Consortium. ( 2009). OpenFlow Switch Specification Version 1.0. 0 [Online]. Available:
[3]	Dan Simon , Evolutionary Optimization Algorithms . Hoboken, USA: John Wiley & Sons, 2013.
[4]	Daniel W. Dyer, Evolutionary computation in java, a practical guide to the watchmaker framework [Online]. Available:
[5]	U. Mehboob, J. Qadir, S. Ali, A. Vasilakos , “Genetic algorithms in wireless networking: techniques, applications, and issues,” Soft Computing, vol. 20, no. 6, pp. 2467-2501, 2016. DOI URL
[6]	B. A. A. Nunes, M. Mendonca, X. N. Nguyen, K. Obraczka and T. Turletti , “A survey of software-defined networking: past, present, and future of programmable networks,” IEEE Communications Surveys & Tutorials, vol. 16, no. 3, pp. 1617-1634, 2014. doi: 10.1109/SURV.2014.012214.00180. DOI URL PMID
[7]	D. Kreutz, F. M. Ramos, P. E. Verissimo , et al., “Software-defined networking: A comprehensive survey,” Proceedings of the IEEE, vol. 103, no. 1, pp. 14-76, 2015. doi: 10.1109/JPROC.2014.2371999. DOI URL
[8]	T. G Robertazzi , “Software-defined networking,” in Introduction to Computer Networking. New York City, USA: Springer, 2017, pp. 81-87.
[9]	M. Latah and L. Toker , “Application of artificial intelligence to software defined networking: a survey,” Indian Journal of Science and Technology, vol. 9, no. 44, 2016. doi: 10.17485/ijst/2016/v9i44/89812.
[10]	E. Elbeltagi, T. Hegazy, D. Grierson , “Comparison among five evolutionary-based optimization algorithms,” Advanced Engineering Informatics, vol. 19, no. 1, pp. 43-53, 2005. doi: 10.1016/j.aei.2005.01.004. DOI URL
[11]	M. Crepinšek, S.-H. Liu and M. Mernik , “Exploration and exploitation in evolutionary algorithms: a survey,” ACM Computing Surveys (CSUR), vol. 45, no. 3, article no. 35, 2013. doi: 10.1145/2480741.2480752.
[12]	C. von Lücken, B. Barán and C. Brizuela , “A survey on multi-objective evolutionary algorithms for many-objective problems,” Computational Optimization and Applications, vol. 58, no. 3, pp. 707-756, 2014. doi: 10.1007/s10589-014-9644-1. DOI URL
[13]	A. Mukhopadhyay, U. Maulik, S. Bandyopadhyay , et al., “A survey of multiobjective evolutionary algorithms for data mining: part I,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 1, pp. 4-19, 2014. doi: 10.1109/TEVC.2013.2290086. DOI URL
[14]	H. R. Cheshmehgaz, H. Haron, A. Sharifi , “The review of multiple evolutionary searches and multi-objective evolutionary algorithms,” Artificial Intelligence Review, vol. 43, no. 3, pp. 311-343, 2015. doi: 10.1007/s10462-012-9378-3. DOI URL
[15]	P. Larrañaga, H. Karshenas, C. Bielza , et al., “A review on evolutionary algorithms in Bayesian network learning and inference tasks,” Information Sciences, vol. 233, pp. 109-125, 2013. doi: 10.1016/j.ins.2012.12.051. DOI URL
[16]	Y. J. Gong, W. N. Chen, Z. H. Zhan , el al., “Distributed evolutionary algorithms and their models: a survey of the state-of-the-art,” Applied Soft Computing, vol. 34 , pp. 286-300, 2015. doi: 10.1016/j.asoc.2015.04.061. DOI URL
[17]	R. C. Purshouse, K. Deb, M. M. Mansor , et al., “A review of hybrid evolutionary multiple criteria decision making methods,” in IEEE Congress on Evolutionary Computation (CEC), Beijing, China, 2014. doi: 10.1109/CEC.2014.6900368.
[18]	D. J. Munk, G. A. Vio, G. P. Steven , “Topology and shape optimization methods using evolutionary algorithms: a review,” Structural and Multidisciplinary Optimization, vol. 52, no. 3, pp. 613-631, 2015. doi: 10.1007/s00158-015-1261-9. DOI URL
[19]	B. Kazimipour, X. Li, A. K. Qin , “A review of population initialization techniques for evolutionary algorithms,” in IEEE Congress on Evolutionary Computation (CEC), Beijing, China, 2014. doi: 10.1109/CEC.2014.6900618.
[20]	G. Karafotias, M. Hoogendoorn, Á. E. Eiben , “Parameter control in evolutionary algorithms: trends and challenges,” IEEE Transactions on Evolutionary Computation, vol. 19, no. 2, pp. 167-187, 2015. doi: 10.1109/TEVC.2014.2308294. DOI URL
[21]	Q. Yan, F. R. Yu, Q. Gong , et al., “Software-defined networking (SDN) and distributed denial of service (DDoS) attacks in cloud computing environments: A survey, some research issues, and challenges,” IEEE Communications Surveys & Tutorials, vol. 18, no. 1, pp. 602-622, 2016. doi: 10.1109/COMST.2015.2487361. DOI URL PMID
[22]	S. Scott-Hayward, S. Natarajan, S. Sezer , “A survey of security in software defined networks,” IEEE Communications Surveys & Tutorials,18. 1, pp. 623-654, 2016. doi: 10.1109/COMST.2015.2453114. DOI URL PMID
[23]	H. Farhady, H. Y. Lee, A. Nakao , “Software-defined networking: a survey,” Computer Networks, vol. 81, pp. 79-95, 2015. doi: 10.1016/j.comnet.2015.02.014. DOI URL
[24]	A. Blenk, A. Basta, M. Reisslein , et al., “Survey on network virtualization hypervisors for software defined networking,” IEEE Communications Surveys & Tutorials, vol. 18, no. 1, pp. 655-685, 2016. doi: 10.1109/COMST.2015.2489183. DOI URL PMID
[25]	R. Jain and S. Paul , “Network virtualization and software defined networking for cloud computing: a survey,” IEEE Communications Magazine, vol. 51, no. 11, pp. 24-31, 2013. doi: 10.1109/COMST.2015.2489183.
[26]	X. N. Nguyen, D. Saucez, C. Barakat , et al., “Rules placement problem in openflow networks: a survey,” IEEE Communications Surveys & Tutorials, vol. 18, no. 2, pp. 1273-1286, 2016. doi: 10.1109/COMST.2015.2506984. DOI URL PMID
[27]	N. A. Jagadeesan and B. Krishnamachari , “Software-defined networking paradigms in wireless networks: a survey,” ACM Computing Surveys (CSUR), vol. 47, no. 2, article no. 27, 2015. doi: 10.1145/2655690.
[28]	T. Chen, M. Matinmikko, X. Chen , et al., “Software defined mobile networks: concept, survey, and research directions,” IEEE Communications Magazine , vol. 53, no. 11, pp. 126-133, 2015. doi: 10.1109/MCOM.2015.7321981.
[29]	D. Gante, A, M. Aslan and A. Matrawy , “Smart wireless sensor network management based on software-defined networking,” in 27th Biennial Symposium on Communications (QBSC), Kingston, Canada, 2014. doi: 10.1109/QBSC.2014.6841187.
[30]	Y. Jararweh, M. Al-Ayyoub, E. Benkhelifa , et al., “Software defined cloud: survey, system and evaluation,” Future Generation Computer Systems, vol. 58, pp. 56-74, 2016. doi: 10.1016/j.future.2015.10.015. DOI URL
[31]	J. H. Holland , Adaptation in Natural and A rtificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Cambridge, USA: MIT Press, 1992.
[32]	C. M. Fonseca and P. J. Fleming , “Genetic algorithms for multiobjective optimization: formulation, discussion and generalization,” in Proc. Fifth International Conference on Genetic Algorithms, San Mateo, California, pp. 416-423, 1993.
[33]	N. Srinivas and K. Deb , “Multiobjective optimization using nondominated sorting in genetic algorithms,” Evolutionary Computation, vol. 2, no. 3, pp. 221-248, 1994. DOI URL
[34]	K. Deb, S. Agrawal, A. Pratab , et al., “A fast elitist nondominated sorting genetic algorithm for multi-objective optimization: NSGA-II,” in Proc. Parallel Problem Solving from Nature VI Conference, Paris, France, pp. 849-858, 2000.
[35]	K. Deb, A. Pratap, S. Agarwal , et al., “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182-197, 2002. doi: 10.1109/4235.996017. DOI URL
[36]	J. Kennedy and R. Eberhart, “Particle swarm optimization, ” in IEEE International Conference on Neural Networks, Perth, Australia, 1995,pp, 1942-1948.
[37]	M. R. Sierra and C. A. Coello Coello , “Improving PSO-Based multiobjective optimization using crowding, mutation and ∈-dominance,” in Third International Conference on Evolutionary Multi-Criterion Optimization., Guanajuato, Mexico, 2005, pp. 505-519.
[38]	S. Lalwani, S. Singhal, R. Kumar , et al., “A comprehensive survey: applications of multi-objective particle swarm optimization (MOPSO) algorithm,” Transactions on Combinatorics, vol. 2, no. 1, pp. 39-101, 2013.
[39]	A. Colorni, M. Dorigo, V. Maniezzo , “Distributed optimization by ant colonies,” in Toward a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life. Cambridge, USA: MIT Press, 1992.
[40]	M. Dorigo, V. Maniezzo, A. Colorni , “The ant system: an autocatalytic optimizing process,” Politecnico di Milano, Tech. Rep. 91-016 revised, 1991.
[41]	M. Dorigo , “Optimization, learning and natural algorithms,” Ph. D. Thesis, Politecnico di Milano, Italy, 1992.
[42]	L. M. Gambardella and M. Dorigo , “Solving symmetric and asymmetric TSPs by ant colonies,” in Proc. IEEE International Conference on Evolutionary Computation, Nagoya, Japan, 1996. doi: 10.1109/ICEC.1996.542672.
[43]	M. Dorigo and L. M. Gambardella , “Ant-Q: a reinforcement learning approach to the traveling salesman problem,” in Proc. 12th International Conference on Machine Learning, Morgan Kaufmann, USA, 2016, pp. 252-260.
[44]	M. Dorigo and L. M. Gambardella , “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53-66, 1997. doi: 10.1109/4235.585892. DOI URL
[45]	B. Bullnheimer, R. F. Hart, C. Strauss , “A new rank based version of the ant system—a computational study,” Central European Journal for Operations Research and Economics, vol. 7, no. 1, pp. 25-38,1997.
[46]	T. Stutzle and H.H. Hoos , “Max-Min ant system,” Future Generation Computer System, vol. 16, pp. 889-914, 2000 DOI URL
[47]	M. Dorigo and T. Stutzle , Ant Colony Optimization. Cambridge, USA: MIT Press, 2004
[48]	D. Angus and C. Woodward , “Multiple objective ant colony optimization,” Swarm Intelligence, vol. 3, no. 1, pp. 69-85, 2009. doi: 10.1007/s11721-008-0022-4. DOI URL
[49]	S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi , “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671-680, 1983. DOI URL PMID
[50]	P. Czyzzak and A. Jaszkiewicz , “Pareto simulated annealing - A metaheuristic technique for multiple-objective combinatorial optimization,” Journal of Multi-Criteria Decision Analysis, vol. 7, no. 1, pp. 34-47, 1998 DOI URL
[51]	P. Serafini , “Simulated annealing for multiple objective optimization problems,” in Proc. 10th International Conference on Multiple Criteria Decision Making: Expand and Enrich the Domains of Thinking and Application, Berlin, Germany, vol. 1, pp. 283-292, 1994.
[52]	M. P. Hansen , “Generating a diversity of good solutions to a practical combinatorial problem using vectorized simulated annealing,” Institute of Mathematical Modelling, Technical University of Denmark, Tech. Rep., 1997.
[53]	T. Ray, R. Gokarn, O. Sha , “A global optimization model for ship design,” Computers in Industry, vol. 26, no. 2, pp. 175-192, 1995. doi: 10.1016/0166-3615(95)00003-M. DOI URL
[54]	A. J. Ruiz-Torres, R. Gokarn, O. Sha, E.E. Enscore and R. R. Barton , “Simulated annealing heuristics for the average flow-time and the number of tardy jobs bicriteria identical parallel machine problem,” Computers and Industrial Engineering, vol. 33, no. 1- 2, pp. 257-260, 1997. doi: 10.1016/S0360-8352(97)00087-. DOI URL
[55]	J. F. Solís, H. J. Fraire, J. C. Soto-Monterrubio , et al., “Multi-objective simulated annealing algorithms for general problems,” in Handbook of Research on Military, Aeronautical, and Maritime Logistics and Operations. Hershey, USA: IGI Global, 2016, pp. 280-292.
[56]	E. Aarts, J. Korst, W. Michiels , “Simulated annealing,” in Search Methodologies, E. K. Burke and J. Korst, Ed. Boston, USA: Springer, 2014, pp. 265-285.
[57]	Y. Liu, Y. Pan, M. Wang , et al., “The multi-path routing problem in the software defined network,” in 11th International Conference on Natural Computation (ICNC), Zhangjiajie, China, 2015. doi: 10.1109/ICNC.2015.7377999.
[58]	Project Floodlight. ( 2017). Floodlight [Online]. Available:
[59]	B. Lantz, B. Heller, N. McKeown , “A network in a laptop: rapid prototyping for software-defined networks, ” in Proc. 9th ACM SIGCOMM Workshop on Hot Topics in Networks, Monterey, USA, 2010, Article No. 19. doi: 10.1145/1868447.1868466.
[60]	H. Ren, X. Li, J. Geng , et al., “A SDN-based dynamic traffic scheduling algorithm,” in IEEE International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), Chengdu, China, 2016. doi: 10.1109/CyberC.2016.103.
[61]	J. Dugan . ( 2017). IPerf—The Network Bandwidth Measurement Tool [Online]. Available:
[62]	R. Maniu and L. A. Dumitru , “Exploring the possibilities of a self-regulating SDN controller,” Scientific Bulletin “Mircea cel Batran” Naval Academy, vol. 18, no. 1 , pp. 58-61, 2015.
[63]	K. Kikuta, E. Oki, N. Yamanaka , et al., “Effective parallel algorithm for GPGPU-accelerated explicit routing optimization,” in IEEE Global Communications Conference (GLOBECOM), San Diego, USA, 2015, pp. 1-6.
[64]	A, D. Stefano, G. Cammarata, G. Morana , et al., “A4SDN-adaptive alienated ant algorithm for software-defined networking,” in 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), Krakow, Poland, 2015.
[65]	Y. L. Wang, K. J. Yuan, W. Fang , et al., “Research of a SDN traffic scheduling technology based on ant colony algorithm,” in 2016 International Conference on Information Engineering and Communications Technology. Lancaster, USA: DEStech Publications, Inc., 2016. doi: 10.12783/dtetr/iect2016/3754.
[66]	R. Zhu, H. Wang, Y. Gao , et al., “Energy saving and load balancing for SDN based on multi-objective particle swarm optimization,” in 15th International Conference on Algorithms and Architectures for Parallel Processing, Zhangjiajie, China, 2015, pp. 176-189. doi: 10.1007/978-3-319-27137-8_14.
[67]	S. Subbiah and V. Perumal , “Energy-aware network resource allocation in SDN,” in IEEE International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET), Chennai, India, 2016. doi: 10.1109/WiSPNET.2016.7566506.
[68]	M. K. Awad, M. EI-Shafei, T. Dimitriou , et al., “Power-efficient routing for SDN with discrete link rates and size-limited flow tables: a tree-based particle swarm optimization approach,” International Journal of Network Management , vol. 27, no. 5, 2017. doi: 10.1002/nem.1972.
[69]	O. Dobrijevic, M. Santl, M. Matijasevic , “Ant colony optimization for QoE-centric flow routing in software-defined networks,” in 11th IEEE International Conference on Network and Service Management (CNSM), Barcelona, Spain, 2015. doi: 10.1109/CNSM.2015.7367371.
[70]	Y. Tang, W.Z. Wang, S. N. Dong , et al., “An Improved Ant Colony Algorithm for Routing in Software Defined Networking,” Journal of Computational and Theoretical Nanoscience, vol. 13, no. 1, pp. 438-442, 2016. doi: 10.1166/jctn.2016.4824. DOI URL
[71]	R. Balaguer. ( 2017). Flow embedding algorithms for software defined audio networks [Online]. Available:
[72]	O. Dobrijevic, M. Santl, M. Matijasevic , “Ant colony optimization for QoE-centric flow routing in software-defined networks,” in 11th International Conference on Network and Service Management (CNSM), Barcelona, Spain, 2015, pp. 274-278.
[73]	S. B. Kang and G. I. Kwon , “Load balancing of software-defined network controller using genetic algorithm,” Contemporary Engineering Sciences, vol. 9, no. 18, pp. 881-888, 2016. doi: 10.12988/ces.2016.66105. DOI URL
[74]	L. D. Chou, Y. T. Yang, Y. M. Hong , et al., “A genetic-based load balancing algorithm in openflow network,” in Advanced Technologies, Embedded and Multimedia for Human-Centric Computing, Y.-M. Huang, H.-C. Chao, D.-J. Deng, and J. H. Park Ed. Dordrecht, Netherlands: Springer, 2014, pp. 411-417.
[75]	A. M. R. Ruelas and C. E. Rothenberg . ( 2015). Implementation of neural switch using OpenFlow as load balancing method in data center [Online]. Available:
[76]	S. Sathyanarayana and M. Moh , “Joint route-server load balancing in software defined networks using ant colony optimization,” in IEEE International Conference on High Performance Computing & Simulation (HPCS), Innsbruck, Austria, 2016. doi: 10.1109/HPCSim.2016.7568330. DOI URL PMID
[77]	W. Lin and L. Zhang , “The load balancing research of SDN based on ant colony algorithm with job classification,” in 2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016), Dalian, China, 2016.
[78]	B. Heller, R. Sherwood, N. McKeown , “The controller placement problem,” in Proc. 1st Workshop on Hot Topics in Software Defined Networks, Helsinki, Finland, 2012, pp. 7-12. doi: 10.1145/2342441.2342444.
[79]	S. Lange, S. Gebert, T. Zinner , et al., “Heuristic approaches to the controller placement problem in large scale SDN networks,” IEEE Transactions on Network and Service Management, vol. 12, no. 1, pp. 4-17, 2015. doi: 10.1109/TNSM.2015.2402432. DOI URL
[80]	J. M. Sanner, M. Ouzzif, Y. Hadjadj-Aoul , et al. ( 2016, Nov.). Evolutionary algorithms for optimized SDN controllers & NVFs’ placement in SDN networks [Online]. Available: DOI URL PMID
[81]	A. Jalili, V. Ahmadi, M. Keshtgari , et al., “Controller placement in software-defined WAN using multi objective genetic algorithm,” in 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI), Tehran, Iran, 2015. doi: 10.1109/KBEI.2015.7436121.
[82]	V. Ahmadi, A. Jalili, S. M. Khorramizadeh , et al., “A hybrid NSGA-II for solving multiobjective controller placement in SDN,” in 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI), Tehran, Iran, 2015. doi: 10.1109/KBEI.2015.7436122.
[83]	C. Gao, H. Wang, F. Zhu , et al., “A particle swarm optimization algorithm for controller placement problem in software defined network,” in 15th International Conference on Algorithms and Architectures for Parallel Processing, Zhangjiajie, China, 2015, pp. 44-54. doi: https://doi.org/10.1007/978-3-319-27137-8_4.
[84]	S. Liu, H. Wang, S. Yi , et al., “NCPSO: a solution of the controller placement problem in software defined networks,” in 15th International Conference on Algorithms and Architectures for Parallel Processing, Zhangjiajie, China, 2015, pp. 213-225. doi: https://doi.org/10.1007/978-3-319-27137-8_17.
[85]	J. Ashraf and S. Latif , “Handling intrusion and DDoS attacks in software defined networks using machine learning techniques,” in National Software Engineering Conference (NSEC), Rawalpindi, Pakistan, 2014. doi: 10.1109/NSEC.2014.6998241.
[86]	X. Li, D. Yuan, H. Hu , et al., “DDoS detection in SDN switches using support vector machine classifier,” in 2015 Joint International Mechanical, Electronic and Information Technology Conference (JIMET-15), Chongqing, China, 2015.
[87]	F. Li , “Application of particle swarm BP neural network in DDoS attack detection,”Microcomputer & Its Applications, no. 3, 2014. doi: 10.3969/j.issn.1674-7720.2014.03.016. DOI URL PMID
[88]	H. H. Chen and S. K. Huang , “LDDoS attack detection by using ant colony optimization algorithms,” Journal of Information Science & Engineering, vol. 32, no. 4, pp. 995-1020, 2016. DOI URL PMID
[89]	J. Liu, H. Zhang, Z. Guo , “A defense mechanism of random routing mutation in SDN,” IEICE Transactions on Information and Systems, vol. 100, no. 5, pp. 1046-1054, 2017. doi: 10.1587/transinf.2016EDP7377.
[90]	A. A. Ojugo, A.O. Eboka, O.E. Okonta , et al, “Genetic algorithm rule-based intrusion detection system (GAIDS),” Journal of Emerging Trends in Computing and Information Sciences, vol. 3, no. 8, pp. 1182-1194, Aug. 2012
[91]	J. L. Zhao, J. F. Zhao, J. J. Li , “Intrusion detection based on clustering genetic algorithm,” in International Conference on Machine Learning and Cybernetics, Guangzhou, China, pp. 3911-3914, 2005. doi: 10.1109/ICMLC.2005.1527621.
[92]	M. Bouet, J. Leguay, V. Conan , “Cost-based placement of virtualized deep packet inspection functions in SDN,” in IEEE Military Communications Conference (MILCOM 2013), San Diego, USA, 2013. doi: 10.1109/MILCOM.2013.172.
[93]	P. Murukan, D. Jamaluddine, S. Kolhapure , et al. ( 2016, Feb.). A cost-based placement algorithm for multiple virtual security appliances in cloud using SDN: MO-UFLP (multi-ordered uncapacitated facility location problem) [Online]. Available:
[94]	K. Li, J. Bao, Z. Lu , et al., “A PSO-based virtual SDN customization for multi-tenant cloud services,” in Proc. 11th International Conference on Ubiquitous Information Management and Communication, Beppu, Japan, Article No. 91, 2017. doi: 10.1145/3022227.3022317.
[95]	X. Yao, H. Wang, C. Gao , et al., “Maximizing network utilization for SDN based on particle swarm optimization,” in 28th International Conference on Tools with Artificial Intelligence (ICTAI), San Jose, USA, 2016. doi: 10.1109/ICTAI.2016.0142.
[96]	C. Gao, H. Wang, L. Zhai , et al., “Optimizing routing rules space through traffic engineering based on ant colony algorithm in software defined network,” in 28th International Conference on Tools with Artificial Intelligence (ICTAI), San Jose, USA, 2016. doi: 10.1109/ICTAI.2016.0026.
[97]	S. Yi, H. Wang, X. Yao , et al., “Maximizing network utilization for SDN based on WiseAnt colony optimization,” in IEEE 18th International Conference on High Performance Computing and Communications; IEEE 14th International Conference on Smart City; IEEE 2nd International Conference on Data Science and Systems (HPCC/SmartCity/DSS), Sydney, Australia, 2016. doi: 10.1109/HPCC-SmartCity-DSS.2016.0137.
[98]	Y. Guo, Z. Wang, X. Yin , et al., “Incremental deployment for traffic engineering in hybrid SDN network,” 34th International Performance Computing and Communications Conference (IPCCC), Nanjing, China, 2015. doi: 10.1109/PCCC.2015.7410320.

Process	Mechanisms	Descriptions
Initialization	Binary encoding Value encoding Permutation encoding Tree encoding	A solution is a bit string with each element as 0 or 1 A solution is a string with elements integers, real numbers, characters, or objects A solution is a sequence of number A chromosome is a tree form of objects
Selection	Relative tournament Routlette wheel Relative pooling tournament Elitism	Two members are randomly chosen, and the parent is the one with higher fitness The probability an individual to be chosen as a parent is depended on their fitness Populations are thrown into a competition, and the winners are the parents Populations with the higher fitness from all the populations generated so far from the parent set
Crossover	One-point Two-point Uniform Cut and spice Ordered chromosome	Randomly generate a crossover point Randomly generate two crossover points Use a fixed mixing ratio between two parents Allow each parent to have its own choice in deciding crossover point Switch the position of genes
Mutation	Bit-string Flip bit Boundary Gaussian Uniform	Randomly flip the value of genes Flip the value of selective genes Replace the value of a gene with the upper or lower bound of the value Add a unit Gaussian distributed random value to the selected chromosome Replace the value of a selective gene with a uniform random value within the user-specified bounds

Process	Mechanisms	Descriptions
Initialization	Binary encoding Value encoding Permutation encoding Tree encoding	A solution is a bit string with each element as 0 or 1 A solution is a string with elements integers, real numbers, characters, or objects A solution is a sequence of number A chromosome is a tree form of objects
Selection	Relative tournament Routlette wheel Relative pooling tournament Elitism	Two members are randomly chosen, and the parent is the one with higher fitness The probability an individual to be chosen as a parent is depended on their fitness Populations are thrown into a competition, and the winners are the parents Populations with the higher fitness from all the populations generated so far from the parent set
Crossover	One-point Two-point Uniform Cut and spice Ordered chromosome	Randomly generate a crossover point Randomly generate two crossover points Use a fixed mixing ratio between two parents Allow each parent to have its own choice in deciding crossover point Switch the position of genes
Mutation	Bit-string Flip bit Boundary Gaussian Uniform	Randomly flip the value of genes Flip the value of selective genes Replace the value of a gene with the upper or lower bound of the value Add a unit Gaussian distributed random value to the selected chromosome Replace the value of a selective gene with a uniform random value within the user-specified bounds

	GA	PSO	ACO	SA
Motivation	Natural evolution	Bird migration	Ant search food	Solid in heat bath
Population size	Any size	Several	Any size	Typically two
Iterations	Yes	Yes	Yes	Yes
Single-objective	Yes	Yes	Yes	Yes
Multi-objective	Yes	Yes	Yes	Yes
Parallelism	Inherent parallelism	Extended	Inherent parallelism	Extended
Convergence	Slow	Fast	Uncertain	Slow
Solution quality	Near global optima	Near global optima	Near global optima	Near local optima
Applications	General	General	TSP, routing, dynamic and adaptive	General
Theoretical analysis	Hard	Hard	Hard	Hard

	GA	PSO	ACO	SA
Motivation	Natural evolution	Bird migration	Ant search food	Solid in heat bath
Population size	Any size	Several	Any size	Typically two
Iterations	Yes	Yes	Yes	Yes
Single-objective	Yes	Yes	Yes	Yes
Multi-objective	Yes	Yes	Yes	Yes
Parallelism	Inherent parallelism	Extended	Inherent parallelism	Extended
Convergence	Slow	Fast	Uncertain	Slow
Solution quality	Near global optima	Near global optima	Near global optima	Near local optima
Applications	General	General	TSP, routing, dynamic and adaptive	General
Theoretical analysis	Hard	Hard	Hard	Hard

Application	Category	EA	Description
Liu in [57]	Routing	GA	Avoid link congestion
Ren in [60]		GA	Avoid switch congestion
Maniu in [62]		GA	Optimize link usage
Kikuta in [63]		Parallel GA	Optimize explicit routing in GPU
Stefano in [64]		ACO	Optimize network bandwidth usage
Wang in [65]		ACO	Avoid link congestion
Zhu in [67]		PSO	Energy saving
Subbiah in [68]		PSO	Finding the best node connector in switches for energy saving
Awad in [69]		PSO	Energy saving under the constraint of size-limited flow table
Dobrijevic in [70]		ACO	QoE aware routing
Tang in [71]		ACO	QoE aware routing
Blaguer in [72]		GA	QoE aware routing
Santl M in[73]		ACO	QoE aware routing
Kang in [74]	Load balancing	GA	Controller load balancing
Chou in [75]		GA	Controller load balancing
AMR in [77]		GA	ink load balancing
Sathyanarayana in [76]		ACO	Controller and link load balancing
Lin in [72]		ACO	Controller load balancing
Lange in [79]	Controller placement	SA	Minimize swi-to-con delay and controller load imbalance
Sanner in [80]		GA	Minimize swit-to-con delay
Jalili in [81]		GA	Minimize con-to-con delay and controller load imbalance
Ahmadi in [82]		GA	Minimize swi-to-con delay, con-to-con delay, controller load imbalance
Gao in [83]		PSO	Minimize swi-to-con delay considering controller capacity
Liu in [84]		PSO	Minimize swi-to-con delay and controller load imbalance
Li in [86]	Security	GA	Detect DDos attacks
Li in [87]		GA,PSO	Detect DDos attacks
Chen in [88]		ACO	Detect DDos attacks
Liu in [89]		ACO	Detect DDos attacks
Ojugo in [90]		GA	Security rule generation
Zhao in [91]		GA	Intrusion action detecting
Bouet in [92]		GA	Single security appliance placement
Famaluddine in [93]		GA	Multiple security appliances placement
Li in [94]	Virtual network mapping	PSO	Optimize network resource usage
Yao in [95]	Flow table optimization	PSO	Optimize flow table usage
Gao in [96]		ACO	Optimize flow table usage
Li in [97]		ACO	Optimize flow table usage
Guo in [98]	Hybrid SDN migration	GA	Migrate routers in hybrid network

Evolutionary Algorithms in Software Defined Networks: Techniques, Applications, and Issues

RichHTML

PDF

可视化

摘要/Abstract

引用本文

使用本文

图/表 9

参考文献 98

相关文章 0

编辑推荐

Metrics