By Topic

DWSDM: A Web Services Discovery Mechanism Based on a Distributed Hash Table

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)
Quanhao Lin ; Dept. of Comput. Sci. & Eng., Shanghai Jiaotong Univ. ; Ruonan Rao ; Minglu Li

Web services enable seamless application integration over the network regardless of programming language or operation system. A critical factor to the overall utility of Web services is an efficient discovery mechanism, but the existing Web services discovery is processed in centralized approaches such as UDDI, which has the limitations of single point of failure and performance bottleneck. In this paper, we propose a decentralized Web services discovery mechanism (DWSDM) based on a distributed hash table (DHT) to solve these problems. DWSDM leverages DHT as a rendezvous mechanism between multiple registry centers. Besides, the proposed layered architecture which decouples application tier for registry center and overlay tier for network topology could facilitate system implementation quickly. Experimental results on the prototype implementation based on improved Chord algorithm show that DWSDM achieves insignificant improvements on both robustness and scalability

Published in:

Grid and Cooperative Computing Workshops, 2006. GCCW '06. Fifth International Conference on

Date of Conference:

Oct. 2006