Virtual network embedding with substrate support for parallelization

Network virtualization has been the focus of intense research interest and is a promising approach to overcome the ossification of the Internet. A major challenge with network virtualization is virtual network embedding, which deals with the efficient embedding of virtual networks with resource constraints into a substrate network. Many research results have been reported regarding this problem. However, there hasn't been any focus on virtual network embedding with substrate support for parallelization, i.e., the substrate network supports parallel computation and allows a virtual node to be mapped into multiple substrate nodes. This paper is the first attempt at gaining a better understanding on how parallelization benefits embedding. We present a formal problem description and propose two algorithms that capitalize parallelism. Several extensions are developed to complement the proposed algorithms. From experimental results, the effectiveness and usefulness of the algorithms and extensions are confirmed.

[1]  Robert Ricci,et al.  A solver for the network testbed mapping problem , 2003, CCRV.

[2]  Jie Wu,et al.  Opportunistic Bandwidth Sharing for Virtual Network Mapping , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

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

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

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

[6]  Raouf Boutaba,et al.  Topology-Awareness and Reoptimization Mechanism for Virtual Network Embedding , 2010, Networking.

[7]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[8]  Raouf Boutaba,et al.  PolyViNE: policy-based virtual network embedding across multiple domains , 2010, VISA '10.

[9]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

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

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

[12]  Lixin Gao,et al.  How to lease the internet in your spare time , 2007, CCRV.

[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]  Raouf Boutaba,et al.  Virtual Network Embedding with Coordinated Node and Link Mapping , 2009, IEEE INFOCOM 2009.

[15]  Song Guo,et al.  FELL: A Flexible Virtual Network Embedding Algorithm with Guaranteed Load Balancing , 2011, 2011 IEEE International Conference on Communications (ICC).

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

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

[18]  David G. Andersen,et al.  Theoretical Approaches to Node Assignment , 2002 .

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

[20]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[21]  Djamal Zeghlache,et al.  Adaptive virtual network provisioning , 2010, VISA '10.

[22]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).