The Hybrid Chord Protocol: A Peer-to-Peer Lookup Service for Context-Aware Mobile Applications

A fundamental problem in Peer-to-Peer (P2P) overlay networks is how to efficiently find a node that shares a requested object. The Chord protocol is a distributed lookup protocol addressing this problem using hash keys to identify the nodes in the network and also the shared objects. However, when a node joins or leaves the Chord ring, object references have to be rearranged in order to maintain the hash key mapping rules. This leads to a heavy traffic load, especially when nodes stay in the Chord ring only for a short time. In mobile scenarios storage capacity, transmission data rate and battery power are limited resources, so the heavy traffic load generated by the shifting of object references can lead to severe problems when using Chord in a mobile scenario. In this paper, we present the Hybrid Chord Protocol (HCP). HCP solves the problem of frequent joins and leaves of nodes. As a further improvement of an efficient search, HCP supports the grouping of shared objects in interest groups. Our concept of using information profiles to describe shared objects allows defining special interest groups (context spaces) and a shared object to be available in multiple context spaces.

[1]  Emin Gün Sirer,et al.  Herbivore: A Scalable and Efficient Protocol for Anonymous Communication , 2003 .

[2]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[3]  Wolfgang Kellerer,et al.  Hybrid DHT Design for Mobile Environments , 2006, AP2PC.

[4]  Kang-Won Lee,et al.  Supporting efficient keyword-based file search in peer-to-peer file sharing systems , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[5]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.

[6]  Scott Shenker,et al.  Complex Queries in Dht-based Peer-to-peer Networks , 2002 .

[7]  Sandhya Dwarkadas,et al.  Calot : a Constant-Diameter Low-Traffic Distributed Hash Table , 2003 .

[8]  Thomas Friese,et al.  A Framework for Resource Management in Peer-to-Peer Networks , 2002, NetObjectDays.

[9]  Karthik Lakshminarayanan,et al.  Hyperchord: A Peer-to-Peer Data Location Architecture , 2001 .

[10]  Scott Shenker,et al.  Peer-to-Peer Systems III, Third International Workshop, IPTPS 2004, La Jolla, CA, USA, February 26-27, 2004, Revised Selected Papers , 2005, IPTPS.

[11]  Wolfgang Kellerer,et al.  Proactive Search Routing for Mobile Peer-to-Peer Networks : Zone-based P 2 P , 2005 .

[12]  David R. Karger,et al.  Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems , 2004, IPTPS.

[13]  David R. Karger,et al.  Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks , 2004, IPTPS.

[14]  Feng Zhou.  Understanding Chord Performance and Topology-aware OVerlay Construction for Chord , 2003 .

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

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

[17]  Wolfgang Kellerer,et al.  Content-based hierarchies in DHT-based peer-to-peer systems , 2006, International Symposium on Applications and the Internet Workshops (SAINTW'06).

[18]  Wolfgang Kellerer,et al.  The Impact of Content Distribution on Structured P2P Networks in Mobile Scenarios , 2005, EUNICE.

[19]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2004, IEEE/ACM Trans. Netw..

[20]  Wolfgang Kellerer,et al.  Structured peer-to-peer systems for telecommunications and mobile environments , 2006 .

[21]  David R. Karger,et al.  Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems , 2006, Theory of Computing Systems.

[22]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[23]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[24]  Wolfgang Kellerer,et al.  The Complex Facets of Reputation and Trust , 2006 .

[25]  Maximilian Michel,et al.  Towards a Mobile Peer-to-Peer Service Platform , 2007, 2007 International Symposium on Applications and the Internet Workshops.

[26]  Content Availability and Signaling Overhead in DHT Systems for Mobile Environments , 2006 .

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

[28]  Wolfgang Kellerer,et al.  Cost-Based Analysis of Hierarchical DHT Design , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

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

[30]  Rüdiger Schollmeier,et al.  Performance Evaluation of the Mobile Peer-to-Peer Protocol , 2003 .

[31]  Peter Van Roy,et al.  S-Chord: Using Symmetry to Improve Lookup Efficiency in Chord , 2003, PDPTA.

[32]  Wolfgang Kellerer,et al.  Context spaces architectural framework , 2004, 2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops..