Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
From MaRDI portal
Publication:693801
DOI10.1155/2012/358647zbMATH Open1253.68034OpenAlexW2099159281WikidataQ58908523 ScholiaQ58908523MaRDI QIDQ693801FDOQ693801
Authors: Adil Razzaq, Markus Hidell, Peter Sjödin 
Publication date: 11 December 2012
Published in: Journal of Electrical and Computer Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/358647
Recommendations
- Compact and extended formulations for the virtual network embedding problem
- Novel node-ranking approach for SDN-based virtual network embedding
- Competitive and deterministic embeddings of virtual networks
- Virtual network provisioning across multiple substrate networks
- On the computational complexity of the virtual network embedding problem
Cites Work
Cited In (13)
- Competitive and deterministic embeddings of virtual networks
- Novel node-ranking approach for SDN-based virtual network embedding
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
- Slice embedding solutions for distributed service architectures
- Compact and extended formulations for the virtual network embedding problem
- Introducing the virtual network mapping problem with delay, routing and location constraints
- Resource competition in virtual network embedding
- Title not available (Why is that?)
- Multi-domain virtual network mapping based on openflow network
- On the computational complexity of the virtual network embedding problem
- Virtual network provisioning across multiple substrate networks
- Dependable virtual network mapping
- A branch-and-price algorithm for the single-path virtual network embedding problem
Uses Software
This page was built for publication: Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693801)
