Latency-Aware Virtual Network Function Chain Recovery in Provider Networks with Network Slicing

With the rapid development of network function virtualization (NFV) technology, network services can be provided by virtual network functions (VNFs) deployed in provider networks. One of the most important related issues is to install duplicated VNFs to avoid the failures of VNFs. Due to the fact that duplicated VNFs will occupy lots of resources in networks, some research works study on how to efficiently recover failed VNFs to satisfy the demands of users recently. However, previous studies often focus on recovering demands, without considering if the latency of the recovered demands can be satisfied or not. While considering the latency constraint of demands, in this paper, we study on the problem of recovering failed VNFs to recover failed demands such that the total weight of the recovered demands is maximized, while still ensuring the latency requirement of the recovered demands, where the weight of a demand is used to represent its importance. For this problem, an efficient algorithm, termed the latency-aware recovery algorithm (LARA), is proposed. In addition, simulations are conducted to show the performance of the LARA.

Authors

Institutions

Publication Details

Published
2025-09-22
DOI
https://doi.org/10.23919/apnoms67058.2025.11181295
Primary Topic
Software-Defined Networks and 5G
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Latency-Aware Virtual Network Function Chain Recovery in Provider Networks with Network Slicing

Quynh‐Thu Le, Bing-Hong Liu, Shuhui Wu, Tu N. Nguyen et al.
Software-Defined Networks and 5G
article

Latency-Aware Virtual Network Function Chain Recovery in Provider Networks with Network Slicing

Quynh‐Thu Le, Bing-Hong Liu, Shuhui Wu, Tu N. Nguyen, Shao‐I Chu, Dung H. P. Nguyen
article en

Abstract

With the rapid development of network function virtualization (NFV) technology, network services can be provided by virtual network functions (VNFs) deployed in provider networks. One of the most important related issues is to install duplicated VNFs to avoid the failures of VNFs. Due to the fact that duplicated VNFs will occupy lots of resources in networks, some research works study on how to efficiently recover failed VNFs to satisfy the demands of users recently. However, previous studies often focus on recovering demands, without considering if the latency of the recovered demands can be satisfied or not. While considering the latency constraint of demands, in this paper, we study on the problem of recovering failed VNFs to recover failed demands such that the total weight of the recovered demands is maximized, while still ensuring the latency requirement of the recovered demands, where the weight of a demand is used to represent its importance. For this problem, an efficient algorithm, termed the latency-aware recovery algorithm (LARA), is proposed. In addition, simulations are conducted to show the performance of the LARA.

Kennesaw State University (US), Pham Van Dong University (VN), National Kaohsiung University of Science and Technology (TW)
Openalex Percentile: Top 67%
Software-Defined Networks and 5G
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.

Latency-Aware Virtual Network Function Chain Recovery in Provider Networks with Network Slicing — Quynh‐Thu Le, Bing-Hong Liu, et al. · (2025) | TGRS Research Map | TGRS