Uncertainty-Aware Resource Provisioning for Network Slicing
Quang-Trung Luu, Sylvaine Kerboeuf, and Michel Kieffer

TL;DR
This paper introduces a robust resource provisioning method for network slices that accounts for uncertain user demands, aiming to maximize provider earnings while ensuring probabilistic resource sufficiency and minimal impact on background services.
Contribution
It proposes a novel mixed integer linear programming approach for uncertainty-aware resource provisioning in network slicing, including optimal and suboptimal solutions.
Findings
The approach guarantees probabilistic resource sufficiency for slices.
It maximizes the infrastructure provider’s earnings.
It reduces impact on co-existing low-priority services.
Abstract
Network slicing allows Mobile Network Operators to split the physical infrastructure into isolated virtual networks (slices), managed by Service Providers to accommodate customized services. The Service Function Chains (SFCs) belonging to a slice are usually deployed on a best-effort premise: nothing guarantees that network infrastructure resources will be sufficient to support a varying number of users, each with uncertain requirements. Taking the perspective of a network Infrastructure Provider (InP), this paper proposes a resource provisioning approach for slices, robust to a partly unknown number of users with random usage of the slice resources. The provisioning scheme aims to maximize the total earnings of the InP, while providing a probabilistic guarantee that the amount of provisioned network resources will meet the slice requirements. Moreover, the proposed provisioning…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
