Optimal mapping of virtual networks with hidden hops

Network virtualization has emerged as a solution for the Internet inability to address the required challenges caused by the lack of coordination among Internet service providers for the deployment of new services. The allocation of resources is one of the main problems in network virtualization, mainly in the mapping of virtual nodes and links to specific substrate nodes and paths, also known as the virtual network embedding problem. This paper proposes an algorithm based on optimization theory, to map the virtual links and nodes requiring a specific demand, looking for the maximization of the spare bandwidth and spare CPU in the substrate network, taking into account the CPU demanded by the hidden hops when a virtual link is mapped. The components of the virtual networks (nodes and links) that do not ask for an specific demand are then allocated following a fairness criteria.

[1]  Jonathan S. Turner,et al.  Efficient Mapping of Virtual Networks onto a Shared Substrate , 2006 .

[2]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[3]  Phuoc Tran-Gia,et al.  Network Virtualization: Implementation Steps Towards the Future Internet , 2009, KiVS 2009.

[4]  Raouf Boutaba,et al.  Network virtualization: state of the art and research challenges , 2009, IEEE Communications Magazine.

[5]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[6]  X. Hesselbach,et al.  The Impact over the Packets Sequence at the Output Interface in Load Balancing Strategies , 2006, 2006 International Conference on Transparent Optical Networks.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Stephen T. Kent,et al.  Security Architecture for the Internet Protocol , 1998, RFC.

[9]  Raouf Boutaba,et al.  Virtual Network Embedding with Coordinated Node and Link Mapping , 2009, IEEE INFOCOM 2009.

[10]  Andreas Berl,et al.  Using System Virtualization to Create Virtualized Networks , 2009, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[11]  Klaus Wehrle,et al.  Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science) , 2005 .

[12]  조영기,et al.  원편파 변환 주파수 선택 반사기 설계 ( Design of the frequency selective surface with transformation of linear-to-circular polarization ) , 2001 .

[13]  Yong Zhu,et al.  Algorithms for Assigning Substrate Network Resources to Virtual Network Components , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[15]  Minlan Yu,et al.  Rethinking virtual network embedding: substrate support for path splitting and migration , 2008, CCRV.

[16]  Krzysztof Walkowiak,et al.  New Algorithms for the Unsplittable Flow Problem , 2006, ICCSA.

[17]  Raouf Boutaba,et al.  ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping , 2012, IEEE/ACM Transactions on Networking.

[18]  Anja Feldmann,et al.  Implementing Network Virtualization for a Future Internet , 2009 .

[19]  Scott Shenker,et al.  Overcoming the Internet impasse through virtualization , 2005, Computer.

[20]  Hugo Krawczyk,et al.  A Security Architecture for the Internet Protocol , 1999, IBM Syst. J..

[21]  Klaus Wehrle,et al.  Peer-to-Peer Systems and Applications , 2005, Peer-to-Peer Systems and Applications.

[22]  Hugo Krawczyk,et al.  A Security Architecture for the Internet Protocol , 1999, IBM Syst. J..