A DHT-based service routing method: S-Chord

Abstract Service Composition is a promising technology for providing on-demand services in dynamic way. However, how to composite services automatically in a large scale service oriented network with minimized the user-perceived interference is still a problem to be solved. In this paper, taking the advantage of load balancing in a peer-to-peer (P2P) scheme, we propose a novel approach to support the efficient service composition using a P2P service routing algorithm using aggregated route. Evaluation results shows that our design for service routing outperforms traditional P2P algorithms in a service oriented network.

[1]  Ben Y. Zhao,et al.  The Ninja architecture for robust Internet-scale systems and services , 2001, Comput. Networks.

[2]  Anne H. H. Ngu,et al.  QoS computation and policing in dynamic web service selection , 2004, WWW Alt. '04.

[3]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[4]  Klara Nahrstedt,et al.  A scalable QoS-aware service aggregation model for peer-to-peer computing grids , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[5]  Stefan Savage,et al.  Structured superpeers: leveraging heterogeneity to provide constant-time lookup , 2003, Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003.

[6]  Klara Nahrstedt,et al.  On Exploring Performance Optimizations in Web Service Composition , 2004, Middleware.

[7]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[8]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[9]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[10]  Klara Nahrstedt,et al.  Finding service paths in a media service proxy network , 2001, IS&T/SPIE Electronic Imaging.

[11]  Ben Y. Zhao,et al.  Brocade: Landmark Routing on Overlay Networks , 2002, IPTPS.

[12]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[13]  Magnus Karlsson,et al.  Turning heterogeneity into an advantage in overlay routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Bo Li,et al.  Hybrid Overlay Structure Based on Random Walks , 2005, IPTPS.

[15]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.