Deploying Disaster-Resilient Service Function Chains Using Adaptive Multi-Path Routing

Network Function Virtualization (NFV) is a new technology that deploys network services and functions as software components in data centers and cloud environments. One of its key applications is Service Function Chain (SFC), which chains a set of Virtual Network Functions (VNFs) in a specific order to deliver a desired service. However, deploying NFV and SFC networks faces challenges, particularly in terms of disaster resiliency. This encompasses natural disasters and hardware failures, which can disrupt network operations and lead to service interruption or degradation across an entire disaster zone (DZ). Therefore, designing NFV and SFC networks that can withstand disasters while providing high levels of service availability and reliability is important. This paper presents a new method for protecting SFCs using adaptive multi-path routing. The proposed Multi-path Protection (MP) method has the advantage of reducing the amount of reserved bandwidth on backup paths by distributing SFC traffic over multiple DZ-disjoint working paths. The problem being addressed involves VNFs placement, routing SFCs, and implementing protection mechanisms. The objective is to minimize network resource consumption, including both the bandwidth used by request routing paths and the computing resources for VNF execution. To solve this multi-dimensional optimization problem, a path-adaptive and flow-based integer linear program (ILP) is proposed to provide the optimal solution in sall-size network settings. We also propose a heuristic approach that offers the near-optimal solution in a time-efficient way. Comprehensive simulation results show that the proposed MP strategy outperforms traditional Dedicated Protection (DP) in terms of bandwidth and processing resource consumption, resulting in a significant gain up to 20%.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Network and Service Management
Published
2024-12-19
DOI
https://doi.org/10.1109/tnsm.2024.3520392
Citations
5
Primary Topic
Software-Defined Networks and 5G
Type
article
Field-Weighted Citation Impact
1.74
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deploying Disaster-Resilient Service Function Chains Using Adaptive Multi-Path Routing

Ahmed Meddahi, Fen Zhou, Mohamed Abderrahmane Madani
5 citations
IEEE Transactions on Network and Service Management
Software-Defined Networks and 5G
1.74
article

Deploying Disaster-Resilient Service Function Chains Using Adaptive Multi-Path Routing

Ahmed Meddahi, Fen Zhou, Mohamed Abderrahmane Madani
article en
5 citations

Abstract

Network Function Virtualization (NFV) is a new technology that deploys network services and functions as software components in data centers and cloud environments. One of its key applications is Service Function Chain (SFC), which chains a set of Virtual Network Functions (VNFs) in a specific order to deliver a desired service. However, deploying NFV and SFC networks faces challenges, particularly in terms of disaster resiliency. This encompasses natural disasters and hardware failures, which can disrupt network operations and lead to service interruption or degradation across an entire disaster zone (DZ). Therefore, designing NFV and SFC networks that can withstand disasters while providing high levels of service availability and reliability is important. This paper presents a new method for protecting SFCs using adaptive multi-path routing. The proposed Multi-path Protection (MP) method has the advantage of reducing the amount of reserved bandwidth on backup paths by distributing SFC traffic over multiple DZ-disjoint working paths. The problem being addressed involves VNFs placement, routing SFCs, and implementing protection mechanisms. The objective is to minimize network resource consumption, including both the bandwidth used by request routing paths and the computing resources for VNF execution. To solve this multi-dimensional optimization problem, a path-adaptive and flow-based integer linear program (ILP) is proposed to provide the optimal solution in sall-size network settings. We also propose a heuristic approach that offers the near-optimal solution in a time-efficient way. Comprehensive simulation results show that the proposed MP strategy outperforms traditional Dedicated Protection (DP) in terms of bandwidth and processing resource consumption, resulting in a significant gain up to 20%.

IEEE Transactions on Network and Service ManagementVol. 22(2)
Institut Mines-Télécom (FR), Laboratoire Informatique d'Avignon (FR)
Climate action
Openalex Percentile: Top 13%
Software-Defined Networks and 5G
1.74
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.