A Method to Compare Scaling Algorithms for Cloud-Based Services

Danny De Vleeschauwer

doi:10.1109/TCC.2024.3500139

A Method to Compare Scaling Algorithms for Cloud-Based Services

2024-01-01

0

PRE

AI

D

Danny De Vleeschauwer *

DOI：10.1109/TCC.2024.3500139

原文链接

原文求助

摘要

En 中文

Nowadays, many services are offered via the cloud, i.e., they rely on interacting software components that can run on a set of connected Commercial Off-The-Shelf (COTS) servers sitting in data centers. As the demand for any particular service evolves over time, the computational resources associated with the service must be scaled accordingly while keeping the Key Performance Indicators (KPIs) associated with the service under control. Consequently, scaling always involves a delicate trade-off between using the cloud resources and complying with the KPIs. In this paper, we show that a (workload-dependent) Pareto front embodies this trade-off's limits. We identify this Pareto front for various workloads and assess the ability of several scaling algorithms to approach that Pareto front.

Keyword:

Cloud computing

Software algorithms

Software

Approximation algorithms

Symbols

Key performance indicator

Vectors

Synapses

Service level agreements

Servers

Cloud-based services

kubernetes

pods

scaling

A Method to Compare Scaling Algorithms for Cloud-Based Services

摘要

期刊

机构

引用论文