Virtual Network Embedding Approximations: Leveraging Randomized Rounding

by   Matthias Rost, et al.

The Virtual Network Embedding Problem (VNEP) captures the essence of many resource allocation problems of today's Cloud Providers, which offer their physical computation and networking resources to customers. Customers request resources in the form of Virtual Networks, i.e. as a directed graph, specifying computational requirements at the nodes and bandwidth requirements on the edges. An embedding of a Virtual Network on the shared physical infrastructure is the joint mapping of (virtual) nodes to suitable physical servers together with the mapping of (virtual) edges onto paths in the physical network connecting the respective servers. We study the offline setting of the VNEP in which multiple requests are given and the task is to find the most profitable set of requests to embed while not exceeding the physical resource capacities. This paper initiates the study of approximation algorithms for the VNEP by employing randomized rounding of Linear Programming solutions. We show that the standard Linear Programming formulation exhibits an inherent structural deficit, yielding large (or even infinite) integrality gaps. In turn, focusing on the class of cactus graphs for virtual networks, we devise a novel Linear Programming formulation together with an algorithm to decompose fractional solutions into convex combinations of valid embeddings. Applying randomized rounding, we obtain the first tri-criteria approximation algorithm in the classic resource augmentation model.



There are no comments yet.


page 1

page 2

page 3

page 4


Towards Efficient Dynamic Virtual Network Embedding Strategy for Cloud IoT Networks

Network Virtualization is one of the most promising technologies for fut...

It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints

This paper proposes a new approximation algorithm for the offline Virtua...

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

Many resource allocation problems in the cloud can be described as a bas...

Failure Aware Semi-Centralized Virtual Network Embedding in Cloud Computing Fat-Tree Data Center Networks

In Cloud Computing, the tenants opting for the Infrastructure as a Servi...

Improving Resources Management in Network Virtualization by Utilizing a Software-Based Network

Network virtualization is a way to simultaneously run multiple heterogen...

Share-a-ride problems: Models and Solution Algorithms

Some of today's greatest challenges in urban environments concern indivi...

NP-Completeness and Inapproximability of the Virtual Network Embedding Problem and Its Variants

Many resource allocation problems in the cloud can be described as a bas...

Code Repositories


Provides Linear Programming (LP) formulations and approximation algorithms for the Virtual Network Embedding Problem.

view repo


Evaluation code and results for our paper "Virtual Network Embedding Approximations: Leveraging Randomized Rounding" presented at IFIP Networking 2018

view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.