Traffic-Weighted Availability-Guaranteed Network Slice Composition with VNF Replications
Publication Date
1-1-2022
Document Type
Conference Proceeding
Publication Title
IEEE International Conference on Communications
Volume
2022-May
DOI
10.1109/ICC45855.2022.9839242
First Page
2278
Last Page
2283
Abstract
In this work, we consider the network slice composition problem for Service Function Chains (SFCs), which addresses the issue of allocating bandwidth and VNF resources in a way that guarantees the availability of the SFC while minimizing cost. For the purpose of satisfying the availability requirement of the SFC, we adapt a traffic-weighted availability model which ensures that the long-term fraction of traffic supported by the slice topology remains above a desired threshold. We propose a method for composing a single or multi-path slice topology and for properly dimensioning VNF replicas and bandwidth on the slice paths. Through simulations, we show that our proposed algorithm can reduce the total cost of establishment compared to a dedicated protection approach in 5G networks.
Funding Number
CNS-2008856
Funding Sponsor
National Science Foundation
Keywords
5G networks, availability, network slicing, service function chains
Department
Computer Science
Recommended Citation
Riti Gour, Varin Sikand, Joseph Chang, Zhouxiang Wu, Genya Ishigaki, and Jason P. Jue. "Traffic-Weighted Availability-Guaranteed Network Slice Composition with VNF Replications" IEEE International Conference on Communications (2022): 2278-2283. https://doi.org/10.1109/ICC45855.2022.9839242
