A Theory of Auto-Scaling for Resource Reservation in Cloud Services
From MaRDI portal
Publication:5046013
DOI10.1287/stsy.2021.0091zbMath1502.90039arXiv2005.13744OpenAlexW3030924737MaRDI QIDQ5046013
Konstantinos Psychas, Javad Ghaderi
Publication date: 8 November 2022
Published in: Stochastic Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.13744
Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online knapsack revisited
- An exact algorithm for large unbounded knapsack problems
- Loss networks
- Large loss networks
- Optimization via trunk reservation in single resource loss systems under heavy traffic
- Unbounded knapsack problem: Dynamic programming revisited
- A formal proof in Coq of Lasalle's invariance principle
- Stochastic on-line knapsack problems
- Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints
- Choosing among heterogeneous server clouds
- Optimal Control and Trunk Reservation in Loss Networks
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks
- An Infinite Server System with General Packing Constraints
- Large-scale heterogeneous service systems with general packing constraints
- Adaptive Resource Provisioning for the Cloud Using Online Bin Packing
- Queueing Networks and Markov Chains
