Using evolutionary dynamic optimization for monitor selection in highly dynamic communication infrastructures

作者: Robin Mueller-Bady , Martin Kappes , Inmaculada Medina-Bulo , Francisco Palomo-Lozano

DOI: 10.1145/3205651.3208252

关键词:

摘要: In this paper, we address the problem of applying evolutionary dynamic optimization network monitoring to highly communication infrastructures. One major challenge modern networks is increasing volatility due to, e.g., changing availability nodes and links, load paths, or attacks. While those has been an important application area since decades, new developments in function virtualization software defined facilitate a completely level automated optimization. Especially mobile networks, changes can be observed appear swiftly. Thus, using population-based heuristics becomes challenging as reevaluation all candidate solutions may become time-wise impossible operations need rely on possibly obsolete fitness values. Here, established method applied solve monitor selection multiple real-world instances different simulated change. Statistically significant results proposed have compared performance best-of-multiple local search (EMS LS) heuristic. As show, reaches high quality even under difficult circumstances.

参考文章(22)
Jürgen Branke, Hartmut Schmeck, Designing evolutionary algorithms for dynamic optimization problems Advances in evolutionary computing. pp. 239- 262 ,(2003) , 10.1007/978-3-642-18965-4_9
Matei Ripeanu, Ian Foster, Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems international workshop on peer to peer systems. pp. 85- 93 ,(2002) , 10.1007/3-540-45748-8_8
Ferrante Neri, Raino A. E. Mäkinen, Hierarchical Evolutionary Algorithms and Noise Compensation via Adaptation Evolutionary Computation in Dynamic and Uncertain Environments. pp. 345- 369 ,(2007) , 10.1007/978-3-540-49774-5_15
Mitsuo Gen, Runwei Cheng, Genetic algorithms and engineering optimization John Wiley & Sons, Inc.. ,(1999) , 10.1002/9780470172261
H. B. Mann, D. R. Whitney, On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other Annals of Mathematical Statistics. ,vol. 18, pp. 50- 60 ,(1947) , 10.1214/AOMS/1177730491
Richard M. Karp, Reducibility Among Combinatorial Problems Journal of Symbolic Logic. ,vol. 40, pp. 219- 241 ,(2010) , 10.1007/978-3-540-68279-0_8
Carlos Cruz, Juan R. González, David A. Pelta, Optimization in dynamic environments: a survey on problems, methods and measures Soft Computing. ,vol. 15, pp. 1427- 1448 ,(2011) , 10.1007/S00500-010-0681-0
Jianer Chen, Iyad A. Kanj, Ge Xia, Improved upper bounds for vertex cover Theoretical Computer Science. ,vol. 411, pp. 3736- 3756 ,(2010) , 10.1016/J.TCS.2010.06.026
Mou Dasgupta, G. P. Biswas, Chandan Bhar, Optimization of multiple objectives and topological design of data networks using genetic algorithm 2012 1st International Conference on Recent Advances in Information Technology (RAIT). pp. 256- 262 ,(2012) , 10.1109/RAIT.2012.6194516
S. Knight, N. Falkner, H. X. Nguyen, P. Tune, M. Roughan, I can see for miles: Re-visualizing the internet IEEE Network. ,vol. 26, pp. 26- 32 ,(2012) , 10.1109/MNET.2012.6375890