Affiliation:
1. 1 Department of Computer Science and Enginnering , Motilal Nehru National Institute of Technology Allahabad , Prayagraj , India
Abstract
Abstract
Designing efficient and flexible approaches for placement of Virtual Network Function (VNF) chains is the main success of Network Function Virtualization (NFV). However, most current work considers the constant bandwidth and flow processing requirements while deploying the VNFs in the network. The constant (immutable) flow processing and bandwidth requirements become critical limitations in an NFV-enabled network with highly dynamic traffic flow. Therefore, bandwidth requirements and available resources of the Point-of-Presence (PoP) in the network change constantly. We present an adaptive model for placing VNF chains to overcome this limitation. At the same time, the proposed model minimizes the number of changes (i.e., re-allocation of VNFs) in the network. The experimental evaluation shows that the adaptive model can deliver stable network services. Moreover, it reduces the significant number of changes in the network and ensures flow performance.
Reference48 articles.
1. Yi, B., et al. A Comprehensive Survey of Network Function Virtualization. – Computer Networks, Vol. 133, 2018, pp. 212-262.
2. Zhang, X., et al. Near-Optimal Energy-Efficient Algorithm for Virtual Network Function Placement. – IEEE Transactions on Cloud Computing, 2019.
3. Yue, Y., et al. Resource Optimization and Delay Guarantee Virtual Network Function Placement for Mapping SFC Requests in Cloud Networks. – IEEE Transactions on Network and Service Management, Vol. 18, 2021, No 2, pp. 1508-1523.
4. Zahedi, S. R., S. Jamali, P. Bayat. A Power-Efficient and Performance-Aware Online Virtual Network Function Placement in SDN/NFV-Enabled Networks. – Computer Networks, Vol. 205, 2022, 108753.
5. Tavares, T. N., et al. NIEP: NFV Infrastructure Emulation Platform. – In: Proc. of 32nd IEEE International Conference on Advanced Information Networking and Applications (AINA’18), IEEE, 2018.