Fig. 5From: Centralized approaches for virtual network function placement in SDN-enabled networksSample run of the heuristic algorithm for dynamic NFP. The allocation of VNFs for a given incoming request along a given candidate path chosen by the hybrid Dijkstra’s algorithm is shown. In this example, it is assumed that VNF \(\bigstar \) is already allocated on Node 4 and the request is handled using Divide-and-Conquer method. a Path assuming \(\bigstar \) allocated on 4. b After allocating \(\bigstar \) on 4. c After allocating ■on 2. d After allocating \(\blacktriangle \) on 7Back to article page