Skip to main content

Advertisement

Log in

A memetic algorithm for the virtual network mapping problem

Journal of Heuristics Aims and scope Submit manuscript

Abstract

The Internet has ossified. It has lost its capability to adapt as requirements change. A promising technique to solve this problem is the introduction of network virtualization. Instead of directly using a single physical network, working just well enough for a limited range of applications, multiple virtual networks are embedded on demand into the physical network, each of them perfectly adapted to a specific application class. The challenge lies in mapping the different virtual networks with all the resources they require into the available physical network, which is the core of the virtual network mapping problem. In this work, we introduce a memetic algorithm that significantly outperforms the previously best algorithms for this problem. We also offer an analysis of the influence of different problem representations and in particular the implementation of a uniform crossover for the grouping genetic algorithm that may also be interesting outside of the virtual network mapping domain. Furthermore, we study the influence of different hybridization techniques and the behaviour of the developed algorithm in an online setting.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Alonso-Garrido, O., Salcedo-Sanz, S., Agustín-Blas, L.E., Ortiz-García, E.G., Pérez-Bellido, A.M., Portilla-Figueras, J.A.: A hybrid grouping genetic algorithm for the multiple-type access node location problem. In: Corchado, E., Yin, H. (eds.) Intelligent Data Engineering and Automated Learning—IDEAL 2009. Lecture Notes in Computer Science, vol. 5788, pp. 376–383. Springer, Berlin (2009)

    Chapter  Google Scholar 

  • Anderson, T., Peterson, L., Shenker, S., Turner, J.: Overcoming the internet impasse through virtualization. Computer 38(4), 34–41 (2005)

    Article  Google Scholar 

  • Berl, A., Fischer, A., de Meer, H.: Virtualisierung im future internet. Informatik-Spektrum 33, 186–194 (2010)

    Article  Google Scholar 

  • Brown, E.C., Sumichrast, R.T.: Impact of the replacement heuristic in a grouping genetic algorithm. Comput. Oper. Res. 30(11), 1575–1593 (2003)

    Article  MATH  Google Scholar 

  • Carlson, M., Weiss, W., Blake, S., Wang, Z., Black, D., Davies, E.: An Architecture for Differentiated Services. IETF, RFC 2475 (1998)

  • Chowdhury, N.M.M.K., Boutaba, R.: A survey of network virtualization. Comput. Netw. 54(5), 862–876 (2010)

    Article  MATH  Google Scholar 

  • Chowdhury, N.M.M.K., Rahman, M.R., Boutaba, R.: Virtual network embedding with coordinated node and link mapping. In: 28th IEEE International Conference on Computer Communications (INFOCOM 2009), IEEE. pp 783–791 (2009)

  • Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., Bowman, M.: PlanetLab: an overlay testbed for broad-coverage services. ACM SIGCOMM Comput. Commun. Rev. 33, 3–12 (2003)

    Article  Google Scholar 

  • Deering, S., Hinden, R.: Internet Protocol, Version 6 (IPv6) Specification, RFC 2460. http://tools.ietf.org/html/rfc2460 (1998)

  • Evelyn, C.B., Cliff, T.R., Arthur, E.C.: A grouping genetic algorithm for the multiple traveling salesperson problem. Int. J. Inf. Technol. Decis. Mak. 6(02), 333–347 (2007)

    Article  MATH  Google Scholar 

  • Fajjari, I., Aitsaadi, N., Pujolle, G., Zimmermann, H.: Adaptive-VNE: A flexible resource allocation for virtual network embedding algorithm. In: IEEE Global Communications Conference (GLOBECOM 2012), IEEE. pp 2640–2646 (2012)

  • Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: IEEE International Conference on Robotics and Automation, IEEE. pp 1186–1192 (1992)

  • Feltl, H., Raidl, G.R.: An improved hybrid genetic algorithm for the generalized assignment problem. In: Proceedings of the 2004 ACM Symposium on Applied Computing, ACM. pp 990–995 (2004)

  • GENInet.: Global Environment for Network Innovations. http://www.geni.net (2012)

  • Gold, R., Gunningberg, P., Tschudin, C.: A virtualized link layer with support for indirection. In: Proceedings of the ACM SIGCOMM Workshop on Future Directions in Network Architecture, ACM. pp 28–34 (2004)

  • Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multi-commodity flow. In: STOC ’01, ACM. pp 389–398. New York (2001)

  • Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  • Houidi, I., Louati, W., Zeghlache, D.: A Distributed virtual network mapping algorithm. In: IEEE International Conference on Communications (ICC ’08), IEEE. pp 5634–5640 (2008)

  • Inführ, J.: Optimization challenges of the future federated internet. PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria (2013)

  • Inführ, J., Raidl, G.R.: Introducing the virtual network mapping problem with delay, routing and location constraints. In: Pahl, J., Reiners, T., Voß, S. (eds.) Network Optimization: 5th International Conference (INOC 2011). Lecture Notes in Computer Science, 6701st edn, pp. 105–117. Springer, Hamburg, Germany (2011)

  • Inführ, J., Raidl, G.R.: The Virtual Network Mapping Problem Benchmark Set and Achieved Solutions by Heuristic and Exact Methods. https://www.ads.tuwien.ac.at/projects/optFI/ (2011b)

  • Inführ, J., Raidl, G.R.: A memetic algorithm for the virtual network mapping problem. In: Lau, H., Van Hentenryck, P., Raidl, G. (eds.) Proceedings of the 10th Metaheuristics International Conference, pp 28/1-28/10, Singapore (2013a)

  • Inführ, J., Raidl, G.R.: Solving the virtual network mapping problem with construction heuristics, local search, and variable neighborhood descent. In: Middendorf, M., Blum, C. (eds.) Evolutionary Computation in Combinatorial Optimisation - 13th European Conference, EvoCOP 2013. Lecture Notes in Computer Science, 7832nd edn, pp. 250–261. Springer, Berlin (2013)

  • Larrañaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif. Intell. Rev. 13, 129–170 (1999)

    Article  Google Scholar 

  • Lu, J., Turner, J.: Efficient Mapping of Virtual Networks Onto a Shared Substrate. Tech. rep. Washington University in St. Louis, (2006). WUCSE-2006-35

  • Moscato, P., Cotta, C.: A modern introduction to memetic algorithms. In: Gendreau, M., Potvin, J. (eds.) Handbook of Metaheuristics, International Series in Operations Research & Management Science, 146th edn, pp. 141–183. Springer, Berlin (2010)

    Google Scholar 

  • Moscato, P., Norman, M.G.: A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems. In: Proceedings of International Conference on Parallel Computing and Transputer Applications, vol. 1, pp. 177–186. IOS Press (1992)

  • National Research Council: Looking Over the Fence at Networks. National Academy Press, Washington, DC (2001)

    Google Scholar 

  • Qing, S., Qi, Q., Wang, J., Xu, T., Liao, J.: Topology-aware virtual network embedding through Bayesian network analysis. In: IEEE Global Communications Conference (GLOBECOM 2012), pp. 2621–2627. IEEE (2012)

  • Radcliffe, N., Surry, P.: Formal Memetic Algorithms. In: Fogarty, T. (ed.) Evolutionary Computing. Lecture Notes in Computer Science, vol. 865, pp. 1–16. Springer, Berlin (1994)

    Google Scholar 

  • Ramakrishnan, K.K., Floyd, S., Black, D.: The Addition of Explicit Congestion Notification (ECN) to IP. IETF, RFC. 3168 (2001)

  • Razzaq, A., Rathore, M.S.: An approach towards resource efficient virtual network embedding. In: Proceedings of the 2010 2nd International Conference on Evolving Internet, IEEE Computer Society, INTERNET ’10, pp 68–73 (2010)

  • Ricci, R., Alfeld, C., Lepreau, J.: A solver for the network testbed mapping problem. Spec. Interest Group Data Commun. Comput. Commun. Rev. 33(2), 65–81 (2003)

    Google Scholar 

  • Schwerdel, D., Günther, D., Henjes, R., Reuther, B., Müller, P.: German-lab experimental facility. In: Berre, A., Gómez-Pérez, A., Tutschku, K., Fensel, D. (eds.) Future Internet—FIS 2010. Lecture Notes in Computer Science, 6369th edn, pp. 1–10. Springer, Berlin (2010)

    Google Scholar 

  • Sivanandam, S.N., Deepa, S.N.: Introduction to Genetic Algorithms, 1st edn. Springer Publishing Company, Incorporated, Berlin (2007)

    MATH  Google Scholar 

  • Szeto, W., Iraqi, Y., Boutaba, R.: A multi-commodity flow based approach to virtual network resource allocation. In: Global Telecommunications Conference (GLOBECOM 2003), IEEE. vol. 6, pp. 3004–3008 (2003)

  • Touch, J., Wang, Y., Eggert, L., Finn, G.: A Virtual Internet Architecture. ISI Technical Report ISI-TR-2003-570 (2003)

  • Turner, J.S., Taylor, D.E.: Diversifying the internet. In: IEEE Global Telecommunications Conference (GLOBECOM 2005), IEEE. vol. 2, pp. 755–760 (2005)

  • Tutschku, K.: Towards the future internet: virtual networks for convergent services. e & i Elektrotechnik und Informationstechnik 126(7–8), 250–259 (2009)

    Article  Google Scholar 

  • Tutschku, K., Tran-Gia, P., Andersen, F.: Trends in network and service operation for the emerging future internet. AEU-Int. J. Electron. Commun. 62(9), 705–714 (2008)

    Article  Google Scholar 

  • Wang, Z., Han, Y., Lin, T., Tang, H., Ci, S.: Virtual network embedding by exploiting topological information. In: IEEE Global Communications Conference (GLOBECOM 2012), IEEE. pp 2603–2608 (2012)

  • Yeow, W., Westphal, C., Kozat, U.: Designing and embedding reliable virtual infrastructures. In: Proceedings of the Second ACM Special Interest Group on Data Communication Workshop on Virtualized Infrastructure Systems and Architectures, ACM. New York, NY, USA, VISA ’10. pp. 33–40 (2010)

  • Zhang, S., Wu, J., Lu, S.: Virtual network embedding with substrate support for parallelization. In: IEEE Global Communications Conference (GLOBECOM 2012), IEEE. pp. 2615–2620 (2012a)

  • Zhang, Z., Su, S., Niu, X., Ma, J., Cheng, X., Shuang, K.: Minimizing electricity cost in geographical virtual network embedding. In: IEEE Global Communications Conference (GLOBECOM 2012), IEEE. pp. 2609–2614 (2012b)

  • Zhu, Y., Ammar, M.: Algorithms for assigning substrate network resources to virtual network components. In: 25th IEEE International Conference on Computer Communications (INFOCOM 2006), IEEE. pp. 1–12 (2006)

Download references

Acknowledgments

This work has been funded by the Vienna Science and Technology Fund (WWTF) through project ICT10-027.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Johannes Inführ.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Inführ, J., Raidl, G. A memetic algorithm for the virtual network mapping problem. J Heuristics 22, 475–505 (2016). https://doi.org/10.1007/s10732-014-9274-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-014-9274-x

Keywords

Navigation