Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Reliability-Aware, Delay Guaranteed, and Resource Efficient Placement of Service Function Chains in Softwarized 5G Networks (2012.07051v1)

Published 13 Dec 2020 in cs.NI

Abstract: Network Functions Virtualization (NFV) allows flexibility, scalability, agility, and easy manageability of networks by leveraging the features of virtualization and cloud computing technologies. However, softwarization of network functions imposes many challenges. Reliability and latency are major challenges in NFV-enabled 5G networks that can lead to customer dissatisfaction and revenue loss. In general, redundancy is used to improve the reliability of communication services. However, redundancy requires the same amount of additional resources and thus increases cost. In this work, we address the reliability-aware, delay guaranteed, and resource efficient Service Function Chain (SFC) placement problem in softwarized 5G networks. First, we propose a novel SFC subchaining method to enhance the reliability of an SFC without backups. If reliability requirement is not met after subchaining method, we add backups to VNFs to meet the reliability requirement. Then, we formulate the reliable SFC placement problem as an Integer Linear Programming (ILP) problem in order to solve it optimally. Owing to high computational complexity of the ILP problem for solving large input instances, we propose a modified stable matching algorithm to provide near-optimal solution in polynomial time. By extensive simulations we show that our proposed solutions consume lesser physical resources compared to state-of-the-art solutions for provisioning reliable communication services.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
Citations (31)

Summary

We haven't generated a summary for this paper yet.