An Approximation Algorithm for Path Computation and Function Placement in SDNs

@article{Even2016AnAA,
  title={An Approximation Algorithm for Path Computation and Function Placement in SDNs},
  author={Guy Even and Matthias Rost and Stefan Schmid},
  journal={ArXiv},
  year={2016},
  volume={abs/1603.09158}
}
We consider the task of embedding multiple service requests in Software-Defined Networks (SDNs), i.e. computing (combined) mappings of network functions on physical nodes and finding routes to connect the mapped network functions. A single service request may either be fully embedded or be rejected. The objective is to maximize the sum of benefits of the served requests, while the solution must abide node and edge capacities. 

On-Line Path Computation and Function Placement in SDNs

TLDR
An online algorithm for path computation and function placement that guarantees, in each time step, throughput of at least a logarithmic fraction of a (very permissive) upper bound on the maximal possible benefit.

Joint Energy Efficient and QoS-Aware Path Allocation and VNF Placement for Service Function Chaining

TLDR
A novel resource allocation architecture is proposed which enables energy-aware SFC for SDN-based networks, considering also constraints on delay, link utilization, server utilization and results confirm that the proposed heuristic algorithms provide near-optimal solutions while their execution time makes them usable for real-life networks.

Routing via Functions in Virtual Networks: The Curse of Choices

TLDR
This paper provides an original formulation of online routing of demand across nodes handling the functions involved in a given service chain that includes link and CPU capacity constraints and is based on the construction of an expanded network.

On Congestion Minimization for Service Chain Routing Problems

  • L. GaoG. Rouskas
  • Computer Science
    ICC 2019 - 2019 IEEE International Conference on Communications (ICC)
  • 2019
TLDR
This work considers the online service chain routing problem with the goal of minimizing the maximum network congestion, and proves that the algorithm is O(log m)-competitive, where m is the number of edges of the underlying network topology, and it is shown that this ratio is asymptotically optimal.

A Walk in the Clouds: Routing Through VNFs on Bidirected Networks

TLDR
This paper initiates the algorithmic study of the fundamental underlying problem of how to efficiently route traffic through a given set of Virtualized Network Functions (VNFs), and considers the practically relevant but rarely studied case of bidirected networks.

Network Slicing with Splittable Flows is Hard

TLDR
This paper provides a simple proof that it is NP-hard by a reduction from the 3-SAT problem, and proposes a poly-time heuristic for the loose capacity constraint case, based on linear relaxation and randomized rounding.

Congestion Minimization for Service Chain Routing Problems With Path Length Considerations

TLDR
This work presents a simple yet effective online algorithm in which the routing decision is irrevocably made without prior knowledge of future requests, and proves that this ratio is asymptotically optimal.

Service Chain and Virtual Network Embeddings: Approximations using Randomized Rounding

TLDR
This paper presents the first polynomial time service chain approximation algorithms both for the case with admission and without admission control, based on a novel extension of the classic linear programming and randomized rounding technique.

Reliability-aware and Cost Efficient Algorithm for Joint Path Allocation and VNF Placement using Sharing Scheme

TLDR
A novel reliability enhancement method using a shared protection scheme to reduce the cost of redundant VNFs and a Reliability-aware and minimum-Cost based Genetic (RCG) algorithm to solve the problem with low computational complexity.

(FPT-)Approximation Algorithms for the Virtual Network Embedding Problem

TLDR
To capture the structure of request graphs, the graph-theoretic notion of extraction orders and extraction width is introduced and it is shown that the first fixed-parameter tractable approximation algorithms for the VNEP have exponential runtime in the request graphs' maximal width.

References

SHOWING 1-10 OF 26 REFERENCES

Competitive Path Computation and Function Placement in SDNs

TLDR
An online algorithm for path computation and function placement that guarantees, in each time step, throughput of at least $\Omega\left(\frac{\text{OPT}^*}{\log n}\right)$, where $n$ is the system size and $Omega$ is an upper bound on the maximal possible throughput.

On-Line Path Computation and Function Placement in SDNs

TLDR
An online algorithm for path computation and function placement that guarantees, in each time step, throughput of at least a logarithmic fraction of a (very permissive) upper bound on the maximal possible benefit.

Service Chain and Virtual Network Embeddings: Approximations using Randomized Rounding

TLDR
This paper presents the first polynomial time service chain approximation algorithms both for the case with admission and without admission control, based on a novel extension of the classic linear programming and randomized rounding technique.

Specifying and placing chains of virtual network functions

TLDR
A model for formalizing the chaining of network functions using a context-free language is defined and a Pareto set analysis is performed to investigate the possible trade-offs between different optimization objectives.

Online Admission Control and Embedding of Service Chains

TLDR
A deterministic Ologl-competitive online algorithm, under the assumption that capacities are at least logarithmic in l, that is asymptotically optimal within the class of deterministic and randomized online algorithms, and lower bounds for offline approximation algorithms are explored.

Network service chaining with optimized network function embedding supporting service decompositions

Network Function Placement for NFV Chaining in Packet/Optical Datacenters

TLDR
This paper forms the problem of optimal vNF placement in binary integer programming (BIP), and proposes an alternative efficient heuristic algorithm to solve this problem, which can achieve near-optimal O/E/O conversions comparable to BIP.

Network service embedding across multiple providers with nestor

TLDR
Nestor is proposed, a system that generates efficient network service embeddings via network graph rendering, request partitioning among datacenters, and request segment mappings onto DC networks through a new service model that simplifies the specification of network service requests and the estimation of bandwidth demands.

A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks

TLDR
This work proposes a solution based on a two-layer architecture separating connectivity and optimization tasks; and a centralized optimizer called framework, which translates high-level goals expressed almost in natural language into compliant network configurations, which improves the state of the art.

Virtual Network Embedding: A Survey

TLDR
A survey of current research in the Virtual Network Embedding (VNE) area is presented and a taxonomy of current approaches to the VNE problem is provided and opportunities for further research are discussed.