Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network
Distributed link-state routing protocols, including Open Shortest Path First (OSPF) and Intermediate System–Intermediate System (IS-IS), have successfully provided robust shortest path routing for IP networks. However, shortest path routing is inflexible and sometimes results in congestion on some c...
Guardado en:
Autores principales: | , , , |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
MDPI AG
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/494a97ed3a334a7db05d6f0f6283f15b |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
id |
oai:doaj.org-article:494a97ed3a334a7db05d6f0f6283f15b |
---|---|
record_format |
dspace |
spelling |
oai:doaj.org-article:494a97ed3a334a7db05d6f0f6283f15b2021-11-11T15:26:17ZRouting Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network10.3390/app1121105042076-3417https://doaj.org/article/494a97ed3a334a7db05d6f0f6283f15b2021-11-01T00:00:00Zhttps://www.mdpi.com/2076-3417/11/21/10504https://doaj.org/toc/2076-3417Distributed link-state routing protocols, including Open Shortest Path First (OSPF) and Intermediate System–Intermediate System (IS-IS), have successfully provided robust shortest path routing for IP networks. However, shortest path routing is inflexible and sometimes results in congestion on some critical links. By separating the control plane and the data plane, the centralized control of Software Defined Networking (SDN)-based approach possesses flexible routing capabilities. Fibbing is an approach that can achieve centralized control over a network running distributed routing protocols. In a Fibbing-controlled IP network, the controller cleverly generates fake protocol messages to manipulate routers to steer the flow of the desired paths. However, introducing fake nodes destroys the structure of the loop-free property of Loop-Free Alternate (LFA) that is used to achieve fast failure recovery in IP networks. This paper addresses this issue and presents a solution to provision routing paths so a Fibbing network can still apply LFA in the network. The proposed network jointly considers load-balanced and fast failure recovery. We formulate the problem as an integer linear programming problem. The numerical results reveal that the proposed method can provide 100% survivability against any single node or single link failure.Tabinda AshrafSteven S. W. LeeMuhammad IqbalJen-Yi PanMDPI AGarticleload balancingfast failure recoveryFibbingIP network routingTechnologyTEngineering (General). Civil engineering (General)TA1-2040Biology (General)QH301-705.5PhysicsQC1-999ChemistryQD1-999ENApplied Sciences, Vol 11, Iss 10504, p 10504 (2021) |
institution |
DOAJ |
collection |
DOAJ |
language |
EN |
topic |
load balancing fast failure recovery Fibbing IP network routing Technology T Engineering (General). Civil engineering (General) TA1-2040 Biology (General) QH301-705.5 Physics QC1-999 Chemistry QD1-999 |
spellingShingle |
load balancing fast failure recovery Fibbing IP network routing Technology T Engineering (General). Civil engineering (General) TA1-2040 Biology (General) QH301-705.5 Physics QC1-999 Chemistry QD1-999 Tabinda Ashraf Steven S. W. Lee Muhammad Iqbal Jen-Yi Pan Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network |
description |
Distributed link-state routing protocols, including Open Shortest Path First (OSPF) and Intermediate System–Intermediate System (IS-IS), have successfully provided robust shortest path routing for IP networks. However, shortest path routing is inflexible and sometimes results in congestion on some critical links. By separating the control plane and the data plane, the centralized control of Software Defined Networking (SDN)-based approach possesses flexible routing capabilities. Fibbing is an approach that can achieve centralized control over a network running distributed routing protocols. In a Fibbing-controlled IP network, the controller cleverly generates fake protocol messages to manipulate routers to steer the flow of the desired paths. However, introducing fake nodes destroys the structure of the loop-free property of Loop-Free Alternate (LFA) that is used to achieve fast failure recovery in IP networks. This paper addresses this issue and presents a solution to provision routing paths so a Fibbing network can still apply LFA in the network. The proposed network jointly considers load-balanced and fast failure recovery. We formulate the problem as an integer linear programming problem. The numerical results reveal that the proposed method can provide 100% survivability against any single node or single link failure. |
format |
article |
author |
Tabinda Ashraf Steven S. W. Lee Muhammad Iqbal Jen-Yi Pan |
author_facet |
Tabinda Ashraf Steven S. W. Lee Muhammad Iqbal Jen-Yi Pan |
author_sort |
Tabinda Ashraf |
title |
Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network |
title_short |
Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network |
title_full |
Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network |
title_fullStr |
Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network |
title_full_unstemmed |
Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network |
title_sort |
routing path assignment for joint load balancing and fast failure recovery in ip network |
publisher |
MDPI AG |
publishDate |
2021 |
url |
https://doaj.org/article/494a97ed3a334a7db05d6f0f6283f15b |
work_keys_str_mv |
AT tabindaashraf routingpathassignmentforjointloadbalancingandfastfailurerecoveryinipnetwork AT stevenswlee routingpathassignmentforjointloadbalancingandfastfailurerecoveryinipnetwork AT muhammadiqbal routingpathassignmentforjointloadbalancingandfastfailurerecoveryinipnetwork AT jenyipan routingpathassignmentforjointloadbalancingandfastfailurerecoveryinipnetwork |
_version_ |
1718435304920055808 |