Breaking the atomicity of virtual network embedding

Network virtualization currently becomes an important technology in optimizing resource management in a datacenter. The major research issue in this area is the virtual network embedding problem (VNEP) concerned with mapping virtual networks (VNs) onto a shared substrate network (SN) with some constrains satisfied. In this paper, by proposing the new concepts of “node sharing” and “partially accepting”, we try to break the “atomicity” of the traditional solutions of VNEP, which usually treat a VN request as an inseparable whole. We consider a more realistic scenario where virtual nodes in a VN request are of different importance and accordingly devise a mapping algorithm called Best Effort Algorithm (BEA). Our algorithm can make the most of the resources through node sharing at idle period of the substrate network and provide the best-effort mapping by partially accepting VN requests when physical resources become scarce. Final simulations demonstrate the effectiveness of our algorithm and show that our novel ideas can lead to higher acceptance ratio and long-term average revenue.

[1]  Gustavo Prado Alkmim,et al.  Optimal Mapping of Virtual Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[2]  Nancy Samaan,et al.  Hierarchical Approach for Efficient Virtual Network Embedding Based on Exact Subgraph Matching , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[3]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[4]  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.

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

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

[7]  Jie Wang,et al.  Virtual network embedding with border matching , 2012, 2012 Fourth International Conference on Communication Systems and Networks (COMSNETS 2012).

[8]  Jonathan S. Turner,et al.  Diversifying the Internet , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

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

[10]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[11]  Holger Karl,et al.  A virtual network mapping algorithm based on subgraph isomorphism detection , 2009, VISA '09.

[12]  Cong Wang,et al.  Virtual network mapping with traffic matrices , 2012, ICC.

[13]  Djamal Zeghlache,et al.  A Distributed Virtual Network Mapping Algorithm , 2008, 2008 IEEE International Conference on Communications.

[14]  Lieguang Zeng,et al.  A virtual network embedding scheme with two-stage node mapping based on physical resource migration , 2010, 2010 IEEE International Conference on Communication Systems.

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

[16]  Xiang Cheng,et al.  Virtual network embedding through topology-aware node ranking , 2011, CCRV.

[17]  Raouf Boutaba,et al.  A survey of network virtualization , 2010, Comput. Networks.

[18]  Jie Wu,et al.  An Opportunistic Resource Sharing and Topology-Aware mapping framework for virtual networks , 2012, 2012 Proceedings IEEE INFOCOM.