Chord4S: A P2P-based Decentralised Service Discovery Approach

被引:17
作者
He, Qiang [1 ,3 ]
Yan, Jun [2 ]
Yang, Yun [1 ]
Kowalczyk, Ryszard [1 ]
Jin, Hai [3 ]
机构
[1] Swinburne Univ Technol, Fac Informat & Commun Technol, Hawthorn, Vic 3122, Australia
[2] Univ Wollongong, Sch Informat Syst & Technol, Wollongong, NSW 2522, Australia
[3] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Peoples R China
来源
2008 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING, PROCEEDINGS, VOL 1 | 2008年
基金
澳大利亚研究理事会;
关键词
D O I
10.1109/SCC.2008.74
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Service-oriented computing is emerging as a paradigm for developing distributed applications. A critical issue of utilising service-oriented computing is to have a scalable, reliable and robust service discovery mechanism. However, traditional service discovery methods using centralised registries can easily suffer from problems such as performance bottleneck and vulnerability to failures in the large scalable service network, thus functioning abnormally. To address these problems, this paper proposes a peer-to-peer based decentralised service discovery approach named Chord4S. Chord4S utilises the data distribution and lookup capabilities of the popular Chord to distribute and discover services in a decentralised manner. Data availability is further improved by distributing service descriptions of functionally-equivalent services to different successor nodes that are organised into a virtual segment in the Chord circle. In addition, the Chord routing protocol is extended to support efficient discovery of multiple services with single request. This enables late negotiation of service level agreements between a service consumer and multiple service providers. The experimental evaluation shows that Chord4S achieves higher data availability and provides efficient query with reasonable overhead.
引用
收藏
页码:221 / +
页数:2
相关论文
共 21 条
[11]  
Narayanan S., 2002, Proceedings of the 11th International Conference on World Wide Web, P77, DOI DOI 10.1145/511446.511457
[12]   A scalable Content-Addressable Network [J].
Ratnasamy, S ;
Francis, P ;
Handley, M ;
Karp, R ;
Shenker, S .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2001, 31 (04) :161-172
[13]  
ROMAN D, 2005, WEB SERVICE MODELING
[14]  
Rowstron A., 2001, Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), V2218, P329, DOI 10.1007/3-540-45518-3_18
[15]   A peer-to-peer approach to Web service discovery [J].
Schmidt, C ;
Parashar, M .
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2004, 7 (02) :211-229
[16]  
STOICA I, 2001, ACM SIGCOMM, P149
[17]  
WILLIAMS C, 2007, 7 IEEE INT S CLUST C, P15
[18]   Exploiting routing redundancy via structured peer-to-peer overlays [J].
Zhao, BY ;
Huang, L ;
Stribling, J ;
Joseph, AD ;
Kubiatowicz, JD .
11TH IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS, PROCEEDINGS, 2003, :246-257
[19]  
ZHAO BY, 2001, INFRASTRUCTURE FAULT
[20]  
Zhou G, 2007, P IEEE I C SERV COMP, P122