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
Computer
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
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
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
German-lab experimental facility
FIS'10 Proceedings of the Third future internet conference on Future internet
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
A cost efficient framework and algorithm for embedding dynamic virtual network requests
Future Generation Computer Systems
Hi-index | 0.00 |
Network virtualization is a main paradigm of Future Internet research. It allows for automatic creation of virtual networks with application specific resource management, routing, topology and naming. Since those virtual networks need to be implemented by means of the underlying physical network, the Virtual Network Mapping Problem (VNMP) arises. In this work, we introduce the Virtual Network Mapping Problem with Delay, Routing and Location Constraints (VNMP-DRL), a variant of the VNMP including some practically relevant aspects of Virtual Network Mapping that have not been considered before. We describe the creation of a benchmark set for the VNMP-DRL. The main goal was to include VNMP-DRL instances which are as realistic as possible, a goal we met by using parts of real network topologies to model the physical networks and by using different classes of virtual networks to model possible use-cases, instead of relying on random graphs. As a first approach, we solve the VNMP-DRL benchmark set by means of a multicommodity flow integer linear program.