An efficient Semantic Web Service discovery algorithm in DHT-based P2P network

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 semant...

Full description

Saved in:
Bibliographic Details
Main Authors: Xin Wang, Chen Liu, Zhengqiu Yang
Format: Conference Proceeding
Language:English
Subjects:
Intelligent networks
Laboratories
Machine intelligence
Network topology
OWL
Peer to peer computing
peer to peer network
Semantic Web
semantic web service
service discovery
Software algorithms
Telecommunication network topology
Web services
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ICFIN.2009.5339581