Pages that link to "Item:Q391268"
From MaRDI portal
The following pages link to Competitive and deterministic embeddings of virtual networks (Q391268):
Displaying 14 items.
- On the computational complexity of the virtual network embedding problem (Q325446) (← links)
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation (Q693801) (← links)
- Virtual network provisioning across multiple substrate networks (Q716276) (← links)
- A survey of network virtualization (Q975055) (← links)
- Compact and extended formulations for the virtual network embedding problem (Q1742226) (← links)
- Novel node-ranking approach for SDN-based virtual network embedding (Q2209224) (← links)
- Adversarial topology discovery in network virtualization environments: a threat for ISPs? (Q2353249) (← links)
- Data locality and replica aware virtual cluster embeddings (Q2405895) (← links)
- Dependable virtual network mapping (Q2517301) (← links)
- Scalable, Adaptable, and Fast Estimation of Transient Downtime in Virtual Infrastructures Using Convex Decomposition and Sample Path Randomization (Q3386767) (← links)
- Online Admission Control and Embedding of Service Chains (Q3460710) (← links)
- (Q4494463) (← links)
- Resource competition in virtual network embedding (Q4994071) (← links)
- On-line path computation and function placement in SDNs (Q5920222) (← links)