VAPNIC: A VersAtile shortest path-free VNF Placement using a divide-and-coNquer tactIC
Laaziz Lahlou, Arol Gbeto Fia, Nadjia Kara, Aris Leivadeas · 2021 IEEE Global Communications Conference (GLOBECOM) · 2021
Orchestration mechanisms play a pivotal role in assisting service providers in deploying their increasingly complex virtual network services seamlessly thanks to Network Function Virtualization (NFV) and Software-defined networking (SDN) technology enablers. Unfortunately, existing state-of-the-art orchestration techniques suffer from non-scalability and time-efficiency aptitude when the services require VNFs to be distributed across cloud and edge environments with complex dimensions. Furthermore, they provide competitive solutions in good execution time only for small-scale scenarios (e.g., in seconds for 50 nodes) but generally require an exorbitant amount of time to converge towards feasible solutions for medium-scale or even large-scale schemes. This paper proposes VAPNIC: an innovative approach that solves the VNF placement and chaining problem with lower algorithmic complexity using a disjoint-set data structure aided divide-and-conquer strategy. Our method's unique design is the non-use of any existing shortest path search algorithms to chain the virtual network functions. To the best of our knowledge, this is the first work that strives to tackle the placement and chaining of the VNFs from a distinctive perspective in the case of medium-and-large scale scenarios with a fast and scalable heuristic that exploits the divide-and-conquer design paradigm based on multi-branched recursion. Experimental results indicate that VAPNIC outperforms existing approaches in acceptance rate, resource utilization, scalability, and time efficiency.