Thomas Weripuo Gyeera
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Thomas Weripuo Gyeera has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Anthony J. H. Simons
Department of Computer Science, University of Sheffield, Sheffield, U.K.
2 shared publications Anthony J.H. Simons
2 shared publicationsMike Stannett
2 shared publications- Mike Stannett
Department of Computer Science, University of Sheffield, Sheffield, U.K.
2 shared publications
Latest Publications
- 20 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 9 (4) , 1071-1085
Regression Analysis of Predictions and Forecasts of Cloud Data Center KPIs Using the Boosted Decision Tree Algorithm
Cloud data centers seek to optimize their provision of pooled CPU, bandwidth and storage resources. While over-provision is wasteful, under-provision may lead to violating Service Level Agreements (SLAs) with their consumers; yet the relationship between low-level Key Performance Indicators (KPIs) and SLA violations is not well understood. State-of-the art monitoring systems typically react to service failures after the fact, partly due to unexpected nonlinearities in the aggregated performance data. We seek to provide better modelling of KPIs using predictive algorithms that could be used for the proactive monitoring and adaptation of cloud services. In this paper, we investigate the Boosted Decision Tree (BDT) regression algorithm. We tested the BDT algorithm in a real monitoring framework deployed on a novel Azure cloud test-bed distributed over multiple geolocations, using thousands of robot-user requests to produce huge volumes of KPI data. The BDT algorithm achieved an R-Squared score of 0.9991 at the 0.2 learning rate. This closely predicted the KPI data and outperformed other approaches, such as Ordinary Least Squares and Stochastic Gradient Descent; and is a promising candidate for making short- and long-term predictions for cloud resource allocation.
- 20 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 9 (4) , 1071-1085
Regression Analysis of Predictions and Forecasts of Cloud Data Center KPIs Using the Boosted Decision Tree Algorithm
Cloud data centers seek to optimize their provision of pooled CPU, bandwidth and storage resources. While over-provision is wasteful, under-provision may lead to violating Service Level Agreements (SLAs) with their consumers; yet the relationship between low-level Key Performance Indicators (KPIs) and SLA violations is not well understood. State-of-the art monitoring systems typically react to service failures after the fact, partly due to unexpected nonlinearities in the aggregated performance data. We seek to provide better modelling of KPIs using predictive algorithms that could be used for the proactive monitoring and adaptation of cloud services. In this paper, we investigate the Boosted Decision Tree (BDT) regression algorithm. We tested the BDT algorithm in a real monitoring framework deployed on a novel Azure cloud test-bed distributed over multiple geolocations, using thousands of robot-user requests to produce huge volumes of KPI data. The BDT algorithm achieved an R-Squared score of 0.9991 at the 0.2 learning rate. This closely predicted the KPI data and outperformed other approaches, such as Ordinary Least Squares and Stochastic Gradient Descent; and is a promising candidate for making short- and long-term predictions for cloud resource allocation.
- 25 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (4) , 2742-2754
Kalman Filter Based Prediction and Forecasting of Cloud Server KPIs
Cloud computing depends on the dynamic allocation and release of resources, on demand, to meet heterogeneous computing needs. This is challenging for cloud data centers, which process huge amounts of data characterised by its high volume, velocity, variety and veracity (4Vs model). Managing such a workload is increasingly difficult using state-of-the-art methods for monitoring and adaptation, which typically react to service failures after the fact. To address this, we seek to develop proactive methods for predicting future resource exhaustion and cloud service failures. Our work uses a realistic test bed in the cloud, which is instrumented to monitor and analyze resource usage. In this paper, we employed the optimal Kalman filtering technique to build a predictive and analytic framework for cloud server KPIs, based on historical data. Our k-step-ahead predictions on historical data yielded a prediction accuracy of 95.59%. The information generated from the framework can best be used for optimal resources provisioning, admission control and cloud SLA management.
- 25 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (4) , 2742-2754
Kalman Filter Based Prediction and Forecasting of Cloud Server KPIs
Cloud computing depends on the dynamic allocation and release of resources, on demand, to meet heterogeneous computing needs. This is challenging for cloud data centers, which process huge amounts of data characterised by its high volume, velocity, variety and veracity (4Vs model). Managing such a workload is increasingly difficult using state-of-the-art methods for monitoring and adaptation, which typically react to service failures after the fact. To address this, we seek to develop proactive methods for predicting future resource exhaustion and cloud service failures. Our work uses a realistic test bed in the cloud, which is instrumented to monitor and analyze resource usage. In this paper, we employed the optimal Kalman filtering technique to build a predictive and analytic framework for cloud server KPIs, based on historical data. Our k-step-ahead predictions on historical data yielded a prediction accuracy of 95.59%. The information generated from the framework can best be used for optimal resources provisioning, admission control and cloud SLA management.
- Open Access
- 19 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Kalman filter based prediction and forecasting of cloud server KPIs
Cloud computing depends on the dynamic allocation and release of resources, on demand, to meet heterogeneous computing needs. This is challenging for cloud data centers, which process huge amounts of data characterised by its high volume, velocity, variety and veracity (4Vs model). Managing such a workload is increasingly difficult using state-of-the-art methods for monitoring and adaptation, which typically react to service failures after the fact. To address this, we seek to develop proactive methods for predicting future resource exhaustion and cloud service failures. Our work uses a realistic test bed in the cloud, which is instrumented to monitor and analyze resource usage. In this paper, we employed the optimal Kalman filtering technique to build a predictive and analytic framework for cloud server KPIs, based on historical data. Our k-step-ahead predictions on historical data yielded a prediction accuracy of 95.59%. The information generated from the framework can best be used for optimal resources provisioning, admission control and cloud SLA management.
- 19 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessKalman filter based prediction and forecasting of cloud server KPIs
Cloud computing depends on the dynamic allocation and release of resources, on demand, to meet heterogeneous computing needs. This is challenging for cloud data centers, which process huge amounts of data characterised by its high volume, velocity, variety and veracity (4Vs model). Managing such a workload is increasingly difficult using state-of-the-art methods for monitoring and adaptation, which typically react to service failures after the fact. To address this, we seek to develop proactive methods for predicting future resource exhaustion and cloud service failures. Our work uses a realistic test bed in the cloud, which is instrumented to monitor and analyze resource usage. In this paper, we employed the optimal Kalman filtering technique to build a predictive and analytic framework for cloud server KPIs, based on historical data. Our k-step-ahead predictions on historical data yielded a prediction accuracy of 95.59%. The information generated from the framework can best be used for optimal resources provisioning, admission control and cloud SLA management.
- Open Access
- 14 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Regression Analysis of Predictions and Forecasts of Cloud Data Centre KPIs Using the Boosted Decision Tree Algorithm
The National Institute of Standards and Technology defines the fundamental characteristics of cloud computing as: on-demand computing, offered via the network, using pooled resources, with rapid elastic scaling and metered charging. The rapid dynamic allocation and release of resources on demand to meet heterogeneous computing needs is particularly challenging for data centres, which process a huge amount of data characterised by its high volume, velocity, variety and veracity (4Vs model). Data centres seek to regulate this by monitoring and adaptation, typically reacting to service failures after the fact. We present a real cloud test bed with the capabilities of proactively monitoring and gathering cloud resource information for making predictions and forecasts. This contrasts with the state-of-the-art reactive monitoring of cloud data centres. We argue that the behavioural patterns and Key Performance Indicators (KPIs) characterizing virtualized servers, networks, and database applications can best be studied and analysed with predictive models. Specifically, we applied the Boosted Decision Tree machine learning algorithm in making future predictions on the KPIs of a cloud server and virtual infrastructure network, yielding an R-Square of 0.9991 at a 0.2 learning rate. This predictive framework is beneficial for making short- and long-term predictions for cloud resources.
- 14 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessRegression Analysis of Predictions and Forecasts of Cloud Data Centre KPIs Using the Boosted Decision Tree Algorithm
The National Institute of Standards and Technology defines the fundamental characteristics of cloud computing as: on-demand computing, offered via the network, using pooled resources, with rapid elastic scaling and metered charging. The rapid dynamic allocation and release of resources on demand to meet heterogeneous computing needs is particularly challenging for data centres, which process a huge amount of data characterised by its high volume, velocity, variety and veracity (4Vs model). Data centres seek to regulate this by monitoring and adaptation, typically reacting to service failures after the fact. We present a real cloud test bed with the capabilities of proactively monitoring and gathering cloud resource information for making predictions and forecasts. This contrasts with the state-of-the-art reactive monitoring of cloud data centres. We argue that the behavioural patterns and Key Performance Indicators (KPIs) characterizing virtualized servers, networks, and database applications can best be studied and analysed with predictive models. Specifically, we applied the Boosted Decision Tree machine learning algorithm in making future predictions on the KPIs of a cloud server and virtual infrastructure network, yielding an R-Square of 0.9991 at a 0.2 learning rate. This predictive framework is beneficial for making short- and long-term predictions for cloud resources.
- Open Access
- 19 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Regression Analysis of Predictions and Forecasts of Cloud Data centre KPIs using the Boosted Tree Decision Algorithm
The National Institute of Standards and Technology defines the fundamental characteristics of cloud computing as: on-demand computing, offered via the network, using pooled resources, with rapid elastic scaling and metered charging. The rapid dynamic allocation and release of resources on demand to meet heterogeneous computing needs is particularly challenging for data centres, which process a huge amount of data characterised by its high volume, velocity, variety and veracity (4Vs model). Data centres seek to regulate this by monitoring and adaptation, typically reacting to service failures after the fact. We present a real cloud test bed with the capabilities of proactively monitoring and gathering cloud resource information for making predictions and forecasts. This contrasts with the state-of-the-art reactive monitoring of cloud data centres. We argue that the behavioural patterns and Key Performance Indicators (KPIs) characterizing virtualized servers, networks, and database applications can best be studied and analysed with predictive models. Specifically, we applied the Boosted Decision Tree machine learning algorithm in making future predictions on the KPIs of a cloud server and virtual infrastructure network, yielding an R-Square of 0.9991 at a 0.2 learning rate. This predictive framework is beneficial for making short- and long-term predictions for cloud resources.
- 19 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessRegression Analysis of Predictions and Forecasts of Cloud Data centre KPIs using the Boosted Tree Decision Algorithm
The National Institute of Standards and Technology defines the fundamental characteristics of cloud computing as: on-demand computing, offered via the network, using pooled resources, with rapid elastic scaling and metered charging. The rapid dynamic allocation and release of resources on demand to meet heterogeneous computing needs is particularly challenging for data centres, which process a huge amount of data characterised by its high volume, velocity, variety and veracity (4Vs model). Data centres seek to regulate this by monitoring and adaptation, typically reacting to service failures after the fact. We present a real cloud test bed with the capabilities of proactively monitoring and gathering cloud resource information for making predictions and forecasts. This contrasts with the state-of-the-art reactive monitoring of cloud data centres. We argue that the behavioural patterns and Key Performance Indicators (KPIs) characterizing virtualized servers, networks, and database applications can best be studied and analysed with predictive models. Specifically, we applied the Boosted Decision Tree machine learning algorithm in making future predictions on the KPIs of a cloud server and virtual infrastructure network, yielding an R-Square of 0.9991 at a 0.2 learning rate. This predictive framework is beneficial for making short- and long-term predictions for cloud resources.