作　　者： ; ; ;

机构地区： 浙江大学计算机科学与技术学院

出　　处： 《系统工程理论与实践》 2012年第12期2789-2795,共7页

摘　　要： 随着基于开放Web的服务网络中服务数量的急剧增长,快速、准确地发现可信服务是面向服务计算的一个关键问题.针对开放网络环境下可信服务发现工作量大、效率低等问题,基于模拟现实世界的网络小世界特性,设计了基于信任和推荐关系的可信服务发现方法.首先,提出一种开放的具有信任和推荐关系的服务网络模型,给出该模型的形式化定义和两种关系的计算策略;接着,在具有信任和推荐关系的服务网络模型之上,给出一种动态的可信服务发现算法,该算法能有效减少服务的搜索路径,在较短的时间搜索到可信服务;最后,仿真实验表明,该方法能快速返回可信服务,具有较高的效率和满意度. With the rapid increasing number of Web services in service network, how to discover the desired trustworthy service quickly and accurately has been a hot issue of service-oriented computing. In open network environment, the efficiency of trusted service discovery is low. Take advantage of the properties of ＂small-world＇, the paper proposed a trusted service discovery method which based on trust and recommendation relationships. Firstly, an open service network model with trust and recommendation relationships was proposed. The two relationships in the model were defined. Then, based on the model and the trust and recommendation relationships, a dynamic trusted service discovery algorithm was presented. The trusted service discovery method can reduce the searching path and search trusted services for service requester in a short time. Finally, the results of the simulation experiences showed that this method can return satisfactory trusted services quickly and efficiency.

关 键 词： 可信服务发现 服务网络 信任关系 推荐关系

领　　域： [自动化与计算机技术] [自动化与计算机技术]