Parallelism-aware Service Function Chaining and Embedding for 5G Networks

The ultra-fast speed and massive capacity in 5G networks push huge amounts of data to networks. With network function virtualization, these data will go through multiple service functions (SFs) and big data processing/analysis. As a result, the processing delay from such SFs and data processing/anal...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings - International Conference on Computer Communications and Networks S. 1 - 9
Hauptverfasser: Zheng, Danyang, Peng, Chengzong, Liao, Xueting, Cao, Xiaojun
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.07.2021
Schlagworte:
ISSN:2637-9430
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The ultra-fast speed and massive capacity in 5G networks push huge amounts of data to networks. With network function virtualization, these data will go through multiple service functions (SFs) and big data processing/analysis. As a result, the processing delay from such SFs and data processing/analysis can significantly impact the delivery of latency-sensitive services. To reduce the processing delay, network function parallelism techniques are introduced to allow multiple SFs running parallelly for the same request. In this work, we study how to apply network function parallelism into SF chaining and embedding to optimize the latency. When physical nodes have unlimited computing resource, we propose the mixed integer programming based parallelism-aware SFC optimization (MIP-PS) algorithm. Our analysis proves the proposed MIP-PS is integer-approximation. When physical nodes have limited computing resource, we propose the latency factor based parallelism-aware SFC optimization (LF-PS) algorithm. Our extensive simulations demonstrate that our proposed schemes outperform the approaches extended directly from the existing work.
ISSN:2637-9430
DOI:10.1109/ICCCN52240.2021.9522271