skip to main content
10.1145/3071178.3071255acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Optimization of monitoring in dynamic communication networks using a hybrid evolutionary algorithm

Published: 01 July 2017 Publication History

Abstract

In this paper, we propose a hybrid evolutionary algorithm (EA) for the optimization of efficient monitoring in dynamic communication networks. The first step towards improving communication infrastructures is gathering information about the current situation. One part of collecting this information is to implement an adequate monitoring in the network, i.e., the optimal positions and amount of monitoring devices, in order to analyze communication flows.
Solving the general monitor selection problem using evolutionary computation has already been done in the past. Our approach focuses on the efficient optimization of monitors having a dynamic search landscape, i.e., having recurring substantial changes of the underlying network model in order to simulate bulks of entering or leaving nodes and edges.
Here, we compare the steady optimization versions of a common genetic algorithm (GA), the proposed hybrid EA, and a local search based EA, in conjunction with a total restart version of the hybrid EA. Empirical results are obtained using multiple well-known real-world problem instances. We show that we can achieve reliably fast high quality results using the proposed hybrid EA.

References

[1]
Thomas Bäck and Sami Khuri. 1994. An evolutionary heuristic for the maximum independent set problem. In Proceedings of the First IEEE Conference on Evolutionary Computation. 531--535.
[2]
Salim Bouamama, Christian Blum, and Abdellah Boukerram. 2012. A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Applied Soft Computing 12, 6 (2012), 1632--1639.
[3]
Shaowei Cai. 2015. Balance between complexity and quality: Local search for minimum vertex cover in massive graphs. IJCAI International Joint Conference on Artificial Intelligence 2015-Janua, Ijcai (2015), 747--753.
[4]
Shaowei Cai, Kaile Su, Chuan Luo, and Abdul Sattar. 2013. NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover. J. Artif. Int. Res. 46, 1 (jan 2013), 687--716. http://dl.acm.org/citation.cfm?id=2512538.2512555
[5]
Carlos Artemio Coello Coello. 2002. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering 191 (2002), 1245--1287.
[6]
Reinhard Diestel. 2010. Graph Theory (4th editio ed.). Springer-Verlag, Heidelberg. 451 pages. http://diestel-graph-theory.com/basic.html
[7]
Irit Dinur and Samuel Safra. 2005. On the hardness of approximating minimum vertex cover. Annals of Mathematics 162 (2005), 439--485.
[8]
Benjamin Doerr, Daniel Johannsen, and Carola Winzen. 2012. Multiplicative drift analysis. Algorithmica 64, 4 (2012), 673--697. arXiv:1101.0776
[9]
Isaac K. Evans. 1998. Evolutionary Algorithms for Vertex Cover. In International Conference on Evolutionary Programming. Springer, 377--386.
[10]
Mitsuo Gen and Runwei Cheng. 2000. Genetic algorithms and engineering optimization. Vol. 7. 512 pages.
[11]
Thomas Jansen, Pietro S Oliveto, and Christine Zarges. 2013. Approximating Vertex Cover Using Edge-based Representations. In Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII (FOGA XII '13). ACM, New York, NY, USA, 87--96.
[12]
Raka Jovanovic and Milan Tuba. 2011. An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Applied Soft Computing 11, 8 (2011), 5360--5366.
[13]
George Karakostas. 2009. A Better Approximation Ratio for the Vertex Cover Problem. ACM Transactions on Algorithms 5, 4 (nov 2009), 41:1--41:8.
[14]
Richard M. Karp. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations. 85--103.
[15]
Sami Khuri and Thomas Bäck. 1994. An evolutionary heuristic for the minimum vertex cover problem. In Proceedings of the KI-94 Workshop Genetic Algorithms within the Framework of Evolutionary Computation. 86--90. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.40.4161
[16]
Simon Knight, Nickolas Falkner, Hung X. Nguyen, Paul Tune, and Matthew Roughan. 2012. I Can See for Miles: Re-Visualizing the Internet. IEEE Network 26, December (2012), 26--32.
[17]
Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. 2010. Kronecker Graphs: An Approach to Modeling Networks. The Journal of Machine Learning Research 11 (2010), 985--1042.
[18]
Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. 2007. Graph Evolution: Densification and Shrinking Diameters. ACM Transactions on Knowledge Discovery from Data (TKDD) 1, 1 (mar 2007).
[19]
Efrén Mezura-Montes and Carlos A. Coello Coello. 2011. Constraint-handling in nature-inspired numerical optimization: Past, present and future. Swarm and Evolutionary Computation 1, 4 (2011), 173--194.
[20]
Robin Mueller-Bady, Martin Kappes, Ruediger Gad, and Inmaculada Medina-Bulo. 2015. Using Genetic Algorithms for Deadline-Constrained Monitor Selection in Dynamic Computer Networks. In GECCO Comp '15: Proceedings of the 2015 conference companion on genetic and evolutionary computation companion.
[21]
Robin Mueller-Bady, Martin Kappes, Inmaculada Medina-Bulo, and Francisco Palomo-Lozano. 2016. Leveraging Diversity in Evolutionary Algorithms using a Population Injection Method. In System Theory, Control and Computing (ICSTCC), 2016 20th International Conference on.
[22]
Silvia Richter, Malte Helmert, and Charles Gretton. 2007. A Stochastic Local Search Approach to Vertex Cover. Springer Berlin Heidelberg, Berlin, Heidelberg, 412--426.
[23]
Matei Ripeanu, Ian Foster, and Adriana Iamnitchi. 2002. Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design. IEEE Internet Computing Journal (2002), 1--12. arXiv:cs/0209028
[24]
Frank Wilcoxon. 1945. Individual comparisons by ranking methods. Biometrics Bulletin 1 (1945), 80--83. http://www.jstor.org/stable/3001968
[25]
Xinshun Xu and Jun Ma. 2006. An efficient simulated annealing algorithm for the minimum vertex cover problem. Neurocomputing 69, 7 (2006), 913--916.

Cited By

View all
  • (2023)Network Optimization Using Genetic Programming2023 International Conference on Computer Science and Emerging Technologies (CSET)10.1109/CSET58993.2023.10346779(1-6)Online publication date: 10-Oct-2023
  • (2023)A Metaheuristic Approach for Solving Monitor Placement ProblemVariable Neighborhood Search10.1007/978-3-031-34500-5_1(1-13)Online publication date: 29-May-2023
  • (2022)Variable neighborhood search approach with intensified shake for monitor placementNetworks10.1002/net.2213481:3(319-333)Online publication date: Dec-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference
July 2017
1427 pages
ISBN:9781450349208
DOI:10.1145/3071178
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2017

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dynamic network optimization
  2. evolutionary computation
  3. local search

Qualifiers

  • Research-article

Funding Sources

  • State of Hessen
  • Spanish Ministry of Economy and Competitiveness (National Program for Research, Development and Innovation)
  • Excellence Network SEBASENet
  • European Union (European Regional Development Fund - ERDF)

Conference

GECCO '17
Sponsor:

Acceptance Rates

GECCO '17 Paper Acceptance Rate 178 of 462 submissions, 39%;
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Network Optimization Using Genetic Programming2023 International Conference on Computer Science and Emerging Technologies (CSET)10.1109/CSET58993.2023.10346779(1-6)Online publication date: 10-Oct-2023
  • (2023)A Metaheuristic Approach for Solving Monitor Placement ProblemVariable Neighborhood Search10.1007/978-3-031-34500-5_1(1-13)Online publication date: 29-May-2023
  • (2022)Variable neighborhood search approach with intensified shake for monitor placementNetworks10.1002/net.2213481:3(319-333)Online publication date: Dec-2022
  • (2021)An analysis of the locality of binary representations in genetic and evolutionary algorithmsPeerJ Computer Science10.7717/peerj-cs.5617(e561)Online publication date: 25-May-2021
  • (2019)An evolutionary hybrid search heuristic for monitor placement in communication networksJournal of Heuristics10.1007/s10732-019-09414-zOnline publication date: 2-May-2019
  • (2018)Using evolutionary dynamic optimization for monitor selection in highly dynamic communication infrastructuresProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3205651.3208252(1672-1679)Online publication date: 6-Jul-2018
  • (2018)On the feasibility of using hybrid evolutionary dynamic optimization for optimal monitor selection in dynamic communication networksNOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium10.1109/NOMS.2018.8406298(1-4)Online publication date: Apr-2018
  • (2018)A Sawtooth Growing Exploitation Framework for Memetic Algorithms2018 15th International Conference on Control, Automation, Robotics and Vision (ICARCV)10.1109/ICARCV.2018.8581243(72-76)Online publication date: Nov-2018
  • (2017)MultijobProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3067695.3082476(1231-1238)Online publication date: 15-Jul-2017

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media