为AI服务设计动态网络切片,实时优化资源分配
Slicing for AI: An Online Learning Framework for Network Slicing Supporting AI Services
- 基于在线学习框架,动态分配计算与通信资源
- 在保持精度、延迟、成本平衡下收敛至最优决策
- 适合6G中需实时响应的AI应用开发者参考
6G网络将支持大量AI驱动的服务,亟需新型网络切片策略——即面向AI的切片,通过定制化网络切片满足不同AI服务的QoS需求。由于用户行为和移动网络具有时变性,传统方法面临挑战。本文提出一种在线学习框架,优化计算与通信资源分配,兼顾各类AI服务的关键性能指标(KPIs),如精度、延迟和成本。定义了在平衡冲突KPIs前提下最大化总精度的优化问题,并证明其为NP-hard。提出基础在线解法及两种结合预学习剔除机制以缩小决策空间的变体,加速学习过程。进一步引入基于先验知识的偏差决策子集选择,提升学习速度而不牺牲性能,提供两种子集处理方案。实验表明,所提方法能高效收敛至最优决策,显著缩减决策空间并改善时间复杂度。
原文摘要 · Abstract (English)
The forthcoming 6G networks will embrace a new realm of AI-driven services that requires innovative network slicing strategies, namely slicing for AI, which involves the creation of customized network slices to meet Quality of service (QoS) requirements of diverse AI services. This poses challenges due to time-varying dynamics of users' behavior and mobile networks. Thus, this paper proposes an online learning framework to optimize the allocation of computational and communication resources to AI services, while considering their unique key performance indicators (KPIs), such as accuracy, latency, and cost. We define a problem of optimizing the total accuracy while balancing conflicting KPIs, prove its NP-hardness, and propose an online learning framework for solving it in dynamic environments. We present a basic online solution and two variations employing a pre-learning elimination method for reducing the decision space to expedite the learning. Furthermore, we propose a biased decision space subset selection by incorporating prior knowledge to enhance the learning speed without compromising performance and present two alternatives of handling the selected subset. Our results depict the efficiency of the proposed solutions in converging to the optimal decisions, while reducing decision space and improving time complexity.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。