Multi-Objective Simulated Annealing-Based Routing Plane Computation for Multiple Demands
Maxim Prihodko, Longfei Dai, Degao Zheng, Zhaoyu Jiang, Zhibo Hu, Yi Zhang, Yanmiao Wang · 2022
This paper develops a systematic strategy to construct a model of an IP Network with multiple weight links and proposes a simulated annealing-based method (SMOOthIP) to achieve routing plane computation for multiple QoS-demands. The proposed algorithm considers routing plane computation as a multiobjective optimization problem and evaluates the performance of the outcome based on multiple network-wide demands. In this work, the proposed SMOOthIP is tested on three network topologies with two-weight links and different configurations and with different optimization principles. The algorithm generates a set of routes in the network for a single source node and then optimizes this set to increase the number of routes satisfying multiple network-wide constraints. The proposed algorithm is implemented and tested in a simulated environment, and the framework of this work could be adopted to other routing and load-balancing optimization problems in IP Network domain with multiple configurations to perform multi-objective based route computation. The algorithm performance evaluation shows its' ability to additionally satisfy up to 28000 (4.5%) new OD-pairs with a feasible path in Dual-Homed and Mouth-like topologies with 1000 nodes. This result is achieved in a case when more than 80% of theoretically feasible routes are already found by an alternative solution.