NNIR: N-Non-Intersecting-Routing Algorithm for Multi-Path Resilient Routing in Telecommunications Applications

In this paper, we will present a N-Non-Intersecting-Routing (NNIR) algorithm which is used to reduce the cost of resilient rout-ingintelecommunicationsproblems.ResilientRoutingistheconnectionsbetweentwolocationsinagraphthroughtheuseofN completelyindependentroutes.ResilientRoutingisapplicableinawidevarietyofdomainsincludingtelecommunications,logis-ticsandembeddedsystemsdesign.TheproposedNNIRalgorithmincreasethecostoftheprimaryroutebytakingalessoptimal route,thusfreeingamoreoptimalroutefortheresilientroutes,inturnreducingthetotalcostofbothroutes.ThisisachievedthroughtheuseofaGeneticAlgorithm,Dijkstra’sAlgorithmandtherepairoperator.TheproposedNNIRshowsanaverage improvementof34.2%whencomparedtoDijkstra’sAlgorithm(oneofthemostwidelyusedalgorithmrouting).Similarly,there isanaverageimprovementof34.2%whencomparedtoA*(anotherpopularshortestpathalgorithm).Additionally,thereisanaverageimprovementof26.9%whencomparedtoSimulatedAnnealing(apopularevolutionarytechniqueusedwithinrouting problems).InthispaperweshowhowNNIRperformswithintwodifferentroutingdomains(

[1]  E. Dijkstra.  Solution of a Problem in Concurrent Programming Control , 2022, Edsger Wybe Dijkstra.

[2]  Hani Hagras,et al.  A Fuzzy Genetic System for Resilient Routing in Uncertain & Dynamic Telecommunication Networks , 2019, 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE).

[3]  Xianbo Xiang,et al.  Improved Astar Algorithm for Path Planning of Marine Robot , 2018, 2018 37th Chinese Control Conference (CCC).

[4]  K. Hariharan,et al.  Path planning of robot using modified dijkstra Algorithm , 2018, 2018 National Power Engineering Conference (NPEC).

[5]  Alican Bozyiğit,et al.  Public transport route planning: Modified dijkstra's algorithm , 2017, 2017 International Conference on Computer Science and Engineering (UBMK).

[6]  Hani Hagras,et al.  A Genetic Algorithm Based Approach for the Simultaneous Optimisation of Workforce Skill Sets and Team Allocation , 2016, SGAI Conf..

[7]  Pedro Costa,et al.  Towards an orientation enhanced astar algorithm for robotic navigation , 2015, 2015 IEEE International Conference on Industrial Technology (ICIT).

[8]  Mei Rong,et al.  An Internet of things QoS estimate approach based on multi-dimension QoS , 2014, 2014 9th International Conference on Computer Science & Education.

[9]  Bo Gao,et al.  Ant Colony Algorithm and Simulated Annealing Algorithm Based Process Route Optimization , 2014, 2014 Enterprise Systems Conference.

[10]  Siyuan Liu,et al.  A breadth-first and disjoint multi-path routing algorithm in wireless mesh networks , 2013, 2013 15th IEEE International Conference on Communication Technology.

[11]  Deng Pan,et al.  Depth-First Worst-Fit Search based multipath routing for data center networks , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[12]  Bradley R. Smith,et al.  Using Dijkstra to Compute Hop-by-Hop QoS Paths , 2011, 2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN).

[13]  Taoying Li,et al.  A New Design of Genetic Algorithm for Solving TSP , 2011, 2011 Fourth International Joint Conference on Computational Sciences and Optimization.

[14]  Fatos Xhafa,et al.  Application of Genetic Algorithms for QoS Routing in Mobile Ad Hoc Networks: A Survey , 2010, 2010 International Conference on Broadband, Wireless Computing, Communication and Applications.

[15]  Taoshen Li,et al.  A Multiple QoS Anycast Routing Algorithm Based Adaptive Genetic Algorithm , 2009, 2009 Third International Conference on Genetic and Evolutionary Computing.

[16]  Qin Xiong,et al.  A QoS Anycast Routing Algorithm Based on Genetic Algorithm and Particle Swarm Optimization , 2009, 2009 Third International Conference on Genetic and Evolutionary Computing.

[17]  Zhi-liang Zhu,et al.  A New Web Service Model Based on QoS , 2009, 2009 International Symposium on Intelligent Ubiquitous Computing and Education.

[18]  Gregory S. Hornby,et al.  Automated Antenna Design with Evolutionary Algorithms , 2006 .

[19]  Fengyu Liu,et al.  An efficient multicast routing algorithm based on simulated annealing for multimedia communications , 2005, 2005 IEEE International Conference on Systems, Man and Cybernetics.

[20]  Zhifeng Liu,et al.  A limited path unicast QoS routing algorithm , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[21]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[22]  Thomas Bäck,et al.  An Overview of Evolutionary Computation , 1993, ECML.

[23]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[24]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[25]  Donald E. Knuth,et al.  The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.

[26]  Robert A. Kirkman,et al.  Evaluating Single Point Failures for Safety & Reliability , 1979, IEEE Transactions on Reliability.

[27]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[28]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[29]  Xiao Cui,et al.  A*-based Pathfinding in Modern Computer Games , 2011 .

[30]  Huang Ya,et al.  A kind of simulated annealing algorithm with memory solving traveling salesman problem , 2010 .

[31]  Cheng Jia-xing.  Performance Analysis on Solving Problem of TSP by Genetic Algorithm and Simulated Annealing , 2009 .

[32]  Rob A. Rutenbar,et al.  Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.

[33]  E. Dijkstra.  Solution of a problem in concurrent programming control , 1965, CACM.