Active Multi-Population Pattern Searching Algorithm for flow optimization in computer networks - The novel coevolution schema combined with linkage learning

The proposition of new effective evolutionary method dedicated to solve flow optimization problems in computer networks.The proposition of new flexible virus population handling mechanisms in novel MuPPetS method.Tests performed for practical problem with very large search space. The main objective of this paper is to propose an effective evolutionary method for solving the problem of working paths optimization in survivable MPLS network. The paper focuses on existing network, in which only network flow can be optimized to provide network survivability using the local repair strategy. The problem is NP-complete, the solution space of the test cases is large and many genes are required to code the potential solution. Recently, the MuPPetS method (Multi-Population Pattern Searching Algorithm for Flow Assignment) was proposed and seems to be a promising tool for tackling high-dimensional, hard optimization problems. The MuPPetS is a linkage learning method that minimizes the negative effects of typical EA bottlenecks, e.g., preconvergence and significant effectiveness dropdown caused by an increasing number of genes in the chromosome. In comparison to other evolutionary methods, the MuPPetS was shown to be effective and capable of solving GA-hard problems. Therefore, the proposed MuPPetS-FuN method (Multi-Population Pattern Searching Algorithm for Flow Assignment in Non-bifurcated Commodity Flow) is based on MuPPetS. The additional objective of this paper is to propose changes to general MuPPetS framework to increase its effectiveness via better subpopulation number control strategy.

[1]  T. M. Chen,et al.  Reliable services in MPLS , 1999, IEEE Commun. Mag..

[2]  Anton Riedl,et al.  A hybrid genetic algorithm for routing optimization in IP networks utilizing bandwidth and delay metrics , 2002, IEEE Workshop on IP Operations and Management.

[3]  Michal Wozniak,et al.  Optimizing distributed computing systems for k-nearest neighbours classifiers - evolutionary approach , 2011, Log. J. IGPL.

[4]  Tibor Cinkler,et al.  A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[5]  Andrzej Kasiński,et al.  Comparison of supervised learning methods for spike time coding in spiking neural networks , 2006 .

[6]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[7]  Qingfu Zhang,et al.  This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 RM-MEDA: A Regularity Model-Based Multiobjective Estimation of , 2022 .

[8]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[9]  Xiaoping Zheng,et al.  A kind of topology aggregation algorithm in hierarchical wavelength-routed optical networks , 2006, Photonic Network Communications.

[10]  K Walkowiak,et al.  The Hop-Limit Approach for Flow Assignment in survivable Connection-Oriented Networks , 2005, New Trends in Computer Networks.

[11]  Didier Colle,et al.  Benefits of GMPLS for multilayer recovery , 2005, IEEE Communications Magazine.

[12]  Lixing Yang,et al.  Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem , 2014 .

[13]  Robert Doverspike,et al.  Challenges for MPLS in optical network restoration , 2001, IEEE Commun. Mag..

[14]  Ayan Banerjee,et al.  Generalized multiprotocol label switching: an overview of signaling enhancements and recovery techniques , 2001, IEEE Commun. Mag..

[15]  Krzysztof Walkowiak,et al.  HEURISTIC ALGORITHMS FOR SURVIVABLE P2P MULTICASTING , 2013, Appl. Artif. Intell..

[16]  Aurora Trinidad Ramirez Pozo,et al.  Effective Linkage Learning Using Low-Order Statistics and Clustering , 2009, IEEE Transactions on Evolutionary Computation.

[17]  Kalyanmoy Deb,et al.  Sufficient conditions for deceptive and easy binary functions , 1994, Annals of Mathematics and Artificial Intelligence.

[18]  Sidney L. Hantler,et al.  An Algorithm for Optimal Route Selection in SNA Networks , 1983, IEEE Trans. Commun..

[19]  Krzysztof Walkowiak,et al.  Modeling and optimization of survivable P2P multicasting , 2011, Comput. Commun..

[20]  Eduardo Camponogara,et al.  Implementing traffic engineering in MPLS-based IP networks with Lagrangean relaxation , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[21]  Henri Pierreval,et al.  A novel hybrid evolutionary approach for capturing decision maker knowledge into the unequal area facility layout problem , 2015, Expert Syst. Appl..

[22]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[23]  Masaharu Munetomo,et al.  An adaptive parameter binary-real coded genetic algorithm for constraint optimization problems: Performance analysis and estimation of optimal control parameters , 2013, Inf. Sci..

