mlsanityData to 7 Oct 2026

A Deep Recurrent-Reinforcement Learning Method for Intelligent AutoScaling of Serverless Functions

arXiv 2308.05937 ↗First posted 11 Aug 2023cs.DC cs.AI cs.SYcited by 5

Not on the map. Why?

Abstract (arXiv)

FaaS introduces a lightweight, function-based cloud execution model that finds its relevance in a range of applications like IoT-edge data processing and anomaly detection. While cloud service providers offer a near-infinite function elasticity, these applications often experience fluctuating workloads and stricter performance constraints. A typical CSP strategy is to empirically determine and adjust desired function instances or resources, known as autoscaling, based on monitoring-based thresholds such as CPU or memory, to cope with demand and performance. However, threshold configuration either requires expert knowledge, historical data or a complete view of the environment, making autoscaling a performance bottleneck that lacks an adaptable solution. RL algorithms are proven to be beneficial in analysing complex cloud environments and result in an adaptable policy that maximizes the expected objectives. Most realistic cloud environments usually involve operational interference and have limited visibility, making them partially observable. A general solution to tackle observability in highly dynamic settings is to integrate Recurrent units with model-free RL algorithms and model a decision process as a POMDP. Therefore, in this paper, we investigate model-free Recurrent RL agents for function autoscaling and compare them against the model-free PPO algorithm. We explore the integration of a LSTM network with the state-of-the-art PPO algorithm to find that under our experimental and evaluation settings, recurrent policies were able to capture the environment parameters and show promising results for function autoscaling. We further compare a PPO-based autoscaling agent with commercially used threshold-based function autoscaling and posit that a LSTM-based autoscaling agent is able to improve throughput by 18%, function execution by 13% and account for 8.4% more function instances.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 12 of its 42 references that are in the map. First posted on arXiv 11 Aug 2023.

Builds on

12 of 42 references.

References · 12

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 457
  3. 2021Recurrent Model-Free RL Can Be a Strong Baseline for Many POMDPscited by 115
  4. 2020Serverless in the Wild: Characterizing and Optimizing the Serverless Workload at a Large Cloud Providercited by 65
  5. 2017Serverless Computing: Current Trends and Open Problemscited by 17
  6. 2015Recurrent Reinforcement Learning: A Hybrid Approachcited by 13
  7. 2018Serverless Computing: One Step Forward, Two Steps Backcited by 12
  8. 2019Serverless Computing: A Survey of Opportunities, Challenges and Applicationscited by 11
  9. 2016Auto-scaling Web Applications in Clouds: A Taxonomy and Surveycited by 6
  10. 2020AI-based Resource Allocation: Reinforcement Learning for Adaptive Auto-scaling in Serverless Environmentscited by 5
  11. 2022Effective Multi-User Delay-Constrained Scheduling with Deep Recurrent Reinforcement Learningcited by 3
  12. 2023Deep Q-Learning versus Proximal Policy Optimization: Performance Comparison in a Material Sorting Taskcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 2; 2026: 2.

5 papers.