A hierarchical approach to improve performance of unstructured peer-to-peer system

Unstructured overlays have the disadvantage that queries may take a long time to find required data or it does not guaranty to locate an existing data item. We present an organised network architecture for unstructured peer-to-peer systems where nodes are added to the network in a systematic way to efficiently utilise the node resources. This network architecture is characterised by O(log

[1]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM 2004.

[2]  Jussi Kangasharju,et al.  Explaining BubbleStorm: Resilient, Probabilistic, and Exhaustive PeertoPeer Search , 2007, SIGCOMM 2007.

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

[4]  Guillaume Urvoy-Keller,et al.  Hierarchical Peer-To-Peer Systems , 2003, Parallel Process. Lett..

[5]  Tore Risch,et al.  EDUTELLA: a P2P networking infrastructure based on RDF , 2002, WWW.

[6]  Diganta Goswami,et al.  Performance Enhancement in Hierarchical Peer-to-Peer Systems , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[7]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[8]  Indranil Gupta,et al.  Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead , 2003, IPTPS.

[9]  William Pugh,et al.  Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.

[10]  Adam Wierzbicki,et al.  Deconstructing the Kazaa network , 2003, Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003.

[11]  Miguel Castro,et al.  Should we build Gnutella on a structured overlay? , 2004, Comput. Commun. Rev..

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

[13]  Yuh-Jzer Joung,et al.  Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity , 2007, Comput. Networks.

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

[15]  Dong Xuan,et al.  RChord: an enhanced Chord system resilient to routing attacks , 2003, 2003 International Conference on Computer Networks and Mobile Computing, 2003. ICCNMC 2003..

[16]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

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

[18]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[19]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[20]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[21]  Benoit Hudzia,et al.  TreeP: A Tree Based P2P Network Architecture , 2005, 2005 IEEE International Conference on Cluster Computing.

[22]  Mudhakar Srivatsa,et al.  Scaling unstructured peer-to-peer networks with multi-tier capacity-aware overlay topologies , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

[23]  Dong-Sub Cho,et al.  Super-Peer Selection Based Framework Using Dynamic Capacity and Similarity , 2006, ISCIS.

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

[25]  Demetris Zeinalipour-Yazti,et al.  A Quantitative Analysis of the Gnutella Network Trac , 2002 .

[26]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1997, SPAA '97.

[27]  Karl Aberer,et al.  P-Grid: A Self-Organizing Access Structure for P2P Information Systems , 2001, CoopIS.

[28]  Rakesh Kumar,et al.  The FastTrack overlay: A measurement study , 2006, Comput. Networks.

[29]  Yu Jiong,et al.  DR-Chord-FAn Efficient Double-Ring Chord Protocol , 2007, Sixth International Conference on Grid and Cooperative Computing (GCC 2007).

[30]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[31]  Daniel Stutzbach,et al.  Capturing Accurate Snapshots of the Gnutella Network , 2006, INFOCOM.

[32]  Diganta Goswami,et al.  HUP: An Unstructured Hierarchical Peer-to-Peer Protocol , 2010 .

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

[34]  Thomas Mundt,et al.  JXTA: a technology facilitating mobile peer-to-peer networks , 2002, International Mobility and Wireless Access Workshop.

[35]  Paolo Santi,et al.  MeshChord: A Location-Aware, Cross-Layer Specialization of Chord for Wireless Mesh Networks (concise contribution) , 2008, 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom).

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

[37]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.

[38]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.