4.7 Article

Learning-Based Dynamic Resource Provisioning for Network Slicing with Ensured End-to-End Performance Bound

Journal

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TNSE.2018.2876918

Keywords

Network slicing; quality-of-service; stochastic network calculus; resources; learned-based resizing

Funding

  1. Hong Kong General Research Fund [11216618]

Ask authors/readers for more resources

To accommodate different sets of network functions with different quality-of-service requirements for different types of applications in 5G networks, network slicing, which dynamically creates virtual networks, was proposed in the literature and IETF. A critical issue for network slicing is to determine the amount of resources for a network slice to ensure the quality-of-service requirement, and as such we need to determine the relationship among traffic demand, amount of resources, and end-to-end delay. This problem is non-trivial in a dynamic, virtualized environment. In this paper, we first use stochastic network calculus (SNC) to study the end-to-end delay bound with given traffic demand and resources. Then, we propose a solution to find the amount of resources that should be allocated with given traffic distribution and end-to-end delay bound. Beyond that, we investigate the range of traffic demands that a network slice can support and design a learning-based dynamic network slice resizing strategy, which can significantly reduce overall resizing cost with quality-of-service guarantee. Our work provides a set of useful tools for network slice tenants to (1) decide the amount of resources to request from physical network providers and (2) cost-effectively adjust the resource amounts that align with the dynamic traffic demand.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available