scholarly journals Proposal and Investigation of an Artificial Intelligence (AI)-Based Cloud Resource Allocation Algorithm in Network Function Virtualization Architectures

2020 ◽  
Vol 12 (11) ◽  
pp. 196
Author(s):  
Vincenzo Eramo ◽  
Francesco Giacinto Lavacca ◽  
Tiziana Catena ◽  
Paul Jaime Perez Salazar

The high time needed to reconfigure cloud resources in Network Function Virtualization network environments has led to the proposal of solutions in which a prediction based-resource allocation is performed. All of them are based on traffic or needed resource prediction with the minimization of symmetric loss functions like Mean Squared Error. When inevitable prediction errors are made, the prediction methodologies are not able to differently weigh positive and negative prediction errors that could impact the total network cost. In fact if the predicted traffic is higher than the real one then an over allocation cost, referred to as over-provisioning cost, will be paid by the network operator; conversely, in the opposite case, Quality of Service degradation cost, referred to as under-provisioning cost, will be due to compensate the users because of the resource under allocation. In this paper we propose and investigate a resource allocation strategy based on a Long Short Term Memory algorithm in which the training operation is based on the minimization of an asymmetric cost function that differently weighs the positive and negative prediction errors and the corresponding over-provisioning and under-provisioning costs. In a typical traffic and network scenario, the proposed solution allows for a cost saving by 30% with respect to the case of solution with symmetric cost function.

2021 ◽  
Vol 11 (22) ◽  
pp. 10547
Author(s):  
Marios Gatzianas ◽  
Agapi Mesodiakaki ◽  
George Kalfas ◽  
Nikos Pleros ◽  
Francesca Moscatelli ◽  
...  

In order to cope with the ever-increasing traffic demands and stringent latency constraints, next generation, i.e., sixth generation (6G) networks, are expected to leverage Network Function Virtualization (NFV) as an enabler for enhanced network flexibility. In such a setup, in addition to the traditional problems of user association and traffic routing, Virtual Network Function (VNF) placement needs to be jointly considered. To that end, in this paper, we focus on the joint network and computational resource allocation, targeting low network power consumption while satisfying the Service Function Chain (SFC), throughput, and delay requirements. Unlike the State-of-the-Art (SoA), we also take into account the Access Network (AN), while formulating the problem as a general Mixed Integer Linear Program (MILP). Due to the high complexity of the proposed optimal solution, we also propose a low-complexity energy-efficient resource allocation algorithm, which was shown to significantly outperform the SoA, by achieving up to 78% of the optimal energy efficiency with up to 742 times lower complexity. Finally, we describe an Orchestration Framework for the automated orchestration of vertical-driven services in Network Slices and describe how it encompasses the proposed algorithm towards optimized provisioning of heterogeneous computation and network resources across multiple network segments.


2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Ran Xu

Network function virtualization (NFV) is designed to implement network functions by software that replaces proprietary hardware devices in traditional networks. In response to the growing demand of resource-intensive services, for NFV cloud service providers, software-oriented network functions face a number of challenges, such as dynamic deployment of virtual network functions and efficient allocation of multiple resources. This study aims at the dynamic allocation and adjustment of network multiresources and multitype flows for NFV. First, to seek a proactive approach to provision new instances for overloaded VNFs ahead of time, a model called long short-term memory recurrent neural network (LSTM RNN) is proposed to estimate flows in this paper. Then, based on the estimated flow, a cooperative and complementary resource allocation algorithm is designed to reduce resource fragmentation and improve the utilization. The final results demonstrate the advantage of the LSTM model on predicting the network function flow requirements, and our algorithm achieves good results and performance improvement in dynamically expanding network functions and improving resource utilization.


Symmetry ◽  
2019 ◽  
Vol 11 (9) ◽  
pp. 1173 ◽  
Author(s):  
Basheer Raddwan ◽  
Khalil AL-Wagih ◽  
Ibrahim A. Al-Baltah ◽  
Mohamed A. Alrshah ◽  
Mohammed A. Al-Maqri

Recently, Network Function Virtualization (NFV) and Software Defined Networking (SDN) have attracted many mobile operators. For the flexible deployment of Network Functions (NFs) in an NFV environment, NF decompositions and control/user plane separation have been introduced in the literature. That is to map traditional functions into their corresponding Virtual Network Functions (VNFs). This mapping requires the NFV Resource Allocation (NFV-RA) for multi-path service graphs with a high number of virtual nodes and links, which is a complex NP-hard problem that inherited its complexity from the Virtual Network Embedding (VNE). This paper proposes a new path mapping approach to solving the NFV-RA problem for decomposed Network Service Chains (NSCs). The proposed solution has symmetrically considered optimizing an average embedding cost with an enhancement on average execution time. The proposed approach has been compared to two other existing schemes using 6 and 16 scenarios of short and long simulation runs, respectively. The impact of the number of nodes, links and paths of the service requests on the proposed scheme has been studied by solving more than 122,000 service requests. The proposed Integer Linear Programming (ILP) and heuristic schemes have reduced the execution time up to 39.58% and 6.42% compared to existing ILP and heuristic schemes, respectively. Moreover, the proposed schemes have also reduced the average embedding cost and increased the profit for the service providers.


2021 ◽  
Vol 32 (2) ◽  
pp. 295-314 ◽  
Author(s):  
Song Yang ◽  
Fan Li ◽  
Stojan Trajanovski ◽  
Ramin Yahyapour ◽  
Xiaoming Fu

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 76876-76888 ◽  
Author(s):  
Hang Li ◽  
Luhan Wang ◽  
Xiangming Wen ◽  
Zhaoming Lu ◽  
Jinyan Li

Sign in / Sign up

Export Citation Format

Share Document