By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xin Wang ; Beijing Key Lab. of Intell. Telecommun. Software & Multimedia, Beijing Univ. of Posts & Telecommun., Beijing, China ; Chen Liu ; Zhengqiu Yang

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.

Published in:

Future Information Networks, 2009. ICFIN 2009. First International Conference on

Date of Conference:

14-17 Oct. 2009