An Approximation Algorithm for Path Computation and Function Placement in SDNs

DOI10.1007/978-3-319-48314-6_24zbMath1483.68499arXiv1603.09158OpenAlexW2325918172MaRDI QIDQ2835038

Stefan Schmid, Guy Even, Matthias Rost

Publication date: 1 December 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.09158

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (6)

Robust network function virtualization ⋮ On-line path computation and function placement in SDNs ⋮ Walking through waypoints ⋮ An Approximation Algorithm for Path Computation and Function Placement in SDNs ⋮ Service chain placement in SDNs ⋮ Relaxed and approximate graph realizations

Uses Software

• Merlin
• vnep-approx
• OpenNF

Cites Work

• Unnamed Item
• vnep-approx
• OpenNF
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• An Approximation Algorithm for Path Computation and Function Placement in SDNs
• Online Admission Control and Embedding of Service Chains

This page was built for publication: An Approximation Algorithm for Path Computation and Function Placement in SDNs