FedPC Cloud CPU Forecasting using Federated Learning and Periodicity-based Clustering
DOI:
https://doi.org/10.54654/isj.v2i25.1115Keywords:
Federated Learning, Privacy-Preserving, Data Security, Workload Forecasting, Cloud Computing, LSTM, Secure Resource ManagementTóm tắt
Accurate CPU workload forecasting is vital for efficient resource management and system availability in cloud computing, yet faces challenges in data privacy, security, and the "cold start"problem for new Virtual Machines (VMs). Traditional methods risk privacy and struggle with limited data. We propose FedPC, a novel framework leveraging privacy-preserving Federated Learning (FL) with Periodicity-based Clustering. FedPC enables collaborative training without exposing local data, crucially supporting effective forecasting for new VMs with minimal historical information. It clusters VMs by workload periodicity, training tailored LSTMs within each cluster to handle heterogeneity securely. Evaluated on Azure Public Dataset V1, FedPC surpasses FedAvg in privacy and matches state-of-the-art methods in accuracy. This demonstrates FedPC’s efficacy in securely, adaptively managing resources, thereby enhancing system availability, especially in dynamic cloud environments with frequent VM creation and scarce initial data.
Downloads
References
X. Fu and C. Zhou, “Predicted affinity based virtual machine placement in cloud computing environments,”
IEEE Transactions on Cloud Computing, vol. 8, no. 1, pp. 246–255, 2017.
A. Rossi, A. Visentin, S. Prestwich, and K. N. Brown, “Bayesian uncertainty modelling for cloud
workload prediction,” in 2022 IEEE 15th International Conference on Cloud Computing (CLOUD). IEEE, 2022, pp. 19–29.
H. Tung, T. Trang, and V. Linh, “Intrusion detection using federated learning in non-iid data environments,” Journal of Science and Technology on Information Security, vol. 3, no. 23, pp. 53–61, 2024.
L. Wen, M. Xu, A. N. Toosi, and K. Ye, “Temposcale: A cloud workloads prediction approach integrating short-term and long-term information,” in 2024 IEEE 17th International Conference on Cloud Computing (CLOUD), 2024.
N. Q. Khanh, V. Tong, C. Dao, T. N. Le, and D. Tran, “Boosted regression for predicting cpu utilization in the cloud with periodicity,” The Journal of Supercomputing, vol. 80, no. 18, pp. 26 036–26 060, 2024.
R. N. Calheiros, E. Masoumi, R. Ranjan, and R. Buyya, “Workload prediction using arima model and its impact on cloud applications’ qos,” IEEE transactions on cloud computing, vol. 3, no. 4, pp. 449–458, 2014.
V.-M. Tran, V. Debusschere, and S. Bacha, “Hourly server workload forecasting up to 168 hours ahead using seasonal arima model,” in 2012 IEEE International Conference on Industrial Technology. IEEE, 2012, pp. 1127–1131.
A. Khan, X. Yan, S. Tao, and N. Anerousis, “Workload characterization and prediction in the cloud: A multiple time series approach,” in 2012 IEEE Network Operations and Management Symposium. IEEE, 2012, pp. 1287–1294.
Z. Gong, X. Gu, and J. Wilkes, “Press: Predictive elastic resource scaling for cloud systems,” in 2010 International Conference on Network and Service Management. IEEE, 2010, pp. 9–16.
E. Patel and D. S. Kushwaha, “A hybrid cnn-lstm model for predicting server load in cloud computing,” The Journal of Supercomputing, vol. 78, no. 8, pp. 1–30, 2022.
J. Dogani, F. Khunjush, and M. Seydali, “Host load prediction in cloud computing with discrete wavelet transformation (dwt) and bidirectional gated recurrent unit (bigru) network,” Computer Communications, vol. 198, pp. 157–174, 2023.
S. Islam, J. Keung, K. Lee, and A. Liu, “Empirical prediction models for adaptive resource provisioning in the cloud,” Future Generation Computer Systems, vol. 28, no. 1, pp. 155–162, 2012.
Y. Lu, J. Panneerselvam, L. Liu, and Y. Wu, “Rvlbpnn: A workload forecasting model for smart cloud computing,” Scientific Programming, vol. 2016, 2016.
F. Chen, Z. Qin, H. Zhao, and S. Deng, “Pepnet: A periodicity-perceived workload prediction network supporting rare occurrence of heavy workload,” IEEE Transactions on Cloud Computing, 2023.
N. M. Tran, T. Nam, and D. H. Epema, “Parallel workload modeling with realistic characteristics,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 8, pp. 2138–2148, 2013.
H. B. McMahan, E. Moore, D. Ramage, and B. A. y. Arcas, “Communication-efficient learning of deep networks from decentralized data,” Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, pp. 1273 1282, 2017.
E. Cortez, A. Bonde, A. Muzio, M. Russinovich, M. Fontoura, and R. Bianchini, “Resource central: Understanding and predicting workloads for improved resource management in large cloud platforms,” in Proceedings of the 26th Symposium on Operating Systems Principles, 2017, pp. 153–167.
Downloads
Published
How to Cite
Issue
Section
License
Proposed Policy for Journals That Offer Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Proposed Policy for Journals That Offer Delayed Open Access
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication, with the work [SPECIFY PERIOD OF TIME] after publication simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
