Answers are grounded in this paper and cite their sources.
This approach enhances slice request acceptance by 25% in edge-based networks, indicating reduced resource usage and improved efficiency.
In this work, we aim to address the challenge of slice provisioning in edge-based mobile networks. We propose a solution that learns a service function chain placement policy for Network Slice Requests, to maximize the request acceptance rate, while minimizing the average node resource utilization. To do this, we consider a Hierarchical Multi-Armed Bandit problem and propose a two-level hierarchical bandit solution which aims to learn a scalable placement policy that optimizes the stated objectives in an online manner. Simulations on two real network topologies show that our proposed approach achieves 5% average node resource utilization while admitting over 25% more slice requests in certain scenarios, compared to baseline methods.
No takes yet. Share an insight, caveat, or question.
Ajayi et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: