Optimal VNF Placement: Addressing Multiple Min-Cost Solutions

  • Zahra Jahedi
  • Thomas KunzEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1118)


Network Function Virtualization (NFV) can lower the CAPEX and/or OPEX for service providers and allows to deploy services quickly. Randomly placing Network Functions (NF) in the network can cause excessive use of resources such as bandwidth (BW). Consequently, many researchers proposed optimal placement strategies, which place NFs with minimum cost while providing a requested Quality of Service (QoS) level. The cost is typically based on the usage of resources in the network such as BW, memory, etc.

In this paper, we use an Integer Linear Programming (ILP) model designed for the Virtual Network Function Embedding Problem (VNFEP) in wired and wireless networks and solve it with different solvers. We then solve the optimization problem for a sequence of arriving requests and measure acceptance ratio and placement costs. The results gathered from different solvers show different acceptance ratios while all the elements of the models such as the network topology, its available resources, and requested resources are the same. The underlying cause is that each of the solvers uses (potentially) a different optimal solution, as the optimization problem frequently has more than a single min-cost solution. Depending on the selected min-cost solution, the placement of future requests is impacted differently. Two approaches are discussed in this paper to deal with this issue. Firstly, we identify important factors in choosing between multiple min-cost solutions and design a heuristic which smartly selects among all available min-cost placement options. The results show that our heuristic provides a higher acceptance ratio compared to randomly choosing one of the min-cost solutions. Secondly, we provide a joint optimization model which provides an optimal placement of both previous and current requests at once. In this joint optimization model, a new request and previously placed requests will be placed in the network optimally. This may potentially cause a change in the placement of previously placed NFs. The results show that each approach has its advantages and disadvantages. We show in our results that both methods increase the acceptance ratio in comparison to any optimization method that uses the first optimal placement it finds.


Network function embedding problem Network function Network function virtualization Integer linear programming Linear programming solver 


  1. 1.
    AMPL: a modeling language for large-scale optimization. OR/MS Today 36(2), 68 (2009)Google Scholar
  2. 2.
    Ahvar, S., Phyu, H.P., Buddhacharya, S.M., Ahvar, E., Crespi, N., Glitho, R.: CCVP: Cost-efficient centrality-based VNF placement and chaining algorithm for network service provisioning, pp. 1–9. IEEE (2017)Google Scholar
  3. 3.
    Botero, J.F., Hesselbach, X., Duelli, M., Schlosser, D., Fischer, A., de Meer, H.: Energy efficient virtual network embedding. IEEE Commun. Lett. 16(5), 756–759 (2012)CrossRefGoogle Scholar
  4. 4.
    Bouet, M., Leguay, J., Combe, T., Conan, V.: Cost-based placement of vDPI functions in NFV infrastructures. Int. J. Netw. Manage. 25(6), 490–506 (2015)CrossRefGoogle Scholar
  5. 5.
    Chowdhury, N.M.K., Boutaba, R.: A survey of network virtualization. Comput. Netw. 54(5), 862–876 (2010). Scholar
  6. 6.
    Ghaznavi, M., Khan, A., Shahriar, N., Alsubhi, K., Ahmed, R., Boutaba, R.: Elastic virtual network function placement, pp. 255–260. IEEE (2015)Google Scholar
  7. 7.
    Jahedi, Z., Kunz, T.: Virtual network function embedding in multi-hop wireless networks. In: Proceedings of the 15th International Joint Conference on e-Business and Telecommunications, ICETE 2018, - Volume 1: DCNET, ICE-B, OPTICS, SIGMAP and WINSYS, Porto, Portugal, 26–28 July 2018, pp. 199–207 (2018).
  8. 8.
    Jain, K., Padhye, J., Padmanabhan, V.N., Qiu, L.: Impact of interference on multi-hop wireless network performance. Wireless Netw. 11(4), 471–487 (2005)CrossRefGoogle Scholar
  9. 9.
    Kunz, T., Mahmood, K., Li, L.: Broadcasting in multihop wireless networks: the case for multi-source network coding. In: IEEE International Conference on Communications (ICC), pp. 5157–5162. IEEE (2012)Google Scholar
  10. 10.
    Luizelli, M.C., Bays, L.R., Buriol, L.S., Barcellos, M.P., Gaspary, L.P.: Piecing together the NFV provisioning puzzle: efficient placement and chaining of virtual network functions, pp. 98–106. IEEE (2015)Google Scholar
  11. 11.
    Lv, P., Wang, X., Xu, M.: Virtual access network embedding in wireless mesh networks. Ad Hoc Netw. 10(7), 1362–1378 (2012)CrossRefGoogle Scholar
  12. 12.
    Ma, W., Beltran, J., Pan, Z., Pan, D., Pissinou, N.: Sdn-based traffic aware placement of NFV middleboxes. IEEE Trans. Netw. Serv. Manage. 14(3), 528–542 (2017)CrossRefGoogle Scholar
  13. 13.
    Mohammadkhan, A., Ghapani, S., Liu, G., Zhang, W., Ramakrishnan, K.K., Wood, T.: Virtual function placement and traffic steering in flexible and dynamic software defined networks. In: The 21st IEEE International Workshop on Local and Metropolitan Area Networks, pp. 1–6. IEEE (2015)Google Scholar
  14. 14.
    Park, K., Kim, C.: A framework for virtual network embedding in wireless networks. In: 4th International Conference on Future Internet Technologies, pp. 5–7. ACM (2009)Google Scholar
  15. 15.
    Riggio, R., Bradai, A., Rasheed, T., Schulz-Zander, J., Kuklinski, S., Ahmed, T.: Virtual network functions orchestration in wireless networks. In: 11th International Conference on Network and Service Management (CNSM), pp. 108–116. IFIP (2015)Google Scholar
  16. 16.
    Sahhaf, S., et al.: Network service chaining with optimized network function embedding supporting service decompositions. The 21st IEEE International Workshop on Local and Metropolitan Area Networks, vol. 93, pp. 492–505 (2015)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Carleton UniversityOttawaCanada

Personalised recommendations