Service Function Chaining and Embedding with Heterogeneous Faults Tolerance in Edge Networks

In the 5G-and-beyond era, ultra-reliable low latency communication (URLLC) services are ubiquitous in edge networks. To enhance the performance metrics and the quality of service (QoS), URLLC services are delivered via a sequence of software-based network functions, also known as a service function...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE eTransactions on network and service management Jg. 20; H. 3; S. 1
Hauptverfasser: Zheng, Danyang, Shen, Gangxiang, Li, Yongcheng, Cao, Xiaojun, Mukherjee, Biswanath
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.09.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Bandwidth
Edge networks
Embedding
Fault tolerance
Fault tolerant systems
Faults
network function virtualization
Network latency
Performance measurement
Quality of service
Quality of service architectures
reliable service function chain embedding
Servers
Service function chaining
Software
Ultra reliable low latency communication
Virtual networks
ISSN:1932-4537, 1932-4537
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In the 5G-and-beyond era, ultra-reliable low latency communication (URLLC) services are ubiquitous in edge networks. To enhance the performance metrics and the quality of service (QoS), URLLC services are delivered via a sequence of software-based network functions, also known as a service function chain (SFC). Towards reliable SFC delivery, it is imperative to incorporate fault-tolerance during SFC deployments. However, deploying an SFC with fault-tolerance is challenging because the protection mechanism needs to jointly consider multiple concurrent physical/virtual network failures and hardware/software failures. Considering these concurrent heterogeneous failures, this work investigates how to effectively deliver an SFC in edge networks with the objective of minimizing bandwidth resource consumption. First, we introduce the concept of k-heterogeneous-faults-tolerance and propose an augmented protection graph, called k-connected service function slices layered graph (KC-SLG). Based on the KC-SLG, we formulate a novel problem called k-heterogeneous-faults-tolerant SFC embedding and propose an effective algorithm, called fault-tolerant service function graph embedding (FT-SFGE). FT-SFGE employs two proposed techniques: k-connected network slicing (KC-NS) and k-connected function slicing (KC-FS). Via thorough mathematical proofs, we show that KC-NS is 2-approximate. Extensive simulations show that KC-FS has the best average cost-efficiency when k = 2, and FT-SFGE outperforms the schemes directly extended from the state-of-the-art.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1932-4537
1932-4537
DOI:10.1109/TNSM.2022.3220667