Conference Paper

WSPred: A Time-Aware Personalized QoS Prediction Framework for Web Services

DOI: 10.1109/ISSRE.2011.17 Conference: IEEE 22nd International Symposium on Software Reliability Engineering, ISSRE 2011, Hiroshima, Japan, November 29 - December 2, 2011
Source: DBLP

ABSTRACT The exponential growth of Web service makes building high-quality service-oriented applications an urgent and crucial research problem. User-side QoS evaluations of Web services are critical for selecting the optimal Web service from a set of functionally equivalent service candidates. Since QoS performance of Web services is highly related to the service status and network environments which are variable against time, service invocations are required at different instances during a long time interval for making accurate Web service QoS evaluation. However, invoking a huge number of Web services from user-side for quality evaluation purpose is time-consuming, resource-consuming, and sometimes even impractical (e.g., service invocations are charged by service providers). To address this critical challenge, this paper proposes a Web service QoS prediction framework, called WSPred, to provide time-aware personalized QoS value prediction service for different service users. WSPred requires no additional invocation of Web services. Based on the past Web service usage experience from different service users, WSPred builds feature models and employs these models to make personalized QoS prediction for different users. The extensive experimental results show the effectiveness and efficiency of WSPred. Moreover, we publicly release our real-world time-aware Web service QoS dataset for future research, which makes our experiments verifiable and reproducible.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Matrix-factorization based collaborative filtering is an efficient approach to the problem of user-side quality-of-service (QoS) prediction. In this work, we focus on building a matrix-factorization-based collaborative filtering model for QoS prediction under a non-negativity constraint. The motivation is that since QoS data such as response time, cost and throughput, are all positive, a non-negative model can better demonstrate their characteristics. By investigating a non-negative training process relying on each involved feature, we invent a non-negative latent factor model to deal with the sparse QoS matrix subject to the non-negativity constraint. We subsequently introduce Tikhonov regularization into it to obtain the regularized non-negative latent factor model. Their efficiency is proven by the experimental results on a large industrial dataset.
    2014 23rd Wireless and Optical Communication Conference (WOCC); 05/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: Service-based cloud applications are typically built on component services to fulfill certain application logic. To meet quality-of-service (QoS) guarantees, these applications have to become resilient against the QoS variations of their component services. Runtime service adaptation has been recognized as a key solution to achieve this goal. To make timely and accurate adaptation decisions, effective QoS prediction is desired to obtain the QoS values of component services. However, current research has focused mostly on QoS prediction of the working services that are being used by a cloud application, but little on QoS prediction of candidate services that are also important for making adaptation decisions. To bridge this gap, in this paper, we propose a novel QoS prediction approach, namely adaptive matrix factorization (AMF), which is inspired from the collaborative filtering model used in recommender systems. Specifically, our AMF approach extends conventional matrix factorization into an online, accurate, and scalable model by employing techniques of data transformation, online learning, and adaptive weights. Comprehensive experiments have been conducted based on a real-world large-scale QoS dataset of Web services to evaluate our approach. The evaluation results provide good demonstration for our approach in achieving accuracy, efficiency, and scalability.
    2014 IEEE 34th International Conference on Distributed Computing Systems (ICDCS); 06/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: The exponential growth of Web service makes building high-quality service-oriented systems an urgent and crucial research problem. Performance of the service-oriented systems highly depends on the remote Web services as well as the unpredictability of the Internet. Performance prediction of service-oriented systems is critical for automatically selecting the optimal Web service composition. Since the performance of Web services is highly related to the service status and network environments which are variable over time, it is an important task to predict the performance of service-oriented systems at run-time. To address this critical challenge, this paper proposes an online performance prediction framework, called OPred, to provide personalized service-oriented system performance prediction efficiently. Based on the past usage experience from different users, OPred builds feature models and employs time series analysis techniques on feature trends to make performance prediction. The results of large-scale real-world experiments show the effectiveness and efficiency of OPred.
    09/2014; 44(9):1169-1181. DOI:10.1109/TSMC.2013.2297401