Fig. 7
From: Centralized approaches for virtual network function placement in SDN-enabled networks
Performance (time taken) by the DCA and DCA-H algorithms for various parameters. The time taken by the DCA and DCA-H algorithms for various parameters are shown here. The number of nodes in the network (N), the heuristic parameter T used to limit the number of top allocations considered at each allocation step and the number of arriving requests are varied and the results are plotted here. The maximum feasible network size for various values of T are also shown. a Longer paths and function sequences. b Number of requests. c Various values of T. d Maximum practically feasible N vs T