Atlas: Automate Online Service Configuration in Network Slicing
- URL: http://arxiv.org/abs/2210.16902v1
- Date: Sun, 30 Oct 2022 17:51:00 GMT
- Title: Atlas: Automate Online Service Configuration in Network Slicing
- Authors: Qiang Liu, Nakjung Choi, Tao Han
- Abstract summary: We propose Atlas, an online network slicing system, which automates the service configuration of slices.
First, we design a learning-based simulator to reduce the sim-to-real discrepancy.
Second, we offline train the policy in the augmented simulator via a novel offline algorithm with a Bayesian neural network and parallel Thompson sampling.
Third, we online learn the policy in real networks with a novel online algorithm with safe exploration and Gaussian process regression.
- Score: 11.968135071159304
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Network slicing achieves cost-efficient slice customization to support
heterogeneous applications and services. Configuring cross-domain resources to
end-to-end slices based on service-level agreements, however, is challenging,
due to the complicated underlying correlations and the simulation-to-reality
discrepancy between simulators and real networks. In this paper, we propose
Atlas, an online network slicing system, which automates the service
configuration of slices via safe and sample-efficient learn-to-configure
approaches in three interrelated stages. First, we design a learning-based
simulator to reduce the sim-to-real discrepancy, which is accomplished by a new
parameter searching method based on Bayesian optimization. Second, we offline
train the policy in the augmented simulator via a novel offline algorithm with
a Bayesian neural network and parallel Thompson sampling. Third, we online
learn the policy in real networks with a novel online algorithm with safe
exploration and Gaussian process regression. We implement Atlas on an
end-to-end network prototype based on OpenAirInterface RAN, OpenDayLight SDN
transport, OpenAir-CN core network, and Docker-based edge server. Experimental
results show that, compared to state-of-the-art solutions, Atlas achieves 63.9%
and 85.7% regret reduction on resource usage and slice quality of experience
during the online learning stage, respectively.
Related papers
- Why Line Search when you can Plane Search? SO-Friendly Neural Networks allow Per-Iteration Optimization of Learning and Momentum Rates for Every Layer [9.849498498869258]
We introduce the class of SO-friendly neural networks, which include several models used in practice.
Performing a precise line search to set the step size has the same cost during full-batch training as using a fixed learning.
For the same cost a planesearch can be used to set both the learning and momentum rate on each step.
arXiv Detail & Related papers (2024-06-25T22:06:40Z) - On Statistical Learning of Branch and Bound for Vehicle Routing
Optimization [3.6922704509753084]
We train neural networks to emulate the decision-making process of the computationally expensive Strong Branching strategy.
We find that this approach can match or improve upon the performance of the branch and bound algorithm.
arXiv Detail & Related papers (2023-10-15T23:59:57Z) - Optimization Guarantees of Unfolded ISTA and ADMM Networks With Smooth
Soft-Thresholding [57.71603937699949]
We study optimization guarantees, i.e., achieving near-zero training loss with the increase in the number of learning epochs.
We show that the threshold on the number of training samples increases with the increase in the network width.
arXiv Detail & Related papers (2023-09-12T13:03:47Z) - Online Network Source Optimization with Graph-Kernel MAB [62.6067511147939]
We propose Grab-UCB, a graph- kernel multi-arms bandit algorithm to learn online the optimal source placement in large scale networks.
We describe the network processes with an adaptive graph dictionary model, which typically leads to sparse spectral representations.
We derive the performance guarantees that depend on network parameters, which further influence the learning curve of the sequential decision strategy.
arXiv Detail & Related papers (2023-07-07T15:03:42Z) - Iterative Soft Shrinkage Learning for Efficient Image Super-Resolution [91.3781512926942]
Image super-resolution (SR) has witnessed extensive neural network designs from CNN to transformer architectures.
This work investigates the potential of network pruning for super-resolution iteration to take advantage of off-the-shelf network designs and reduce the underlying computational overhead.
We propose a novel Iterative Soft Shrinkage-Percentage (ISS-P) method by optimizing the sparse structure of a randomly network at each and tweaking unimportant weights with a small amount proportional to the magnitude scale on-the-fly.
arXiv Detail & Related papers (2023-03-16T21:06:13Z) - OnSlicing: Online End-to-End Network Slicing with Reinforcement Learning [11.420934703203878]
We propose OnSlicing, an online end-to-end network slicing system, to achieve minimal resource usage while satisfying slices' SLA.
OnSlicing allows individualized learning for each slice and maintains its SLA by using a novel constraint-aware policy update method.
We implement OnSlicing on an end-to-end slicing testbed designed based on OpenAirInterface with both 4G LTE and 5G NR, OpenDayLight SDN platform, and OpenAir-CN core network.
arXiv Detail & Related papers (2021-11-02T14:25:58Z) - Model Fusion of Heterogeneous Neural Networks via Cross-Layer Alignment [17.735593218773758]
We propose a novel model fusion framework, named CLAFusion, to fuse neural networks with a different number of layers.
Based on the cross-layer alignment, our framework balances the number of layers of neural networks before applying layer-wise model fusion.
arXiv Detail & Related papers (2021-10-29T05:02:23Z) - A Deep Value-network Based Approach for Multi-Driver Order Dispatching [55.36656442934531]
We propose a deep reinforcement learning based solution for order dispatching.
We conduct large scale online A/B tests on DiDi's ride-dispatching platform.
Results show that CVNet consistently outperforms other recently proposed dispatching methods.
arXiv Detail & Related papers (2021-06-08T16:27:04Z) - CREPO: An Open Repository to Benchmark Credal Network Algorithms [78.79752265884109]
Credal networks are imprecise probabilistic graphical models based on, so-called credal, sets of probability mass functions.
A Java library called CREMA has been recently released to model, process and query credal networks.
We present CREPO, an open repository of synthetic credal networks, provided together with the exact results of inference tasks on these models.
arXiv Detail & Related papers (2021-05-10T07:31:59Z) - Task-Adaptive Neural Network Retrieval with Meta-Contrastive Learning [34.27089256930098]
We propose a novel neural network retrieval method, which retrieves the most optimal pre-trained network for a given task.
We train this framework by meta-learning a cross-modal latent space with contrastive loss, to maximize the similarity between a dataset and a network.
We validate the efficacy of our method on ten real-world datasets, against existing NAS baselines.
arXiv Detail & Related papers (2021-03-02T06:30:51Z) - Network Adjustment: Channel Search Guided by FLOPs Utilization Ratio [101.84651388520584]
This paper presents a new framework named network adjustment, which considers network accuracy as a function of FLOPs.
Experiments on standard image classification datasets and a wide range of base networks demonstrate the effectiveness of our approach.
arXiv Detail & Related papers (2020-04-06T15:51:00Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.