Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Hybrid Metaheuristics

HM 2013: Hybrid Metaheuristics pp 159–173Cite as

GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7919))

Abstract

Virtual network mapping considers the problem of fitting multiple virtual networks into one physical network in a cost-optimal way. This problem arises in Future Internet research. One of the core ideas is to utilize different virtual networks to cater to different application classes, each with customized protocols that deliver the required Quality-of- Service. In this work we introduce a Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Search (VNS) algorithm for solving the Virtual Network Mapping Problem. Both algorithms make use of a Variable Neighborhood Descent with ruin-and-recreate neighborhoods. We show that the VNS approach significantly outperforms the previously best known algorithms for this problem.

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

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. GENI.net Global Environment for Network Innovations, http://www.geni.net

  2. Andersen, D.: Theoretical Approaches to Node Assignment. Unpublished Manuscript (December 2002), http://www.cs.cmu.edu/~dga/papers/andersen-assign.ps

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

    Article  Google Scholar 

  4. Berl, A., Fischer, A., de Meer, H.: Virtualisierung im Future Internet. Informatik-Spektrum 33, 186–194 (2010)

    Article  Google Scholar 

  5. Carlson, M., Weiss, W., Blake, S., Wang, Z., Black, D., Davies, E.: An architecture for differentiated services. IETF, RFC 2475 (1998)

    Google Scholar 

  6. Chowdhury, N., Boutaba, R.: A survey of network virtualization. Computer Networks 54(5), 862–876 (2010)

    Article  MATH  Google Scholar 

  7. Chowdhury, N., Rahman, M., Boutaba, R.: Virtual network embedding with coordinated node and link mapping. In: INFOCOM 2009, pp. 783–791. IEEE (2009)

    Google Scholar 

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

    Article  Google Scholar 

  9. Deering, S., Hinden, R.: Internet protocol, version 6 (ipv6) specification (December 1998), http://tools.ietf.org/html/rfc2460

  10. Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Festa, P., Resende, M.: An annotated bibliography of grasp–part i: Algorithms. International Transactions in Operational Research 16(1), 1–24 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Festa, P., Resende, M.G.C.: Hybrid GRASP heuristics. In: Abraham, A., Hassanien, A.-E., Siarry, P., Engelbrecht, A. (eds.) Foundations of Computational Intelligence Volume 3. SCI, vol. 203, pp. 75–100. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Hansen, P., Mladenović, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449–467 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hansen, P., Mladenović, N., Moreno Pérez, J.: Variable neighbourhood search: methods and applications. 4OR 6, 319–360 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. IBM ILOG: CPLEX 12.4, http://www-01.ibm.com/software/integration/optimization/cplex-optimizer

  16. Inführ, J., Raidl, G.R.: The Virtual Network Mapping Problem benchmark set, https://www.ads.tuwien.ac.at/projects/optFI/

  17. 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.) INOC 2011. LNCS, vol. 6701, pp. 105–117. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. Inführ, J., Raidl, G.R.: A memetic algorithm for the virtual network mapping problem. In: Lau, H., Van Hentenryck, P., Raidl, G. (eds.) The 10th Metaheuristics International Conference, MIC13, Singapore (2013), submitted for review

    Google Scholar 

  19. 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.) EvoCOP 2013. LNCS, vol. 7832, pp. 250–261. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  20. National Research Council: Looking Over the Fence at Networks. National Academy Press (2001)

    Google Scholar 

  21. Ramakrishnan, K.K., Floyd, S., Black, D.: The addition of explicit congestion notification (ECN) to IP. IETF, RFC 3168 (2001)

    Google Scholar 

  22. Resende, M., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Handbook of Metaheuristics, pp. 219–249 (2003)

    Google Scholar 

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

    Article  Google Scholar 

  24. Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics 159(2), 139–171 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  25. Schwerdel, D., Günther, D., Henjes, R., Reuther, B., Müller, P.: German-lab experimental facility. In: Berre, A.J., Gómez-Pérez, A., Tutschku, K., Fensel, D. (eds.) FIS 2010. LNCS, vol. 6369, pp. 1–10. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

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

    Google Scholar 

  27. Yeow, W.L., Westphal, C., Kozat, U.: Designing and embedding reliable virtual infrastructures. In: Proceedings of the Second ACM SIGCOMM Workshop on Virtualized Infrastructure Systems and Architectures, VISA 2010, pp. 33–40. ACM, New York (2010)

    Chapter  Google Scholar 

  28. Yu, M., Yi, Y., Rexford, J., Chiang, M.: Rethinking virtual network embedding: substrate support for path splitting and migration. ACM SIGCOMM Computer Communication Review 38(2), 17–29 (2008)

    Article  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vienna University of Technology, Favoritenstraße 9-11/1861, 1040, Vienna, Austria

    Johannes Inführ & Günther R. Raidl

Authors
  1. Johannes Inführ
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Günther R. Raidl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Omega 213 Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    María J. Blesa

  2. IKERBASQUE, Basque Foundation for Science, Department of Computer Science and Artificial Intelligence, University of the Basque Country, Paseo Manuel Lardizabal 1, 20018, San Sebastian, Spain

    Christian Blum

  3. Department of Mathematics and Applications “R. Caccioppoli”, Compl. M.S.A., University of Naples Federico II, Via Cintia, 80126, Naples, Italy

    Paola Festa

  4. DISI, Università di Bologna, Campus of Cesena, Via Venezia 52, 47521, Cesena, Italy

    Andrea Roli

  5. IRIDIA CP 194/6, Université Libre de Bruxelles, Avenue Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Inführ, J., Raidl, G.R. (2013). GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem. In: Blesa, M.J., Blum, C., Festa, P., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2013. Lecture Notes in Computer Science, vol 7919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38516-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38516-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38515-5

  • Online ISBN: 978-3-642-38516-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation