Virtual Network Embedding: Reducing the Search Space by Model Transformation Techniques

Virtualization is a promising technology to enhance the scalability and utilization of data centers for managing, developing, and operating network functions. Furthermore, it allows to flexibly place and execute virtual networks and machines on physical hardware. The problem of mapping a virtual network to physical resources, however, is known to be \(\mathcal {NP}\)-hard and is often tackled by optimization techniques, e.g., by (ILP). On the one hand, highly tailored approaches based on heuristics significantly reduce the search space of the problem for specific environments and constraints, which, however, are difficult to transfer to other scenarios. On the other hand, ILP-based solutions are highly customizable and correct by construction with a huge search space. To mitigate search space problems while still guaranteeing correctness, we propose a combination of model transformation and ILP techniques. This combination is highly customizable and extensible in order to support multiple network domains, environments, and constraints allowing for rapid prototyping in different settings of virtualization tasks. Our experimental evaluation, finally, confirms that model transformation reduces the size of the optimization problem significantly and consequently the required runtime while still retaining the quality of mappings.

[1]  H. Sahraoui,et al.  Model Transformation as an Optimization Problem , 2008, MoDELS.

[2]  Edoardo Amaldi,et al.  On the computational complexity of the virtual network embedding problem , 2016, Electron. Notes Discret. Math..

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

[4]  Stenio F. L. Fernandes,et al.  High-level modeling and application validation for SDN , 2016, NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium.

[5]  Helen J. Wang,et al.  SecondNet: a data center network virtualization architecture with bandwidth guarantees , 2010, CoNEXT.

[6]  Uwe Pohlmann,et al.  Model-Driven Allocation Engineering (T) , 2015, 2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE).

[7]  Andy Schürr,et al.  Specification of Graph Translators with Triple Graph Grammars , 1994, WG.

[8]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[9]  Lisandro Zambenedetti Granville,et al.  Data Center Network Virtualization: A Survey , 2013, IEEE Communications Surveys & Tutorials.

[10]  Andy Schürr,et al.  Inter-model Consistency Checking Using Triple Graph Grammars and Linear Optimization Techniques , 2017, FASE.

[11]  Lin Wang,et al.  Model-driven Development of Virtual Network Embedding Algorithms with Model Transformation and Linear Optimization Techniques , 2018, Modellierung.

[12]  Hitesh Ballani,et al.  Towards predictable datacenter networks , 2011, SIGCOMM 2011.

[13]  Max Mühlhäuser,et al.  A systematic approach to constructing incremental topology control algorithms using graph transformation , 2017, J. Vis. Lang. Comput..

[14]  Didier Colle,et al.  Network service chaining with optimized network function embedding supporting service decompositions , 2015, Comput. Networks.

[15]  Yongan Guo,et al.  An exact virtual network embedding algorithm based on integer linear programming for virtual network request with location constraint , 2016, China Communications.

[16]  Victor C. M. Leung,et al.  Optimal VM placement in data centres with architectural and resource constraints , 2015, Int. J. Auton. Adapt. Commun. Syst..