A Novel Semantic Web Service Discovery Scheme Using Bipartite Graph

With the increasing adoption of Web Services and service-oriented computing paradigm, there is a growing need for efficient mechanism for Web Service discovery. The current semantic matchmaking algorithms are mainly based on the comparison of inputs and outputs of the service request and advertised service. Here reducing the service discovery time and increasing the quality of discovery are the key issues. This paper proposes a new semantic Web Service discovery scheme using bipartite graph and improved Hungarian algorithm to achieve the goal. Computer simulation reveals that the proposed scheme substantially reduces the discovery time compared to the existing scheme, while the improvement gets more significant as the size of the system increases. Moreover, the proposed scheme allows higher quality service discovery compared to the UDDI based discovery.