首页> 中文期刊> 《通信学报》 >满足原子事务与QoS端对端约束的服务优化选择方法

满足原子事务与QoS端对端约束的服务优化选择方法

         

摘要

提出了一种基于层次服务候选图(SCG)模型优化选择方法,该方法首先利用提出的构造规则和规约规则来构造SCG模型,以建模候选服务之间的事务约束关系,并且该模型关于事务约束的正确性得以证明;其次,提出一种基于广度优先搜索(BFS)的全局QoS感知近优选择算法,该算法基于每个任务的事务属性进行放松剪枝,以控制算法的搜索规模在多项式时间内完成.最后,以网络在线发布的实际Web服务QoS数据和随机产生数据为测试集做模拟实验,结果表明本文提出方法在全局QoS效用和选择成功率方面优于其他相关方法,同时实验通过实现事务约束自动机从实践上也验证了该方法的正确性.%An actual SCG (service candidate graph) model-based optimal service selection approach was proposed. Firstly, the approach created transactional constraint relationships among candidates as an actual SCG model with several building rules, whose correctness had been also proved; Then, an optimal QoS-aware service selection algorithm on the basis of BFS (breadth first search) was designed, where a relaxing and pruming method was applied to keep the computation scale in polynomial time. Finally, simulation experiments were conducted with real-world QoS dataset and random data-set, whose results demonstrated the beneficial performance on global QoS utility and outstanding successful selecting ratio over other related work. Meanwhile, the correctnesss has also been proved in practice by implementing a transactional automation.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号