Competitive and deterministic embeddings of virtual networks
From MaRDI portal
Recommendations
- Resource competition in virtual network embedding
- Compact and extended formulations for the virtual network embedding problem
- Online admission control and embedding of service chains
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
- Virtual network provisioning across multiple substrate networks
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A survey of network virtualization
- Algorithms – ESA 2005
- An improved LP-based approximation for Steiner tree
- An improved approximation algorithm for virtual private network design
- Competitive routing of virtual circuits with unknown duration
- Design of trees in the hose model: the balanced case
- Designing Least-Cost Nonblocking Broadband Networks
- Hardness of robust network design
- Minimum congestion mapping in a cloud
- Network design via core detouring for problems without a core
- Network information flow
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Online Multi-Commodity Flow with High Demands
- Online primal-dual algorithms for covering and packing
- Recent results on approximating the Steiner tree problem and its generalizations
- Simpler and better approximation algorithms for network design
Cited in
(19)- On-line path computation and function placement in SDNs
- Adversarial topology discovery in network virtualization environments: a threat for ISPs?
- scientific article; zbMATH DE number 1950539 (Why is no real title available?)
- An approximation algorithm for path computation and function placement in SDNs
- Novel node-ranking approach for SDN-based virtual network embedding
- Dependable virtual network mapping
- Data locality and replica aware virtual cluster embeddings
- scientific article; zbMATH DE number 2080416 (Why is no real title available?)
- A survey of network virtualization
- A branch-and-price algorithm for the single-path virtual network embedding problem
- Virtual network provisioning across multiple substrate networks
- Slice embedding solutions for distributed service architectures
- Compact and extended formulations for the virtual network embedding problem
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
- On the computational complexity of the virtual network embedding problem
- Online admission control and embedding of service chains
- Resource competition in virtual network embedding
- Scalable, adaptable, and fast estimation of transient downtime in virtual infrastructures using convex decomposition and sample path randomization
- scientific article; zbMATH DE number 1487924 (Why is no real title available?)
This page was built for publication: Competitive and deterministic embeddings of virtual networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391268)