DocumentCode :
3117325
Title :
Scalable Web Service Discovery on P2P Overlay Network
Author :
Zhou, Gang ; Yu, Jianjun ; Chen, Rui ; Zhang, Hui
Author_Institution :
Beihang Univ., Beijing
fYear :
2007
fDate :
9-13 July 2007
Firstpage :
122
Lastpage :
129
Abstract :
Decentralized approaches for Web services discovery, such as peer-to-peer, become more and more attention - getting in the scientific community. In this paper, we propose a peer-to-peer framework, which adopts an enhanced skip graph named Servicelndex as the overlay network for service discovery. To guarantee discovery efficiency, Servicelndex schemed WSDL-S (Web services semantics) as semantic Web services description language and extracted its semantic attributes as indexing keys in skip graph. Also a multi-layer P2P overlay network was constructed to aggregate similar keys and keep load balancing on peer nodes. The evaluation showed that the Servicelndex system performs considerable service discovery efficiency.
Keywords :
Web services; peer-to-peer computing; resource allocation; semantic Web; tree data structures; P2P overlay network; Servicelndex system; Web service discovery; load balancing; peer-to-peer network; semantic Web services description language; skip graph; tree data structure; Aggregates; Load management; OWL; Peer to peer computing; Programming; Protocols; Scalability; Switching systems; Systems engineering and theory; Web services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Services Computing, 2007. SCC 2007. IEEE International Conference on
Conference_Location :
Salt Lake City, UT
Print_ISBN :
0-7695-2925-9
Type :
conf
DOI :
10.1109/SCC.2007.95
Filename :
4278646
Link To Document :
بازگشت