arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.12783cs.NI
收藏

基于深度强化学习的预算约束下无服务器边缘计算成本优化

Cost Optimization for Serverless Edge Computing with Budget Constraints using Deep Reinforcement Learning

Chen Chen, Peiyuan Guan, Ziru Chen, Amir Taherkordi, Fen Hou, Lin X. Cai

AI总结:

针对无服务器边缘计算中预算约束下的成本优化问题,提出基于强化学习的在线调度算法,在1.03因子内逼近ILP最优解,且决策时间降低5个数量级。

摘要:

无服务器计算采用按需付费的计费模式,其中应用程序在由事件触发的无状态且短期的容器中执行,从而降低了货币成本和资源利用率。然而,现有平台并未为计费模式提供上限,这使得总体成本不可预测,阻碍了许多组织管理其预算。由于无服务器功能的多样性和边缘设备容量的异构性,在多项式时间内获得部署成本的近似最优解颇具挑战性。本文研究了无线网络中无服务器计算在预算约束下的函数调度问题。用户和物联网设备向边缘节点发送请求,从而改善了用户感知的延迟。我们提出了两种基于强化学习的在线调度算法,该算法融合了无服务器功能的若干重要特性。通过大量仿真,我们通过与ILP求解器(Midaco)进行比较来证明所提出算法的优越性。结果表明,所提出的算法在1.03的因子内有效逼近Midaco的结果,而我们的决策时间比Midaco少5个数量级。

英文摘要:

Serverless computing adopts a pay-as-you-go billing model where applications are executed in stateless and shortlived containers triggered by events, resulting in a reduction of monetary costs and resource utilization. However, existing platforms do not provide an upper bound for the billing model which makes the overall cost unpredictable, precluding many organizations from managing their budgets. Due to the diverse ranges of serverless functions and the heterogeneous capacity of edge devices, it is challenging to receive near-optimal solutions for deployment cost in a polynomial time. In this paper, we investigated the function scheduling problem with a budget constraint for serverless computing in wireless networks. Users and IoT devices are sending requests to edge nodes, improving the latency perceived by users. We propose two online scheduling algorithms based on reinforcement learning, incorporating several important characteristics of serverless functions. Via extensive simulations, we justify the superiority of the proposed algorithm by comparing with an ILP solver (Midaco). Our results indicate that the proposed algorithms efficiently approximate the results of Midaco within a factor of 1.03 while our decision-making time is 5 orders of magnitude less than that of Midaco.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