Generating Virtual Network Embedding Problems With Guaranteed Solutions

The efficiency of network virtualization depends on the appropriate assignment of resources. The underlying problem, called virtual network embedding, has been much discussed in the literature, and many algorithms have been proposed, attempting to optimize the resource assignment in various respects. Evaluation of those algorithms requires a large number of randomly generated embedding scenarios. This paper presents a novel scenario generation approach and demonstrates how to produce scenarios with a guaranteed exact solution, thereby, facilitating better evaluation of embedding algorithms.

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

[2]  Catherine C. McGeoch.  Experimental analysis of algorithms , 1986 .

[3]  Laura A. Sanchis,et al.  Generating Hard and Diverse Test Sets for NP-hard Graph Problems , 1995, Discret. Appl. Math..

[4]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[5]  Ahmed Karmouch,et al.  Resource Discovery and Allocation in Network Virtualization , 2012, IEEE Communications Surveys & Tutorials.

[6]  Catherine C. McGeoch.  Feature Article - Toward an Experimental Method for Algorithm Simulation , 1996, INFORMS J. Comput..

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

[8]  Laura A. Sanchis,et al.  On the Complexity of Test Case Generation for NP-Hard Problems , 1990, Inf. Process. Lett..

[9]  Bobby Woolf,et al.  Enterprise Integration Patterns , 2003 .

[10]  Reha Uzsoy,et al.  Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial , 2001, J. Heuristics.

[11]  Sarang Bharadwaj Masti,et al.  VNA: An Enhanced Algorithm for Virtual Network Embedding , 2012, 2012 21st International Conference on Computer Communications and Networks (ICCCN).

[12]  Béla Bollobás,et al.  Random Graphs , 1985 .

[13]  Bernard M. E. Moret,et al.  DIMACS Series in Discrete Mathematics and Theoretical Computer Science Towards a Discipline of Experimental Algorithmics , 2022 .

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

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

[16]  Xavier Hesselbach,et al.  A distributed, parallel, and generic virtual network embedding framework , 2013, 2013 IEEE International Conference on Communications (ICC).

[17]  Hermann de Meer,et al.  Distributed and scalable embedding of virtual networks , 2015, J. Netw. Comput. Appl..

[18]  Cristina Cervello-Pastor,et al.  On the optimal allocation of virtual resources in cloud computing networks , 2013, IEEE Transactions on Computers.

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

[20]  Gerhard Wäscher,et al.  The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP , 1997 .

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

[22]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[23]  Xavier Hesselbach,et al.  Energy Efficient Virtual Network Embedding , 2012, IEEE Communications Letters.

[24]  Alain Delchambre,et al.  A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[25]  Andreas Fischer,et al.  A simulation framework for Virtual Network Embedding algorithms , 2014, 2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks).

[26]  Tilman Wolf,et al.  VNMBench: A Benchmark for Virtual Network Mapping Algorithms , 2012, 2012 21st International Conference on Computer Communications and Networks (ICCCN).

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

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

[29]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[30]  Symeon Papavassiliou,et al.  Socio-aware virtual network embedding , 2012, IEEE Network.

[31]  Gregor Hohpe,et al.  Enterprise Integration Patterns: Designing, Building, and Deploying Messaging Solutions , 2003 .

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

[33]  Symeon Papavassiliou,et al.  Resource discovery and allocation for federated virtualized infrastructures , 2015, Future Gener. Comput. Syst..

[34]  David S. Johnson,et al.  A theoretician's guide to the experimental analysis of algorithms , 1999, Data Structures, Near Neighbor Searches, and Methodology.

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

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

[37]  Balakrishnan Krishnamurthy,et al.  Constructing Test Cases for Partitioning Heuristics , 1987, IEEE Transactions on Computers.

[38]  Hermann de Meer,et al.  An approach to energy-efficient virtual network embeddings , 2013, 2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013).

[39]  Xavier Hesselbach,et al.  ALEVIN - A Framework to Develop, Compare, and Analyze Virtual Network Embedding Algorithms , 2011, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

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

[41]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

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

[43]  Hermann de Meer,et al.  Flexible VNE algorithms analysis using ALEVIN , 2011 .

[44]  Raouf Boutaba,et al.  Survivable Virtual Network Embedding , 2010, 2021 IFIP/IEEE International Symposium on Integrated Network Management (IM).

[45]  Matthias Hagen,et al.  Chapter 8. Experiments , 2010 .

[46]  Jiang Liu,et al.  Adaptive scheme based on status feedback for virtual network mapping , 2011 .

[47]  Catherine C. McGeoch.  Analyzing algorithms by simulation: variance reduction techniques and simulation speedups , 1992, CSUR.

[48]  Symeon Papavassiliou,et al.  Efficient Resource Mapping Framework over Networked Clouds via Iterated Local Search-Based Request Partitioning , 2013, IEEE Transactions on Parallel and Distributed Systems.

[49]  Catherine C. McGeoch.  A Guide to Experimental Algorithmics , 2012 .

[50]  Raouf Boutaba,et al.  ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping , 2012, IEEE/ACM Transactions on Networking.