DocumentCode :
2966780
Title :
Web Services Publishing and Discovery on Peer-to-Peer Overlay
Author :
Yu, Jianjun ; Chen, Rui ; Su, Hao ; Guo, Shengmin
Author_Institution :
Dept. of Comput. Sci., Beihang Univ., Beijing
fYear :
2006
fDate :
Dec. 2006
Firstpage :
329
Lastpage :
334
Abstract :
Centralized UDDI currently becomes harder to catch up with the need of Internet-scale service publishing and discovery. Peer-to-peer technology with its advantages of scalability, fault-tolerance and dynamics is suitable for loose-coupled Web services´ distribution in nature and prevailing nowadays. In this paper, we present a distributed, collaborative peer-to-peer service overlay suitable for service publishing and discovery based on skip graph which could be organized by planar model or tree model according to the scale of services. We propose a prefix-ordered clustering mechanism that congregates the keys within a fixed prefix into the same bucket and make the smallest one appeared as the key in the service overlay which would support prefix, range query and semantic matching on Web services. We then analyze the performance of our proposed with simulation that validates the effectiveness of the service overlay
Keywords :
Web services; pattern clustering; peer-to-peer computing; Web service discovery; Web service publishing; collaborative peer-to-peer service overlay; distributed peer-to-peer service overlay; planar model; prefix-ordered clustering; range query; semantic matching; skip graph; tree model; Analytical models; Collaboration; Fault tolerance; Peer to peer computing; Performance analysis; Publishing; Scalability; Tree graphs; Web and internet services; Web services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Services Computing, 2006. APSCC '06. IEEE Asia-Pacific Conference on
Conference_Location :
Guangzhou, Guangdong
Print_ISBN :
0-7695-2751-5
Type :
conf
DOI :
10.1109/APSCC.2006.115
Filename :
4041254
Link To Document :
بازگشت