首页> 外文会议>International conference on service-oriented computing >Probabilistic Qualitative Preference Matching in Long-Term IaaS Composition
【24h】

Probabilistic Qualitative Preference Matching in Long-Term IaaS Composition

机译:长期IaaS组合中的概率定性偏好匹配

获取原文

摘要

We propose a qualitative similarity measure approach to select an optimal set of probabilistic Infrastructure-as-a-Service (IaaS) requests according to the provider's probabilistic preferences over a long-term period. The long-term qualitative preferences are represented in probabilistic temporal CP-Nets. The preferences are indexed in a k-d tree to enable the multidimensional similarity measure using tree matching approaches. A probabilistic range sampling approach is proposed to reduce the large multidimensional search space in temporal CP-Nets. A probability distribution matching approach is proposed to reduce the approximation error in the similarity measure. Experimental results prove the feasibility of the proposed approach.
机译:我们提出了一种定性相似性度量方法,以根据提供商在长期内的概率偏好,选择一组最佳的概率基础设施即服务(IaaS)请求。长期的质性偏好在概率时态CP-Net中表示。在k-d树中对首选项进行索引,以使用树匹配方法启用多维相似性度量。提出了一种概率范围采样方法来减少时空CP-Net中的大型多维搜索空间。提出了一种概率分布匹配方法,以减少相似性度量中的近似误差。实验结果证明了该方法的可行性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号