A two-level strategy based on evolutionary algorithm to solve the inter-domain path computation under node-defined domain uniqueness constraint

The Inter-Domain Path Computation problem under Node-defined Domain Uniqueness constraint (IDPC-NDU) is a recently investigated topic for finding the effective routing paths on the multi-domain network topology as well as transportation. The objective of the IDPC-NDU is to find the shortest path in the multi-domain directed graph that traverses every domain at most once. Since the IDPC-NDU belongs to NP-Hard class, this paper proposes a novel two-level approach based on an Evolutionary Algorithm (EA) to solve it. The first level aims to determine the sequence of crossed domains using an improved Genetic Algorithm (GA), while the second one aims to locate the minimally costly path between two nodes among the entire domains. Furthermore, we devise an approach to represent a chromosome, which reduces the chromosome length to the number of domains. Experiments on numerous sets of instances were implemented to show the effectiveness and characteristics of the proposed algorithm.

[1]  Huynh Thi Thanh Binh,et al.  A survey on hybridizing genetic algorithm with dynamic programming for solving the traveling salesman problem , 2013, 2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR).

[2]  Piero Castoldi,et al.  A Survey on the Path Computation Element (PCE) Architecture , 2013, IEEE Communications Surveys & Tutorials.

[3]  Adrian Farrel,et al.  A Path Computation Element (PCE)-Based Architecture , 2006, RFC.

[4]  Dingwei Wang,et al.  Genetic algorithms for solving shortest path problems , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[5]  Johanne Cohen,et al.  Domain clustering for inter-domain path computation speed-up , 2018, Networks.

[6]  Mohamed Cheriet,et al.  Hierarchical Path Computation With Flexible Ethernet In Multi-layer Multi-domain Networks , 2020, 2020 IEEE Symposium on Computers and Communications (ISCC).

[7]  Thi Thanh Binh Huynh,et al.  An effective combination of Genetic Algorithms and the Variable Neighborhood Search for solving Travelling Salesman Problem , 2015, 2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI).

[8]  P. Castoldi,et al.  Domain sequence protocol (DSP) for PCE-based multi-domain traffic engineering , 2012, IEEE/OSA Journal of Optical Communications and Networking.

[9]  Mohamed Cheriet,et al.  Joint Optimization Of Routing and Flexible Ethernet Assignment In Multi-layer Multi-domain Networks , 2020, 2020 29th International Conference on Computer Communications and Networks (ICCCN).

[10]  Dirk Sudholt,et al.  Running time analysis of Ant Colony Optimization for shortest path problems , 2012, J. Discrete Algorithms.

[11]  Adrian Farrel,et al.  The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS and GMPLS , 2012, RFC.

[12]  Huynh Thi Thanh Binh,et al.  New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm , 2019, Knowl. Based Syst..

[13]  Huynh Thi Thanh Binh,et al.  A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization , 2021, Eng. Appl. Artif. Intell..

[14]  Dirk Sudholt,et al.  A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems , 2012, Algorithmica.

[15]  Huynh Thi Thanh Binh,et al.  Multifactorial Evolutionary Algorithm for Inter-Domain Path Computation under Domain Uniqueness Constraint , 2020, 2020 IEEE Congress on Evolutionary Computation (CEC).