Service chain placement in SDNs

DOI10.1016/J.DAM.2019.06.013zbMath1423.68053OpenAlexW2962376750MaRDI QIDQ2334053

Dror Rawitz, Gilad Kutiel

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

resource allocationapproximation algorithmsrandomized algorithmssoftware-defined networknetwork function virtualizationservice chaining

Mathematics Subject Classification ID

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

Related Items (2)

Waypoint routing on bounded treewidth graphs ⋮ Relaxed and approximate graph realizations

Uses Software

• Algorithm 447
• vnep-approx

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Approximation Algorithm for Path Computation and Function Placement in SDNs
• Online Admission Control and Embedding of Service Chains
• On-line path computation and function placement in SDNs
• Walking through waypoints
• On-line path computation and function placement in SDNs

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