Score: 0

Quantifying the Performance Gap for Simple Versus Optimal Dynamic Server Allocation Policies

Published: July 25, 2025 | arXiv ID: 2507.19667v1

By: Niklas Carlsson, Derek Eager

Potential Business Impact:

Makes computer servers work smarter, saving money.

Business Areas:
Cloud Computing Internet Services, Software

Cloud computing enables the dynamic provisioning of server resources. To exploit this opportunity, a policy is needed for dynamically allocating (and deallocating) servers in response to the current load conditions. In this paper we describe several simple policies for dynamic server allocation and develop analytic models for their analysis. We also design semi-Markov decision models that enable determination of the performance achieved with optimal policies, allowing us to quantify the performance gap between simple, easily implemented policies, and optimal policies. Finally, we apply our models to study the potential performance benefits of state-dependent routing in multi-site systems when using dynamic server allocation at each site. Insights from our results are valuable to service providers wanting to balance cloud service costs and delays.

Page Count
20 pages

Category
Computer Science:
Distributed, Parallel, and Cluster Computing