基于优先级算法的替代Web服务检索机制-《计算机技术与发展》

文章信息/Info

Title:: Substitutive Web Service Retrieval Mechanism Based on Priority Algorithm

Author(s):: ZHOU Xia; CAO Bao-xiang; Department of Computer Science,Qufu Normal University

Keywords:: service retrieval; substitutive web service; priority algorithm; operation layer

摘要:: Web服务可替代性是指服务间相互替代的能力,为避免服务请求者的应用由于调用的服务不可用而发生异常,在对Web服务可替代性进行深入研究的基础上,提出了一种基于优先级算法的可替代Web服务检索机制。该机制采用对等结构的形式,利用所提出的第一、第二优先级排序对等节点并构造节点树,在方法层上找到最优可替代服务集合。这种方法可以有效地节省遍历节点树的时间,从现有的服务集中选择给定服务的替代服务,保证高效的Web服务替代过程,从而保证服务请求者的应用正常运行

Abstract:: Web service substitutability is the ability to substitute between services.In order to avoid exception occurrence when the application of the service requestor calls an unavailable service,with deeply studying the substitutablity of Web services,propose a substitutive Web service retrieval mechanism based on priority algorithm.The mechanism used peer-to-peer architecture,and the proposed first and second priority to sort of peer nodes and to construct a tree of nodes,to find the optimal set of alternative services on operation layer.This method can effectively save time when traversing the node tree and select the alternative service for the given service from the existing service set,to ensure efficient alternative for the process of Web services,thus ensuring the service requestor＇s application be normally replied