Optimal QoS-Aware Network Slicing for Service-Oriented Networks with Flexible Routing

10/08/2021
by   Wei-Kun Chen, et al.
0

In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse quality of service (QoS) requirements. We first propose a mixed integer nonlinear program (MINLP) formulation for this problem that optimizes the network resource consumption while jointly considers QoS requirements, flow routing, and resource budget constraints. In particular, the proposed formulation is able to flexibly route the traffic flow of the services on multiple paths and provide end-to-end (E2E) delay and reliability guarantees for all services. Due to the intrinsic nonlinearity, the MINLP formulation is computationally difficult to solve. To overcome this difficulty, we then propose a mixed integer linear program (MILP) formulation and show that the two formulations and their continuous relaxations are equivalent. Different from the continuous relaxation of the MINLP formulation which is a nonconvex nonlinear programming problem, the continuous relaxation of the MILP formulation is a polynomial time solvable linear programming problem, which makes the MILP formulation much more computationally solvable. Numerical results demonstrate the effectiveness and efficiency of the proposed formulations over existing ones.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/30/2021

Towards Efficient Large-Scale Network Slicing: An LP Rounding-and-Refinement Approach

In this paper, we propose an efficient algorithm for the network slicing...
research
04/08/2019

Delay-Aware Flow Migration for Embedded Services in 5G Core Networks

Service-oriented virtual network deployment is based on statistical reso...
research
06/21/2020

Optimal Network Slicing for Service-Oriented Networks with Flexible Routing and Guaranteed E2E Latency

Network function virtualization is a promising technology to simultaneou...
research
02/04/2021

An efficient linear programming rounding-and-refinement algorithm for large-scale network slicing problem

In this paper, we consider the network slicing problem which attempts to...
research
08/22/2023

A Tight Formulation for the Dial-a-Ride Problem

Ridepooling services play an increasingly important role in modern trans...
research
06/27/2023

An Efficient Decomposition Algorithm for Large-Scale Network Slicing

In this paper, we consider the network slicing (NS) problem which attemp...
research
02/18/2020

Network Slicing for Service-Oriented Networks with Flexible Routing and Guaranteed E2E Latency

Network function virtualization is a promising technology to simultaneou...

Please sign up or login with your details

Forgot password? Click here to reset