[24]  Yiqiao Cai,et al.  Differential evolution with hybrid linkage crossover , 2015, Inf. Sci..

[25]  Andrzej Jaszkiewicz,et al.  On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment , 2002, IEEE Trans. Evol. Comput..

[26]  Moshe Sidi,et al.  Topological design of local-area networks using genetic algorithms , 1996, TNET.

[27]  Krzysztof Walkowiak.  A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks , 2004, Comput. Optim. Appl..

[28]  David E. Goldberg,et al.  Linkage learning, overlapping building blocks, and systematic strategy for scalable recombination , 2005, GECCO '05.

[29]  Jörg Ott,et al.  Special section on wireless mobile and multimedia networks , 2011, Comput. Commun..

[30]  Alexander Gersht,et al.  Architecture for restorable call allocation and fast VP restoration in mesh ATM networks , 1999, IEEE Trans. Commun..

[31]  Di Yuan,et al.  A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..

[32]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[33]  Halina Kwasnicka,et al.  Multi Population Pattern Searching Algorithm: A New Evolutionary Method Based on the Idea of Messy Genetic Algorithm , 2011, IEEE Transactions on Evolutionary Computation.

[34]  Eiji Oki,et al.  Dynamic multilayer routing schemes in GMPLS-based IP+optical networks , 2005, IEEE Communications Magazine.

[35]  David E. Goldberg,et al.  Dependency Structure Matrix Analysis: Offline Utility of the Dependency Structure Matrix Genetic Algorithm , 2004, GECCO.

[36]  J. Lawrence,et al.  Designing multiprotocol label switching networks , 2001, IEEE Commun. Mag..

[37]  Kalyanmoy Deb,et al.  RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.

[38]  Piet Demeester,et al.  Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS , 2004 .

[39]  Murilo Reolon Scuzziato,et al.  A comparative analysis of different dual problems in the Lagrangian Relaxation context for solving the Hydro Unit Commitment problem , 2014 .

[40]  Wayne D. Grover,et al.  Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .

[41]  David E. Goldberg,et al.  Genetic Algorithm Design Inspired by Organizational Theory: Pilot Study of a Dependency Structure Matrix Driven Genetic Algorithm , 2003, GECCO.

[42]  Hiroshi Ohta,et al.  Architectures for ATM network survivability and their field deployment , 1999, IEEE Commun. Mag..

[43]  Krzysztof Walkowiak,et al.  QUASI-HIERARCHICAL EVOLUTION ALGORITHM FOR FLOW ASSIGNMENT IN SURVIVABLE CONNECTION-ORIENTED NETWORKS , 2006 .

[44]  Vijay P. Kumar,et al.  Switched optical backbone for cost-effective scalable core IP networks , 2003, IEEE Commun. Mag..

[45]  Tian-Li Yu,et al.  Linkage learning by number of function evaluations estimation: Practical view of building blocks , 2013, Inf. Sci..

[46]  Subrahmanyam Dravida,et al.  Fast restoration of ATM networks , 1994, IEEE J. Sel. Areas Commun..

[47]  Larry Bull,et al.  Toward the Coevolution of Novel Vertical-Axis Wind Turbines , 2013, IEEE Transactions on Evolutionary Computation.

[48]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[49]  David E. Goldberg,et al.  Dependency Structure Matrix, Genetic Algorithms, and Effective Recombination , 2009, Evolutionary Computation.

[50]  Bezalel Gavish,et al.  A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..

[51]  Chuan-Kang Ting,et al.  Linkage Discovery through Data Mining [Research Frontier] , 2010, IEEE Computational Intelligence Magazine.

[52]  Tian-Li Yu,et al.  Interaction-detection metric with differential mutual complement for dependency structure matrix genetic algorithm , 2010, IEEE Congress on Evolutionary Computation.

[53]  G. D. Smith,et al.  Genetic algorithms and network ring design , 1999, Ann. Oper. Res..

[54]  Amin Nikanjam,et al.  Efficient model building in competent genetic algorithms using DSM clustering , 2011, AI Commun..

[55]  Krzysztof Walkowiak,et al.  Towards solving practical problems of large solution space using a novel pattern searching hybrid evolutionary algorithm - An elastic optical network optimization case study , 2015, Expert Syst. Appl..

[56]  Bezalel Gavish,et al.  Routing in a Network with Unreliable Components , 1988, IEEE Trans. Commun..