CAJ | 학술논문

为解决集中式服务发现结构存在的性能瓶颈问题,基于领域本体语义信息,提出一种能自适应地调整领域划分、分配系统资源的分布式web服务发现体系结构,并分析了该结构的可扩展性、自组织性和自适应性.具体描述了该结构下的语义web服务发现算法的2个阶段:语义注册中心定位和基于输入输出的服务匹配.在注册中心组成的平衡树拓扑结构中,注册代理能够快速将请求转发至目标注册中心,避免产生性能瓶颈.然后,通过引入一种新的基于语义距离的服务匹配算法来进行服务查询效果优化.模拟实验结果表明:提出的服务发现方法具有高可扩展性的优点；与其他服务查询算法相比,服务匹配算法具有更高的查全率和查准率.
위해결집중식복무발현결구존재적성능병경문제,기우영역본체어의신식,제출일충능자괄응지조정영역화분、분배계통자원적분포식web복무발현체계결구,병분석료해결구적가확전성、자조직성화자괄응성.구체묘술료해결구하적어의web복무발현산법적2개계단:어의주책중심정위화기우수입수출적복무필배.재주책중심조성적평형수탁복결구중,주책대리능구쾌속장청구전발지목표주책중심,피면산생성능병경.연후,통과인입일충신적기우어의거리적복무필배산법래진행복무사순효과우화.모의실험결과표명:제출적복무발현방법구유고가확전성적우점；여기타복무사순산법상비,복무필배산법구유경고적사전솔화사준솔.
To solve the bottleneck problem in centralized service discovery methods, a novel architecture based on domain ontology for semantic service discovery is proposed.This distributed architecture can adjust the domain partition and　allocate　system　resources　automatically.　The characteristics of this mechanism are analyzed, including scalability, self-organization　and　adaptability. In　this mechanism,semantic web service discovery is separated into two parts.First,under balance tree topology,registry proxy can rapidly forward requests to the objective registry center,and avoid the bottleneck problem. Secondly, a semantic distance based service matching algorithm is proposed to promote the effect of service searching. The results of simulation experiments show that the proposed mechanism can serve as a scalable solution for semantic web service publication and discovery. And the　improved　matching algorithm　has　higher　recall　and　precision　than　other algorithms.