Substitutive Web Service Retrieval Mechanism Based on Priority Algorithm
Baoxiang Cao · Computer Technology and Development · 2010
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.