arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.14141eess.SYcs.AIcs.NIcs.SY
收藏

面向负载均衡与自动扩缩容的弱耦合MDP策略在线学习

Online Learning of Weakly Coupled MDP Policies for Load Balancing and Auto Scaling

Indian Institute of Science(印度科学学院);IMT Atlantique Bretagne-Pays de la Loire(大西洋理工学院布列塔尼-卢瓦尔河地区校区);Institute of Computing, Federal University of Rio de Janeiro (UFRJ)(里约热内卢联邦大学计算机研究所)

S. R. Eshwar, Lucas Lopes Felipe, Alexandre Reiffers-Masson, Daniel Sadoc Menasché, Gugan Thoppe

AI总结:

针对突发流量下负载均衡与自动扩缩容的动态资源分配问题,本文将其建模为弱耦合MDP,提出更易求解的松弛LP公式,并基于拉格朗日双时间尺度算法实现在线参数学习与策略优化。

摘要:

负载均衡与自动扩缩容是当代可扩展系统的核心,用于应对工作负载变化,实现动态资源分配与服务速率调整。本文提出了一种新型模型与算法,用于协同调优负载均衡器与自动扩缩容器,研究场景为到达有限队列的突发流量。我们首先将该问题建模为弱耦合马尔可夫决策过程(MDP),可通过线性规划(LP)求解。但由于该线性规划的控制变量数量呈组合式增长,我们提出了一种更易求解的松弛线性规划公式,并基于该线性规划的拉格朗日函数,采用双时间尺度算法将其扩展,以解决在线参数学习与策略优化问题。

英文摘要:

Load balancing and auto scaling are at the core of scalable, contemporary systems, addressing dynamic resource allocation and service rate adjustments in response to workload changes. This paper introduces a novel model and algorithms for tuning load balancers coupled with auto scalers, considering bursty traffic arriving at finite queues. We begin by presenting the problem as a weakly coupled Markov Decision Processes (MDP), solvable via a linear program (LP). However, as the number of control variables of such LP grows combinatorially, we introduce a more tractable relaxed LP formulation, and extend it to tackle the problem of online parameter learning and policy optimization using a two-timescale algorithm based on the LP Lagrangian.

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

↑