Skip to Main Content
The traditional discovery methods of semantic Web service are based on centralized registry, such as UDDI (universal description, discovery and integration). But they might lead to single point of failure and bottleneck. In this paper, we propose an efficient algorithm to publish and discover semantic Web services in DHT (distributed hash table) based on decentralized systems. The algorithm is primarily considered to discover the best Web service which meets the needs of the user in functional requirements. The algorithm is mainly focused on service's inputs and outputs, and makes them become keys to publish and discover the semantic Web services. We have developed a prototype system to verify the effectiveness of the algorithm.