The following pages link to Service chain placement in SDNs (Q2334053):
Displaying 8 items.
- Cost-efficient allocation of additional resources for the service placement problem in next-generation internet (Q1665901) (← links)
- Energy-efficient service function chain provisioning (Q1742239) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Waypoint routing on bounded treewidth graphs (Q2234792) (← links)
- A congestion game framework for service chain composition in NFV with function benefit (Q2660727) (← links)
- Benders decomposition for a node-capacitated virtual network function placement and routing problem (Q2668658) (← links)
- Scalable, Adaptable, and Fast Estimation of Transient Downtime in Virtual Infrastructures Using Convex Decomposition and Sample Path Randomization (Q3386767) (← links)
- On-line path computation and function placement in SDNs (Q5920222) (← links)