Advertisement

On Force-Based Placement of Distributed Services within a Substrate Network

  • Laurie Lallemand
  • Andreas Reifert
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6164)

Abstract

Network Virtualization Environments have great potential for overcoming the current ossification of the Internet, fostering innovation, and allowing several concurrent architectures to run on the same physical network. This paper presents a novel physically inspired algorithm for efficiently solving the virtual network embedding problem of placing a virtual network over a substrate network. Compared to a reference heuristic, our algorithm shows lower rejection rates and improved substrate network utilization.

Keywords

Problem Instance Rejection Rate Virtual Network Elastic Band Bandwidth Consumption 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [AP1]
    Anderson, T., Peterson, L., Shenker, S., Turner, J.: Overcoming the Internet Impasse through Virtualization. IEEE Computer 38(4), 34–41 (2005)Google Scholar
  2. [CB1]
    Chowdhury, N.M.M.K., Boutaba, R.: A survey of network virtualization. Computer Networks 54(5), 862–876 (2010)zbMATHCrossRefGoogle Scholar
  3. [CR1]
    Chowdhury, N.M.M.K., Rahman, M.R., Boutaba, R.: Virtual Network Embedding with Coordinated Node and Link Mapping. IEEE Conference on Computer Communications (INFOCOM 2009), April 19-25, pp. 783–791(2009)Google Scholar
  4. [ER1]
    Erdös, P., Rényi, A.: On Random Graphs. Publicationes Mathematicae Debrecen 6, 290–297 (1959)zbMATHMathSciNetGoogle Scholar
  5. [FR1]
    Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper. 21(11), 1129–1164 (1991)CrossRefGoogle Scholar
  6. [HL1]
    Houidi, I., Louati, W., Zeghlache, D.: A Distributed Virtual Network Mapping Algorithm. In: IEEE Conference on Computer Communications (ICC 2008), May 19-23, pp.5634–5640 (2008)Google Scholar
  7. [KK1]
    Kamada, T., Kawai, S.: An Algorithm for Drawing General Undirected Graphs. Inf. Process. Lett. (1), 7–15 (April 1989)CrossRefMathSciNetGoogle Scholar
  8. [Ko1]
    Konrad-Zuse-Zentrum für Informationstechnik Berlin: SCIP—Solving Constraint Integer Programs, http://scip.zib.de/
  9. [LK1]
    Lischka, J., Karl, H.: A Virtual Network Mapping Algorithm based on Subgraph Isomorphism Detection. In: Proceedings of the 1st ACM workshopobn Virtualized infrastructure systems and architectures (VISA 2009), August 17, pp.81–88 (2009)Google Scholar
  10. [LT1]
    Lu, J., Turner, J.: Efficient Mapping of Virtual Networks onto a Shared Substrate (2006)Google Scholar
  11. [PA1]
    Peterson, L., Anderson, T., Blumenthal, D., Casey, D., Clark, D., Estrin, D., Evans, J., Raychaudhuri, D., Reiter, M., Rexford, J., Shenker, S., Wroclawski, J.: GENI Design Principles. IEEE Computer 39(9), 102–105 (2006)Google Scholar
  12. [RA1]
    Ricci, R., Alfeld, C., Lepreau, J.: A Solver for the Network Testbed Mapping Problem. ACM SIGCOMM Computer Communications Review 33(2), 65–81 (2003)CrossRefGoogle Scholar
  13. [TT1]
    Turner, J.S., Taylor, D.E.: Diversifying the Internet. In: IEEE Global Telecommunications Conference (GLOBECOM 2005), November 28-December 2, pp. 755–760 (2005)Google Scholar
  14. [Wa1]
    Waxman, B.M.: Routing of Multipoint Connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1988)CrossRefGoogle Scholar
  15. [YY1]
    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)CrossRefGoogle Scholar
  16. [ZA1]
    Zhu, Y., Ammar, M.H.: Algorithms for Assigning Substrate Network Resources to Virtual Network Components. In: INFOCOM 25th IEEE International Conference on Computer Communications, Proceedings, pp. 1–12 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Laurie Lallemand
    • 1
  • Andreas Reifert
    • 1
  1. 1.Institute of Communication Networks and Computer Engineering (IKR)University of StuttgartStuttgartGermany

Personalised recommendations