In this work we propose a new approach for semantic web matching to improve the performance of Web Service replacement. Because in automatic systems we should ensure the self-healing, self-configuration, self-optimization and self-management, all services should be always available and if one of them crashes, it should be replaced with the most similar one. Candidate services are advertised in Universal Description, Discovery and Integration (UDDI) all in Web Ontology Language (OWL). By the help of bipartite graph, we did the matching between the crashed service and a Candidate one. Then we chose the best service, which had the maximum rate of matching. In fact we compare two services` functionalities and capabilities to see how much they match. We found that the best way for matching two web services, is comparing the functionalities of them.
翻译：在这项工作中,我们提出了一个新的语义网络匹配方法,以改善网络服务替换的性能。因为在自动系统中,我们应该确保自愈合、自我配置、自我优化和自我管理,因此所有服务都应始终提供,如果其中一项崩溃,就应该用最类似的服务来取代。候选人服务在通用描述、发现和整合(UDDI)中全部在网络本体语言(OWL)中公布。在双面图的帮助下,我们做了崩溃服务与候选服务之间的匹配。然后,我们选择了最佳服务,其匹配率最高。事实上,我们比较了两种服务的功能和能力,看它们相匹配的程度。我们发现,匹配两种网络服务的最佳方式是比较它们的功能。
相关内容
微信扫码咨询专知VIP会员