ویراساینس.
سند علمی

Service Chain and Virtual Network Embeddings: Approximations using Randomized Rounding

Matthias Rost, Stefan Schmid

چکیده

The SDN and NFV paradigms enable novel network services which can be realized and embedded in a flexible and rapid manner. For example, SDN can be used to flexibly steer traffic from a source to a destination through a sequence of virtualized middleboxes, in order to realize so-called service chains. The service chain embedding problem consists of three tasks: admission control, finding suitable locations to allocate the virtualized middleboxes and computing corresponding routing paths. This paper considers the offline batch embedding of multiple service chains. Concretely, we consider the objectives of maximizing the profit by embedding an optimal subset of requests or minimizing the costs when all requests need to be embedded. Interestingly, while the service chain embedding problem has recently received much attention, so far, only nonpolynomial time algorithms (based on integer programming) as well as heuristics (which do not provide any formal guarantees) are known. This paper presents the first polynomial time service chain approximation algorithms both for the case with admission and without admission control. Our algorithm is based on a novel extension of the classic linear programming and randomized rounding technique, which may be of independent interest. In particular, we show that our approach can also be extended to more complex service graphs, containing cycles or sub-chains, hence also providing new insights into the classic virtual network embedding problem.

اسناد مشابه

  • Virtual Network Embedding Approximations: Leveraging Randomized Rounding

    سند علمی۲۰۱۸Matthias Rost, Stefan Schmid

    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

  • Virtual Network Embedding Approximations: Leveraging Randomized Rounding

    مقاله‌ی دسترسی آزاد۲۰۱۹IEEE/ACM Transactions on NetworkingMatthiasRost, StefanSchmid

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

    سند علمی۲۰۱۸Matthias Rost, Stefan Schmid

    Many resource allocation problems in the cloud can be described as a basic Virtual Network Embedding Problem (VNEP): finding mappings of request graphs (describing the workloads) onto a substrate graph (describing the physical infrastructure). In the offline setting, the two natu

  • Using Heavy Clique Base Coarsening to Enhance Virtual Network Embedding

    سند علمی۲۰۱۵CoRRAshraf A. Shahin

    Network virtualization allows cloud infrastructure providers to accommodate multiple virtual networks on a single physical network. However, mapping multiple virtual network resources to physical network components, called virtual network embedding (VNE), is known to be non-deter

  • A POLICY - BASED ARCHITECTURE FOR VIRTUAL NETWORK EMBEDDING by FLAVIO ESPOSITO

    سند علمی۲۰۱۳FLAVIO ESPOSITO

    Network virtualization is a technology that enables multiple virtual instances to coexist on a common physical network infrastructure. This paradigm fostered new business models, allowing infrastructure providers to lease or share their physical resources. Each virtual network is

  • VINEA: a policy-based virtual network embedding architecture

    سند علمی۲۰۱۳Flavio Esposito, Ibrahim Matta, Yuefeng Wang

    Network virtualization has enabled new business models by allowing infrastructure providers to lease or share their physical network. To concurrently run multiple customized virtual network services, such infrastructure providers need to run a virtual network embedding protocol.