Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
Modeling and solving the rooted distance-constrained minimum spanning tree problem
Computers and Operations Research
A Distributed and Autonomic Virtual Network Mapping Framework
ICAS '08 Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems
A survey of network virtualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
Designing and embedding reliable virtual infrastructures
Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures
An Approach towards Resource Efficient Virtual Network Embedding
INTERNET '10 Proceedings of the 2010 2nd International Conference on Evolving Internet
German-lab experimental facility
FIS'10 Proceedings of the Third future internet conference on Future internet
Introducing the virtual network mapping problem with delay, routing and location constraints
INOC'11 Proceedings of the 5th international conference on Network optimization
| Hi-index | 0.00 |
The Virtual Network Mapping Problem arises in the context of Future Internet research. Multiple virtual networks with different characteristics are defined to suit specific applications. These virtual networks, with all of the resources they require, need to be realized in one physical network in a most cost effective way. Two properties make this problem challenging: Already finding any valid mapping of all virtual networks into the physical network without exceeding the resource capacities is NP-hard, and the problem consists of two strongly dependent stages as the implementation of a virtual network's connections can only be decided once the locations of the virtual nodes in the physical network are fixed. In this work we introduce various construction heuristics, Local Search and Variable Neighborhood Descent approaches and perform an extensive computational study to evaluate the strengths and weaknesses of each proposed solution method.