Placement and Allocation of Virtual Network Functions: Multi-dimensional Case

10/14/2019
by   Gamal Sallam, et al.
0

Network function virtualization (NFV) is an emerging design paradigm that replaces physical middlebox devices with software modules running on general purpose commodity servers. While gradually transitioning to NFV, Internet service providers face the problem of where to introduce NFV in order to make the most benefit of that; here, we measure the benefit by the amount of traffic that can be serviced through the NFV. This problem is non-trivial as it is composed of two challenging subproblems: 1) placement of nodes to support virtual network functions (referred to as VNF-nodes); and 2) allocation of the VNF-nodes resources to network flows. This problem has been studied recently but for the one-dimensional setting, where all network flows require one network function, which requires a unit of resource to process a unit of flow. In this work, we extend to the multi-dimensional setting, where flows can require multiple network functions, which can also require a different amount of each resource to process a unit of flow. The multi-dimensional setting introduces new challenges in addition to those of the one-dimensional setting (e.g., NP-hardness and non-submodularity) and also makes the resource allocation a multi-dimensional generalization of the generalized assignment problem with assignment restrictions. To address these difficulties, we propose a novel two-level relaxation method and utilize the primal-dual technique to design two approximation algorithms that achieve an approximation ratio of (e-1)(Z-1) /2 e^2 Z (kR)^1/(Z-1) and (e-1)(Z-1)/2e(Z-1+e Z R^1/(Z-1)), where k (resp. R) is the number of VNF-nodes (resp. resources), and Z is a measure of the available resource compared to flow demand. Finally, we perform extensive trace-driven simulations to show the effectiveness of the proposed algorithms.

READ FULL TEXT
research
01/13/2019

Joint Placement and Allocation of Virtual Network Functions with Budget and Capacity Constraints

With the advent of Network Function Virtualization (NFV), network servic...
research
08/31/2020

CoShare: An Efficient Approach for Redundancy Allocation in NFV

An appealing feature of Network Function Virtualization (NFV) is that in...
research
05/20/2021

Approximation Algorithms for the NFV Service Distribution Problem

Distributed cloud networking builds on network functions virtualization ...
research
01/17/2018

Shortest Path and Maximum Flow Problems Under Service Function Chaining Constraints

With the advent of Network Function Virtualization (NFV), Physical Netwo...
research
01/08/2020

Online Joint Placement and Allocation of Virtual Network Functions with Heterogeneous Servers

Network Function Virtualization (NFV) is a promising virtualization tech...
research
08/23/2021

Multi-Dimensional Multiple Access with Resource Utilization Cost Awareness for Individualized Service Provisioning in 6G

The increasingly diversified Quality-of-Service (QoS) requirements envis...
research
05/15/2023

Non-Separable Multi-Dimensional Network Flows for Visual Computing

Flows in networks (or graphs) play a significant role in numerous comput...

Please sign up or login with your details

Forgot password? Click here to reset