摘要
考虑到把信任度作为组合服务实现成员服务选择的依据可使组合服务的执行、调度更好地围绕服务的信任度展开和有利于信任度高的成员服务加入到服务组合的过程中来,进而提高组合服务的可信性,把信任引入到服务组合中,研究了服务组合中信任感知的成员服务选择问题,建立了选择问题的数学模型,并将选择问题归结为一个最小代价集合覆盖问题,同时建立了选择问题的有向图表示方法,并设计了基于蚁群系统的选择算法。实验结果分析表明,设计的信任感知的成员服务选择算法具有较好的寻优性能。
Because introducing the trust degree as the basis of component service selection can make composite services to be scheduled and executed around the trust degree of services, thus higher trust degree services can join into service composition and the trustiness of composite service can be improved, trust is introduced into service composition and the component service selection problem of trust aware in service composition is discussed. The mathematic model of the selection problem is proposed and the problem is reduced to a minimum cost set cover problem. The directed acyclic graph (DAG) presentation of the selection problem is established and the ant colony system based selection algorithm is designed. The analysis of the experimental results indicate the selection algorithm has good performance.
出处
《高技术通讯》
EI
CAS
CSCD
北大核心
2010年第8期798-802,共5页
Chinese High Technology Letters
基金
973计划(2007CB311100)
北京工业大学博士科研启动基金(52007013200704)
北京工业大学青年基金(97002011200702/X1007011200801)资助项目
关键词
WEB服务
信任
服务组合
蚁群系统
信任度
web services, trust, service composition, ant colony system, trust degree