Advancements and challenges in latency-optimized joint SFC placement and routing: a comprehensive review and future perspectives

Zahida Sharif (), Muhammed Basheer Jasser (), Kok-Lim Alvin Yau () and Angela Amphawan ()
Additional contact information
Zahida Sharif: School of Engineering and Technology, Sunway University
Muhammed Basheer Jasser: School of Engineering and Technology, Sunway University
Kok-Lim Alvin Yau: Universiti Tunku Abdul Rahman
Angela Amphawan: School of Engineering and Technology, Sunway University

International Journal of System Assurance Engineering and Management, 2025, vol. 16, issue 3, No 12, 1072-1105

Abstract: Abstract Network services are provided through Virtualized Network Functions (VNFs), such as firewall, intrusion detection, and load balancer, arranged in a chain known as a Service Function Chain (SFC). SFC placement refers to the selection of Virtualized Network Functions (VNFs) in a predetermined order, while SFC routing involves determining the paths or links through which the data flow is forwarded from one VNF (source) to the next (destination). The combined optimization of both SFC placement and routing is commonly referred to as SFC mapping. In large-scale networks, network conditions can change rapidly, necessitating dynamic solutions for SFC mapping that can adapt to the uncertainties inherent in dynamic networks in real-time. This paper provides an insightful overview of dynamic Service Function Chain (SFC) mapping within the framework of network function virtualization infrastructure (NFVI), focusing on the optimization of SFC placement and routing to minimize latency. It highlights the challenges in identifying appropriate Virtualized Network Functions (VNFs) and constructing optimal data traffic routes. While existing literature extensively covers joint solutions for SFC mapping, there is a noticeable research gap concerning dynamic SFC mapping aimed at latency minimization. The review encompasses background information, taxonomy, and challenges associated with SFC mapping, analyzing strategies ranging from traditional methods to deep learning and swarm intelligence. A comprehensive analysis of existing works is presented, considering various parameters such as performance metrics, datasets, and optimization complexity. Additionally, the paper outlines open research issues and future directions, aiming to spur further advancements in latency-aware dynamic SFC mapping.

Keywords: VNF placement and SFC routing; Dynamic SFC mapping; Latency minimization; Service function chaining; Routing optimization (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13198-025-02715-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:ijsaem:v:16:y:2025:i:3:d:10.1007_s13198-025-02715-6

Ordering information: This journal article can be ordered from
http://www.springer.com/engineering/journal/13198

DOI: 10.1007/s13198-025-02715-6

Access Statistics for this article

International Journal of System Assurance Engineering and Management is currently edited by P.K. Kapur, A.K. Verma and U. Kumar

More articles in International Journal of System Assurance Engineering and Management from Springer, The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().