APVNFC: Adaptive Placement of Virtual Network Function Chains

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.