Nodes clustering and dynamic service balance awareness based virtual network embedding

Network virtualization is an important technique to allow multiple customized networks to cohabit on a shared substrate network. In order to put the network virtualization into practice, the virtual network embedding (VNE) problem that searching an efficient mapping of a virtual network request onto substrate network resources should be solved primarily. Since the VNE problem is known to be NP-hard, previous work focused on designing heuristic-based algorithms. In this paper, we proposed the nodes clustering and dynamic service balance awareness based virtual network embedding (NC-DSBA) that employs the divide-and-conquer strategy along with the concurrence policy. Besides, the proposed NC-DSBA introduced a dynamic service balance algorithm to assist the embedding and improve the efficiency. The simulation results show that the NC-DSBA reduces the computational complexity, increases the acceptance ratio and revenue-cost ratio, and balances the loads of virtual nodes and links in substrate network in the long run.

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

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

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

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

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

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

[7]  Jie Wu,et al.  Virtual Network Embedding with Opportunistic Resource Sharing , 2014, IEEE Transactions on Parallel and Distributed Systems.

[8]  Raouf Boutaba,et al.  SVNE: Survivable Virtual Network Embedding Algorithms for Network Virtualization , 2013, IEEE Transactions on Network and Service Management.

[9]  Xavier Hesselbach,et al.  Virtual Network Embedding: A Survey , 2013, IEEE Communications Surveys & Tutorials.

[10]  Clifford Stein,et al.  Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

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