Ksurf+: Attention Kalman Filter for Prediction Under Highly Variable Cloud Workloads

Resource estimation and workload forecasting are critical in cloud data centers. Complexity in the cloud provider environment due to varying numbers of virtual machines introduces high variability in workloads and resource usage, making estimations problematic using state-of-the-art models that fail to deal with nonlinear characteristics. High measurement noise and variance affect the estimation of resource metrics of cloud systems across packet networks influenced by unknown external dynamics. An ideal solution to these problems is the Kalman filter, a variance-minimizing estimator, ideal for highly variable data. This work introduces Ksurf+, a novel Kalman filter estimator using selective principal component analysis and an attention mechanism for enhanced short-horizon prediction. Ksurf+ improves prediction accuracy by 37% over state-of-the-art Kalman filters in prediction tasks, reduces the time series prediction error of the state-of-the-art Bi-directional Grid Long Short-Term Memory neural network by over 40%, improves Kafka workload-based scaling stability by 58%, reduces Kafka queue size and lowers Kubernetes worker pod CPU usage by 11.6% on the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$VarBench$</tex-math></inline-formula> benchmark.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Cloud Computing
Published
2025-09-03
DOI
https://doi.org/10.1109/tcc.2025.3605828
Citations
1
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
3.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Ksurf+: Attention Kalman Filter for Prediction Under Highly Variable Cloud Workloads

Michael Dang’ana, Hans‐Arno Jacobsen
1 citations
IEEE Transactions on Cloud Computing
Cloud Computing and Resource Management
3.25
article

Ksurf+: Attention Kalman Filter for Prediction Under Highly Variable Cloud Workloads

Michael Dang’ana, Hans‐Arno Jacobsen
article en
1 citations

Abstract

Resource estimation and workload forecasting are critical in cloud data centers. Complexity in the cloud provider environment due to varying numbers of virtual machines introduces high variability in workloads and resource usage, making estimations problematic using state-of-the-art models that fail to deal with nonlinear characteristics. High measurement noise and variance affect the estimation of resource metrics of cloud systems across packet networks influenced by unknown external dynamics. An ideal solution to these problems is the Kalman filter, a variance-minimizing estimator, ideal for highly variable data. This work introduces Ksurf+, a novel Kalman filter estimator using selective principal component analysis and an attention mechanism for enhanced short-horizon prediction. Ksurf+ improves prediction accuracy by 37% over state-of-the-art Kalman filters in prediction tasks, reduces the time series prediction error of the state-of-the-art Bi-directional Grid Long Short-Term Memory neural network by over 40%, improves Kafka workload-based scaling stability by 58%, reduces Kafka queue size and lowers Kubernetes worker pod CPU usage by 11.6% on the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$VarBench$</tex-math></inline-formula> benchmark.

IEEE Transactions on Cloud ComputingVol. 13(4)
University of Toronto (CA)
Openalex Percentile: Top 7%
Cloud Computing and Resource Management
3.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.