A Super-Peer Based Lookup in Structured Peer-to-Peer Systems

All existing lookup algorithms in structured peerto-peer (P2P) systems assume that all peers are uniform in resources (e.g., network bandwidth, storage and CPU). Messages are routed on the overlay network without considering the differences of capabilities among participating peers. However, the heterogeneity observed in deployed P2P systems is quite extreme (e.g., with up to 3 orders of magnitude difference in bandwidth). The bottleneck caused by very limited capabilities of some peers therefore could lead to inefficiency of existing lookup algorithms. In this paper we propose a super-peer based lookup algorithm and evaluate it using a detailed simulation. We show that our technique not only greatly improves the performance of processing queries but also significantly reduces aggregate bandwidth consumption and processing cost of each query.

[1]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[2]  Hector Garcia-Molina,et al.  Efficient search in peer to peer networks , 2004 .

[3]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[4]  Hector Garcia-Molina,et al.  Routing indices for peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

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

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

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

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

[9]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[10]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[11]  John Kubiatowicz,et al.  Probabilistic location and routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[13]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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