【作者】 梁凤凤；

【导师】 苏森；

【作者基本信息】 北京邮电大学 ， 计算机科学与技术， 2008， 硕士

【摘要】 近年来,web服务作为一种新兴的web应用模式,发展非常迅速。随着web服务的增多,在海量的web服务中准备而有效地找到满足需求的服务的重要性显得愈加突出。传统的web服务发现主要基于集中式网络结构,很难提供动态的服务发现并且具有单点失败和性能瓶颈等缺点;另一方面,语义信息的不足和依赖关键字匹配容易造成查找精确度不够,难以保证服务发现的性能和质量。本文以Web服务中的服务发现问题为出发点,在语义web服务技术的基础上,对在大规模分布式环境下如何进行语义Web服务的发现和定位展开了深入的研究。论文对研究过程中取得的主要成果进行了详细阐述。这些工作简要归纳如下:(1)提出了一种基于P2P思想的融合语义信息的网络结构一—SAN(Semantic Addressable Network),SAN中每个结点都维护了一定的语义信息,从而可以使语义相近的服务注册在SAN空间中相近的结点之上,从而为实现语义路由提供基础。(2)针对服务发现中缺乏对语义的支持,提出了根据用来描述服务的本体概念之间的语义关系对服务进行编码并将其映射到SAN空间的方案。(3)提出了一种基于通用余弦相似度度量GCSM(GeneralizedCosine－Similarity Measure)的服务相似度计算方法,与一般的对每个概念分别寻找和它相似度最大的概念的多概念匹配方法相比,本文的方法通过服务向量来计算服务相似度,可以提高计算的速度,降低系统的开销。更多还原

【Abstract】 With the growing of Service-oriented computing and Web Services, more and more Web Services are becoming available on the Internet. The increasing number of Web Services demands for a scalable, flexible and reliable solution to discover the most appropriate services. Traditional web services discovery mechanisms, which publish WSDL-described Web Services in UDDIs , can not support queries that seek neer matches to a Web Service according to their semantic information, and UDDI has became the bottleneck of the whole system and would cause single node failure problems, A distributed and dynamic service discovery mechanism becomes a key requirement for service requestors.According to the research trends in this area, the thesis is focused on distributed Web Services discovery problem and makes an in-depth study on how to find a service on internet by distributed infrastructure and semantic information. The main contributions of this thesis are summarized as follows:First, We proposed a Semantic Addressable Network(SAN) that replace the traditional centralized web service discovery model, by distributing the semantic information among all the peers in the P2P network , which provide fundamental basis for semantic routing.At the same time, In view of Web Service Discovery’s lack of semantic oriented support, a mapping mechanism is proposed based on ontology, so as to ensure that every service be registered on the specific node that in charge of corresponding semantic information, Then a semantic Web service matching algorithm is proposed to calculate the semantic similarity between services based on their semantic description such as IOPE. Comparing with the traditional method, this method has lower time complexity, because it does not need to traverse all the concepts recursively.更多还原