Robust network function virtualization
DOI10.1002/net.21935zbMath1526.90006arXiv1912.03864MaRDI QIDQ6066069
Publication date: 15 November 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.03864
approximation algorithmquality-of-servicenetwork function virtualizationservice function chainingcross-layer networkrobustness of network function service
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Linear programming (90C05) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties)
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Robust fault tolerant uncapacitated facility location
- Approximating the two-level facility location problem via a quasi-greedy approach
- An Approximation Algorithm for Path Computation and Function Placement in SDNs
- Robust Fault Tolerant uncapacitated facility location
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
This page was built for publication: Robust network function virtualization
