...
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Online QoS Prediction for Runtime Service Adaptation via Adaptive Matrix Factorization
【24h】

Online QoS Prediction for Runtime Service Adaptation via Adaptive Matrix Factorization

机译:通过自适应矩阵分解进行运行时服务适配的在线QoS预测

获取原文
获取原文并翻译 | 示例

摘要

Cloud applications built on service-oriented architectures generally integrate a number of component services to fulfill certain application logic. The changing cloud environment highlights the need for these applications to keep resilient against QoS variations of their component services so that end-to-end quality-of-service (QoS) can be guaranteed. Runtime service adaptation is a key technique to achieve this goal. To support timely and accurate adaptation decisions, effective and efficient QoS prediction is needed to obtain real-time QoS information of component services. However, current research has focused mostly on QoS prediction of working services that are being used by a cloud application, but little on predicting QoS values of candidate services that are equally important in determining optimal adaptation actions. In this paper, we propose an adaptive matrix factorization (namely AMF) approach to perform online QoS prediction for candidate services. AMF is inspired from the widely-used collaborative filtering techniques in recommender systems, but significantly extends the conventional matrix factorization model with new techniques of data transformation, online learning, and adaptive weights. Comprehensive experiments, as well as a case study, have been conducted based on a real-world QoS dataset of Web services (with over 40 million QoS records). The evaluation results demonstrate AMF’s superiority in achieving accuracy, efficiency, and robustness, which are essential to enable optimal runtime service adaptation.
机译:基于面向服务的体系结构构建的云应用程序通常会集成许多组件服务,以实现某些应用程序逻辑。不断变化的云环境凸显了这些应用程序需要保持弹性以抵御其组件服务的QoS变化,从而可以确保端到端服务质量(QoS)。运行时服务适配是实现此目标的关键技术。为了支持及时,准确的自适应决策,需要有效,高效的QoS预测以获得组件服务的实时QoS信息。但是,当前的研究主要集中在云应用程序正在使用的工作服务的QoS预测上,而很少关注预测在确定最佳适应措施方面同样重要的候选服务的QoS值。在本文中,我们提出了一种自适应矩阵分解(即AMF)方法来为候选服务执行在线QoS预测。 AMF受到推荐系统中广泛使用的协作过滤技术的启发,但通过数据转换,在线学习和自适应权重的新技术极大地扩展了常规矩阵分解模型。基于真实的Web服务QoS数据集(具有超过4,000万条QoS记录),进行了全面的实验和案例研究。评估结果表明,AMF在实现准确性,效率和鲁棒性方面具有优越性,这对于实现最佳的运行时服务适应至关重要。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号