International Journal of Computational Intelligence Systems

Volume 13, Issue 1, 2020, Pages 352 - 365

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

Authors
Lewis Veryard1, *, Hani Hagras1, Andrew Starkey2, Anthony Conway2, Gilbert Owusu2
1 The Computational Intelligence Centre, The School of Computer Science and Electronic Engineering, The University of Essex, Colchester, Essex, UK
2 BT Labs, BT plc, Ipswich, Suffolk, UK
*Corresponding author. Email: Lhfver@essex.ac.uk
Corresponding Author
Lewis Veryard
Received 14 October 2019, Accepted 9 January 2020, Available Online 17 March 2020.
DOI
https://doi.org/10.2991/ijcis.d.200313.001How to use a DOI?
Keywords
Resilient Routing, Multi-Path Resilient Routing, Genetic Algorithm Routing, Multi-Path Routing, Routing, Telecommunication Routing
Abstract

In this paper, we will present a N-Non-Intersecting-Routing (NNIR) algorithm which is used to reduce the cost of resilient routing in telecommunications problems. Resilient Routing is the connections between two locations in a graph through the use of N completely independent routes. Resilient Routing is applicable in a wide variety of domains including telecommunications, logistics and embedded systems design. The proposed NNIR algorithm increase the cost of the primary route by taking a less optimal route, thus freeing a more optimal route for the resilient routes, in turn reducing the total cost of both routes. This is achieved through the use of a Genetic Algorithm, Dijkstra's Algorithm and the repair operator. The proposed NNIR shows an average improvement of 34.2% when compared to Dijkstra's Algorithm (one of the most widely used algorithm routing). Similarly, there is an average improvement of 34.2% when compared to A* (another popular shortest path algorithm). Additionally, there is an average improvement of 26.9% when compared to Simulated Annealing (a popular evolutionary technique used within routing problems). In this paper we show how NNIR performs within two different routing domains (telecommunications routing and road routing), and compares it against three other routing techniques to solve the resilient routing problem.

Copyright
© 2020 The Authors. Published by Atlantis Press SARL.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)
View full text (HTML)

Journal
International Journal of Computational Intelligence Systems
Volume-Issue
13 - 1
Pages
352 - 365
Publication Date
2020/03
ISSN (Online)
1875-6883
ISSN (Print)
1875-6891
DOI
https://doi.org/10.2991/ijcis.d.200313.001How to use a DOI?
Copyright
© 2020 The Authors. Published by Atlantis Press SARL.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - JOUR
AU  - Lewis Veryard
AU  - Hani Hagras
AU  - Andrew Starkey
AU  - Anthony Conway
AU  - Gilbert Owusu
PY  - 2020
DA  - 2020/03
TI  - NNIR: N-Non-Intersecting-Routing Algorithm for Multi-Path Resilient Routing in Telecommunications Applications
JO  - International Journal of Computational Intelligence Systems
SP  - 352
EP  - 365
VL  - 13
IS  - 1
SN  - 1875-6883
UR  - https://doi.org/10.2991/ijcis.d.200313.001
DO  - https://doi.org/10.2991/ijcis.d.200313.001
ID  - Veryard2020
ER  -