Virtual network embedding with border matching

A major challenge in virtual network embedding is to find an efficient mapping of each virtual network (VN) to the nodes and links in the substrate network (SN) so that the residual SN can host as many VN requests as possible. This network optimization problem has been shown to be NP hard. In this paper we propose a “border matching” mechanism in VN embedding, which is shown to outperform a number of existing VN embedding algorithms. In particular, we devise an iterative algorithm called “VNE-B”. Typical VN embedding algorithms may cause fragmentations of the substrate network, i.e. the substrate resources are fragmented into small isolated pieces, making it unable to meet larger future VN requests. VNE-B starts the mapping from the “border” nodes of both VNs and the SN for reducing fragmentation of SN resources. Our experimental evaluations show that VN embedding algorithms with VNE-B result in more efficient mappings and thus fewer rejections for VN requests. We also visualize the residual SN to demonstrate the effectiveness of VNE-B.

[1]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[2]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

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

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

[5]  Abraham Silberschatz,et al.  Operating System Concepts with Java , 2006 .

[6]  Mario Vento,et al.  Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs , 1997, GbRPR.

[7]  Mostafa H. Ammar,et al.  Dynamic Topology Configuration in Service Overlay Networks: A Study of Reconfiguration Policies , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  P. Foggia,et al.  Performance evaluation of the VF graph matching algorithm , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

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

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

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

[12]  Mario Vento,et al.  An Improved Algorithm for Matching Large Graphs , 2001 .

[13]  Guru Parulkar,et al.  Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures , 2009, SIGCOMM 2009.

[14]  P. Foggia,et al.  Fast graph matching for detecting CAD image components , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

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

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

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

[18]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[19]  Alfs T. Berztiss,et al.  A Backtrack Procedure for Isomorphism of Directed Graphs , 1973, JACM.

[20]  Gary J. Nutt.  Operating systems - a modern perspective , 1997 .

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

[22]  Albert G. Greenberg,et al.  Resource management with hoses: point-to-cloud services for virtual private networks , 2002, TNET.

[23]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.