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 条
[1]  
[Anonymous], 2004, W3C RECOMMENDATION
[2]   PAWS: A framework for executiong adaptive Web-service processes [J].
Ardagna, Banilo ;
Comuzzi, Marco ;
Mussi, Enrico ;
Pernici, Barbara ;
Plebani, Pierluigi .
IEEE SOFTWARE, 2007, 24 (06) :39-46
[3]  
BEATTY J, 2005, WEB SERVICES DYNAMIC
[4]  
CHENG Z, 2002, VERIFYING CONSTRAINT
[5]  
Clement Luc, 2004, UDDI VERSION 3 0 2
[6]   A peer-to-peer framework for web service discovery with ranking [J].
Emekci, F ;
Sahin, OD ;
Agrawal, D ;
El Abbadi, A .
IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS, 2004, :192-199
[7]   Model-based verification of web service compositions [J].
Foster, H ;
Uchitel, S ;
Magee, J ;
Kramer, J .
18TH IEEE INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING, PROCEEDINGS, 2003, :152-161
[8]   Adaptive replication in peer-to-peer systems [J].
Gopalakrishnan, V ;
Silaghi, B ;
Bhattacharjee, B ;
Keleher, P .
24TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2004, :360-369
[9]  
HU THT, 2005, IEICE T INFORM SYS D, V88
[10]  
LI Y, 2004, 6 AS PAC WEB C ADV W, P291