TY - GEN
T1 - Fast Resource Allocation for Virtual Network Functions Chain Placement
AU - Mohamed, Ramy
AU - Leivadeas, Aris
AU - Lambadaris, Ioannis
AU - Moris, Todd
AU - Djukic, Petar
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Network slicing enables the creation and management of a network that meets and surpasses the evolving requirements of a diverse set of new services. Within 5G network slicing, we can describe a network service as a Service Function Chain (SFC), i.e., a graph of interconnected Virtual Network Functions (VNFs) residing in a particular network slice. Thus, the optimal resource allocation for these SFCs is critical for the network operator. Nevertheless, this problem stays partially unresolved because it needs managing resources spread across various Edge and Cloud sites in distinct geographical areas. Moreover, the complexity of the problem dramatically grows when considering practical constraints like end-to-end delay, VNF affinity, processing delay, and traffic requirements between VNFs. This paper addresses this problem and proposes practical solutions for the Virtual Network Functions Chain Placement Problem (VNF-CPP) established on Integer Linear Programming (ILP) and heuristic algorithms. Furthermore, we provide theoretical analysis and experiments to demonstrate the efficiency of the proposed placement algorithms.
AB - Network slicing enables the creation and management of a network that meets and surpasses the evolving requirements of a diverse set of new services. Within 5G network slicing, we can describe a network service as a Service Function Chain (SFC), i.e., a graph of interconnected Virtual Network Functions (VNFs) residing in a particular network slice. Thus, the optimal resource allocation for these SFCs is critical for the network operator. Nevertheless, this problem stays partially unresolved because it needs managing resources spread across various Edge and Cloud sites in distinct geographical areas. Moreover, the complexity of the problem dramatically grows when considering practical constraints like end-to-end delay, VNF affinity, processing delay, and traffic requirements between VNFs. This paper addresses this problem and proposes practical solutions for the Virtual Network Functions Chain Placement Problem (VNF-CPP) established on Integer Linear Programming (ILP) and heuristic algorithms. Furthermore, we provide theoretical analysis and experiments to demonstrate the efficiency of the proposed placement algorithms.
KW - 5G Network Slicing
KW - NFV
KW - SFC
KW - VNF Placement
UR - https://www.scopus.com/pages/publications/85137768951
U2 - 10.1109/ITC-Egypt55520.2022.9855716
DO - 10.1109/ITC-Egypt55520.2022.9855716
M3 - Contribution to conference proceedings
AN - SCOPUS:85137768951
T3 - International Telecommunications Conference, ITC-Egypt 2022 - Proceedings
BT - International Telecommunications Conference, ITC-Egypt 2022 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 International Telecommunications Conference, ITC-Egypt 2022
Y2 - 26 July 2022 through 28 July 2022
ER -