Abstract
The Network Function Virtualization (NFV) paradigm enables new flexibility and possibilities in the deployment and operation of network services. Finding the best arrangement of such service chains poses new optimization problems, comprising a combination of placement and routing decisions. While there are many algorithms on this topic proposed in literature, this work is focused on their evaluation and on the choice of reference for meaningful assessments. Our contribution comprises two problem generation strategies with predefined optima for benchmarking purposes, supplemented by an integer program to obtain optimal solutions in arbitrary graphs, as well as a general overview of concepts and methodology for solving and evaluating problems. In addition, a short evaluation demonstrates their applicability and shows possible directions for future work in this area.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Network Functions Virtualisation – Update White Paper (2013). https://portal.etsi.org/NFV/NFV_White_Paper2.pdf
Bari, M.F., Chowdhury, S.R., Ahmed, R., Boutaba, R.: On orchestrating virtual network functions. In: 2015 11th International Conference on Network and Service Management (CNSM), pp. 50–56 (2015)
Lange, S., Grigorjew, A., Zinner, T., Tran-Gia, P., Jarschel, M.: A multi-objective heuristic for the optimization of virtual network function chain placement. In: 29th International Teletraffic Congress (ITC 29), pp. 152–160 (2017)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. In: IEEE Transactions on Evolutionary Computation, pp. 117–132 (2003)
Knowles, J., Thiele, L., Zitzler, E.: A tutorial on the performance assessment of stochastic multiobjective optimizers. Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Switzerland, Technical report 214, February 2006. http://www.tik.ee.ethz.ch/pisa/?page=bugs.php
Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Theory of the hypervolume indicator: optimal \(\mu \)-distributions and the choice of the reference point. In: Proceedings of the Tenth ACM SIGEVO Workshop on Foundations of Genetic Algorithms, pp. 87–102. ACM (2009)
Zuse-Institute Berlin (ZIB): SNDlib: Survivable fixed telecommunication network design library. http://sndlib.zib.de/. Accessed 29 Oct 2017
Moens, H., De Turck, F.: VNF-P: a model for efficient placement of virtualized network functions. In: 10th International Conference on Network and Service Management (CNSM) and Workshop, pp. 418–423 (2014)
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. In: IFIP/IEEE International Symposium on Integrated Network Management (IM), pp. 98–106 (2015)
Luizelli, M.C., da Costa Cordeiro, W.L., Buriol, L.S., Gaspary, L.P.: A fix-and-optimize approach for efficient and large scale virtual network function placement and chaining. Comput. Commun. 102, 67–77 (2017)
Albert, R., Barabási, A.-L.: Topology of evolving networks: local events and universality. Phys. Rev. Lett. 85(24), 5234–5237 (2000)
Mehraghdam, S., Keller, M., Karl, H.: Specifying and placing chains of virtual network functions. In: 3rd International Conference on Cloud Networking (CloudNet), pp. 7–13 (2014)
Sahhaf, S., Tavernier, W., Rost, M., Schmid, S., Colle, D., Pickavet, M., Demeester, P.: Network service chaining with optimized network function embedding supporting service decompositions. Comput. Netw. 93, 492–505 (2015)
Knight, S., Nguyen, H.X., Falkner, N., Bowden, R., Roughan, M.: The internet topology zoo. IEEE JSAC 29(9), 1765–1775 (2011)
Dwaraki, A., Wolf, T.: Adaptive service-chain routing for virtual network functions in software-defined networks. In: Proceedings of the 2016 workshop on Hot Topics in Middleboxes and Network Function Virtualization, pp. 32–37 (2016)
Mijumbi, R., Serrat, J., Gorricho, J., Bouten, N., De Turck, F., Davy, S.: Placement and scheduling of functions in network function virtualization, arXiv preprint arXiv:1512.00217 (2015)
Waxman, B.M.: Routing of multipoint connections. IEEE J, Sel. Areas Commun. 6(9), 1617–1622 (1988)
Rost, M., Schmid, S.: Service chain and virtual network embeddings: Approximations using randomized rounding, arXiv preprint arXiv:1604.02180 (2016)
Lukovszki, T., Schmid, S.: Online admission control and embedding of service chains. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 104–118. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25258-2_8
Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable Test Problems for Evolutionary Multiobjective Optimization. Springer, London (2005). https://doi.org/10.1007/1-84628-137-7_6
Huband, S., Barone, L., While, R.L., Hingston, P.: A scalable multi-objective test problem toolkit. In: EMO, vol. 3410, pp. 280–295 (2005)
Huband, S., Hingston, P., Barone, L., While, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477–506 (2006)
Fischer, A., Botero, J.F., Beck, M.T., De Meer, H., Hesselbach, X.: Virtual network embedding: a survey. IEEE Commun. Surv. Tutor. 15(4), 1888–1906 (2013)
Fajjari, I., Aitsaadi, N., Pujolle, G., Zimmermann, H.: VNR algorithm: a greedy approach for virtual networks reconfigurations. In: Global Telecommunications Conference (GLOBECOM), pp. 1–6 (2011)
Fischer, A., de Meer, H.: Generating virtual network embedding problems with guaranteed solutions. IEEE Trans. Netw. Serv. Manag. 13(3), 504–517 (2016)
Acknowledgments
This work has been performed in the framework of the CELTIC EUREKA project SENDATE-PLANETS (Project ID C2015/3-1), and it is partly funded by the German BMBF (Project ID 16KIS0474). The authors alone are responsible for the content of the paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Grigorjew, A., Lange, S., Zinner, T., Tran-Gia, P. (2018). Performance Benchmarking of Network Function Chain Placement Algorithms. In: German, R., Hielscher, KS., Krieger, U. (eds) Measurement, Modelling and Evaluation of Computing Systems. MMB 2018. Lecture Notes in Computer Science(), vol 10740. Springer, Cham. https://doi.org/10.1007/978-3-319-74947-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-74947-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74946-4
Online ISBN: 978-3-319-74947-1
eBook Packages: Computer ScienceComputer Science (R0)