Enhanced time-aware QoS prediction in multi-cloud: a hybrid k-medoids and lazy learning approach (QoPC)

被引:0
作者
Amin Keshavarzi
Abolfazl Toroghi Haghighat
Mahdi Bohlouli
机构
[1] Islamic Azad University,Faculty of Computer and Information Technology Engineering, Qazvin Branch
[2] Institute for Advanced Studies in Basic Sciences,Research Center for Basic Sciences and Modern Technologies (RBST)
[3] Petanux GmbH,Research and Innovation Department
[4] Institute for Advanced Studies in Basic Sciences,Department of Computer Science and Information Technology
来源
Computing | 2020年 / 102卷
关键词
Quality of Service; Multi-cloud; Lazy Learning; LB-Keogh; 68M14;
D O I
暂无
中图分类号
学科分类号
摘要
Cloud service providers should be able to predict the future states of their infrastructure in order to avoid any violation of Service Level Agreement. This becomes more complex when vendors have to deal with services from various providers in multi-clouds. As a result, QoS prediction can significantly support service providers in a better understanding of their resources future states. Users should also be very well aware of their resource needs, as well as the Quality of Service relative values. This paper proposes a hybrid approach to the prediction of the future value of the QoS features. The hybrid approach uses a modified version of k-medoids algorithm for the clustering of large time-series datasets, as well as a proposed algorithm inspired from the lazy learning and lower bound Dynamic Time Warping (LB-Keogh) for pruned DTW computations. The proposed method in this manuscript is a shape-based QoS prediction with a novel pre-processing method, which fulfills the missing data with statistically semi-real data. In order to solve the cold start problem, we proposed new algorithm based on the DTW Barycenter Averaging (DBA) algorithm. The results showed that our predicted values are very close to real values and achieve only 0.35 of the normalized mean absolute error rate, on average, for the WSDream dataset and 0.07 for the Alibaba dataset.
引用
收藏
页码:923 / 949
页数:26
相关论文
共 60 条
[1]  
Aghabozorgi S(2015)Time-series clustering-A decade review Inf Syst 53 16-38
[2]  
Shirkhorshidi AS(1992)Least squates estimation of missing values in time series Commun Stat Theory Methods 21 3479-3496
[3]  
Wah TY(2013)Recommender systems survey Knowl Based Syst 46 109-132
[4]  
Beveridge S(2013)Paragon: Qos-aware scheduling for heterogeneous datacenters ACM SIGPLAN Notices, ACM 48 77-88
[5]  
Bobadilla J(2014)Quasar: resource-efficient and qos-aware cluster management ACM SIGARCH Computer Architecture News, ACM 42 127-144
[6]  
Ortega F(2018)Time-aware cloud service recommendation using similarity-enhanced collaborative filtering and ARIMA model Decis Support Syst 107 103-115
[7]  
Hernando A(2013)A framework for ranking of cloud computing services Future Gener Comput Syst 29 1012-1023
[8]  
Gutiérrez A(2001)Eigentaste: a constant time collaborative filtering algorithm Inf Retr 4 133-151
[9]  
Delimitrou C(2005)Clustering of time-series subsequences is meaningless: implications for previous and future research Knowl Inf Syst 8 154-177
[10]  
Kozyrakis C(2005)Exact indexing of dynamic time warping Knowl Inf Syst 7 358-386