Grid and Cooperative Computing Workshops, International Conference on (2006)
Oct. 21, 2006 to Oct. 23, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GCCW.2006.36
Quanhao Lin , Shanghai Jiaotong University, China
Ruonan Rao , Shanghai Jiaotong University, China
Minglu Li , Shanghai Jiaotong University, China
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.
Quanhao Lin, Ruonan Rao, Minglu Li, "DWSDM: A Web Services Discovery Mechanism Based on a Distributed Hash Table", Grid and Cooperative Computing Workshops, International Conference on, vol. 00, no. , pp. 176-180, 2006, doi:10.1109/GCCW.2006.36