Adaptive Interference-Aware VNF Placement for Service-Customized 5G Network Slices

@article{Zhang2019AdaptiveIV,
  title={Adaptive Interference-Aware VNF Placement for Service-Customized 5G Network Slices},
  author={Qixia Zhang and Fangming Liu and Chaobing Zeng},
  journal={IEEE INFOCOM 2019 - IEEE Conference on Computer Communications},
  year={2019},
  pages={2449-2457}
}
Based on network function virtualization (NFV) and software defined network (SDN), network slicing is proposed as a new paradigm for building service-customized 5G network. [...] Key Method Specially, based on the fact that VNF consolidation may cause severe performance degradation, we adopt a demand-supply model to quantity the VNF interference.Expand
Online Adaptive Interference-Aware VNF Deployment and Migration for 5G Network Slice
  • Qixia Zhang, Fangming Liu, Chaobing Zeng
  • Computer Science
  • IEEE/ACM Transactions on Networking
  • 2021
TLDR
This paper first proposes a time-slot based 5G network slice model, which jointly includes both edge cloud servers and core cloud servers, and proposes an Online Lazy-migration Adaptive Interference-aware Algorithm (OLAIA) for real-time VNF deployment and cost-efficient VNF migration in a 5Gnetwork slice. Expand
Combined Latency-Aware and Resource-Effective Virtual Network Function Placement
TLDR
This paper proposes a decision algorithm based two-procedures that aims to manage the reuse of VNFs having the same required functions through a dynamic logit method, and the second one is related to the new placement of V NFs. Expand
Latency-aware VNF Chain Deployment with Efficient Resource Reuse at Network Edge
TLDR
This work designs a novel two-stage latency-aware VNF deployment scheme, highlighted by a constrained depth-first search algorithm (CDFSA) for selecting paths, and a path-based greedy algorithm (PGA) for assigning V NFs by reusing as many VNFs as possible. Expand
An SLA-Aware Network Function Selection Algorithm for SFCs
TLDR
A heuristic algorithm namely PENDANT is developed which considers the effect of CPU utilization on VNF delay and migrates flows to other VNF instances to avoid SLA violations and addresses the VNF selection problem for an SFC. Expand
Cost-efficient Placement and Scaling of 5G Core Network and MEC-enabled Application VNFs
TLDR
This work compares vertical, horizontal, and hybrid VNF scaling strategies by formulating an integer linear programming (ILP) problem that aims at minimizing the service provisioning cost for the MNOs, while satisfying users’ data rate requirements and devise a heuristic algorithm to tackle the scalability issue of the ILP-based approach. Expand
A Techno-Economic Evaluation of VNF Placement Strategies in Optical Metro Networks
TLDR
This paper analyzes the impact of different VNF placement strategies on the optical metro network cost, considering specific Service Level Agreement requirements, expressed in terms of service blocking probability and provides a cost model which takes into consideration both capital and operational expenditures. Expand
Dynamic VNF Placement, Resource Allocation and Traffic Routing in 5G
TLDR
A one-shot optimization problem which can attain the optimum solution for small size problems given the complete knowledge of arrival and departure times of requests over the entire system lifespan is formulated and an efficient and practical heuristic solution is proposed that works for realistically-sized scenarios. Expand
Coordinated 5G Network Slicing: How Constructive Interference Can Boost Network Throughput
TLDR
It is shown that the RAN slicing problem can be formulated as a 0-1 Quadratic Programming problem, and its NP-hardness is proved, and an optimal solution for small-scale 5G network deployments is proposed. Expand
Latency and energy-aware provisioning of network slices in cloud networks
TLDR
Two new latency and energy-aware optimization models for provisioning 5G slices in cloud networks comprising both distributed computing and network resources are proposed based on a comprehensive review of the state-of-the-art. Expand
Latency and Mobility-Aware Service Function Chain Placement in 5G Networks
TLDR
This work employs mixed-integer linear programming (MILP) techniques to formulate and solve a joint user association, service function chain (SFC) placement, and resource allocation problem in 5G networks composed of decentralized units (DUs), centralized units (CUs), and a core network (5GC). Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 REFERENCES
Delay-aware VNF placement and chaining based on a flexible resource allocation approach
TLDR
This paper introduces a PC-VNF model based on a flexible resource allocation approach that takes into account service requirements in terms of latency, in addition to traditional connectivity and resource utilization, and achieves the required latency with better resources utilization. Expand
Joint Optimization of Chain Placement and Request Scheduling for Network Function Virtualization
TLDR
To jointly optimize the performance of NFV, this work proposes a priority-driven weighted algorithm to improve resource utilization and a heuristic algorithm to reduce response latency and shows that these methods can indeed enhance performance in diverse scenarios. Expand
Towards load-balanced VNF assignment in geo-distributed NFV Infrastructure
TLDR
A framework of CO Selection (CS) and VNF Assignment (VA) for distributed deployment of NFV, which first select a set of COs that minimizes the communication cost among the selected COs, and employs a shadow-routing based approach to jointly solve the VNF-CO and V NF-server assignment problem. Expand
VNF-FG design and VNF placement for 5G mobile networks
TLDR
Four genetic algorithms are proposed on the basis of the frameworks of two existing algorithms (multiple objective genetic algorithm and improved non-dominated sorting genetic algorithm) to resolve the VNF placement optimization problem for achieving lower bandwidth consumption and lower maximum link utilization simultaneously. Expand
Adaptive VNF Scaling and Flow Routing with Proactive Demand Prediction
TLDR
This work forms the VNF provisioning problem in order that the cost incurred by inaccurate prediction and VNF deployment is minimized, and employs an efficient online learning method which aims at minimizing the error in predicting the service chain demands. Expand
Dynamic, Latency-Optimal vNF Placement at the Network Edge
TLDR
This paper presents a way to dynamically re-schedule the optimal placement of vNFs based on temporal network-wide latency fluctuations using optimal stopping theory, and evaluates the proposed dynamic scheduler over a simulated nation-wide backbone network using real-world ISP latency characteristics. Expand
Demand-Aware Network Function Placement
TLDR
An integrated design for network function instance allocation and end-to-end demand realization sharing the same physical substrate network is proposed and it is demonstrated that the corresponding network design problem is NP complete. Expand
Deploying chains of virtual network functions: On the relation between link and server usage
TLDR
A systematic way to elastically tune the proper link and server usage of each demand based on network conditions and demand properties is proposed and effectively adapts resource usage to network dynamics, and, hence, serves more demands than other heuristics. Expand
Design of Virtual Infrastructure Manager with Novel VNF Placement Features for Edge Clouds in 5G
TLDR
The work here presented deals with the service management and orchestration challenges that arise when handling service mapping on the multi-tenant distributed cloud-enabled radio access network architecture, and adapt the OpenStack application instances to 5G Network Service instantiation. Expand
Piecing together the NFV provisioning puzzle: Efficient placement and chaining of virtual network functions
TLDR
This paper formalizes the network function placement and chaining problem and proposes an Integer Linear Programming (ILP) model to solve it and proposes a heuristic procedure for efficiently guiding the ILP solver towards feasible, near-optimal solutions. Expand
...
1
2
3
4
...