Service chain placement in SDNs

DOI10.1016/J.DAM.2019.06.013MaRDI QIDQ2334053zbMATH OpenOpenAlexFDO

Authors Gilad Kutiel, Dror Rawitz

Publication date 6 November 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2019.06.013

zbMATH Keywords

approximation algorithmsnetwork function virtualizationrandomized algorithmsresource allocationservice chainingsoftware-defined network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• On-line path computation and function placement in SDNs
• On-line path computation and function placement in SDNs
• An approximation algorithm for path computation and function placement in SDNs
• Online admission control and embedding of service chains
• Benders decomposition for a node-capacitated virtual network function placement and routing problem

Cites work

• An approximation algorithm for path computation and function placement in SDNs
• scientific article; zbMATH DE number 3557795 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 3407692 (Why is no real title available?)
• On-line path computation and function placement in SDNs
• On-line path computation and function placement in SDNs
• Online admission control and embedding of service chains
• Walking through waypoints

Cited in

(13)

• Cost-efficient allocation of additional resources for the service placement problem in next-generation internet
• Energy-efficient service function chain provisioning
• Relaxed and approximate graph realizations
• Waypoint routing on bounded treewidth graphs
• A congestion game framework for service chain composition in NFV with function benefit
• Benders decomposition for a node-capacitated virtual network function placement and routing problem
• An approximation algorithm for path computation and function placement in SDNs
• Scalable, adaptable, and fast estimation of transient downtime in virtual infrastructures using convex decomposition and sample path randomization
• Online admission control and embedding of service chains
• On-line path computation and function placement in SDNs
• On-line path computation and function placement in SDNs
• Robust network function virtualization
• Two extended formulations for the virtual network function placement and routing problem

Describes a project that uses

Uses Software

• Algorithm 447
• vnep-approx

This page was built for publication: Service chain placement in SDNs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334053)