Locality and resource aware peer‐to‐peer overlay networks

Abstract Unstructured peer‐to‐peer (P2P) overlay architectures are attracting more and more attention. In order to solve the topology mismatch problem, many approaches take locality information into account when designing peer‐to‐peer overlay networks. In this paper, we not only exploit locality but also take resource types into consideration. Taking advantage of data replication, selective search, clustering, and interest groups, we can improve the search performance of unstructured P2P networks. Simulation results show that our algorithm is better than the mOverlay network in the number of messages per search while it maintains almost the same hit ratio and comes with competitive locality properties.

[1]  Xiaohui Huang,et al.  Resource discovery in locality-aware group-based semantic overlay of peer-to-peer networks , 2006, InfoScale '06.

[2]  Qian Zhang,et al.  A construction of locality-aware overlay network: mOverlay and its performance , 2004, IEEE Journal on Selected Areas in Communications.

[3]  Donal O'Mahony,et al.  Overlay Networks: A Scalable Alternative for P2P , 2003, IEEE Internet Comput..

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

[5]  Bobby Bhattacharjee,et al.  Scalable application layer multicast , 2002, SIGCOMM '02.

[6]  Qian Zhang,et al.  Measurement-based construction of locality-aware overlay networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[7]  Monica Brockmeyer,et al.  TACON: tactical construction of overlay networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[8]  Zheng Zhang,et al.  Building topology-aware overlays using global soft-state , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[9]  Li Xiao,et al.  Improving unstructured peer-to-peer systems by adaptive connection establishment , 2005, IEEE Transactions on Computers.

[10]  Mohamed Hefeeda,et al.  Modeling and Caching of Peer-to-Peer Traffic , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

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

[12]  Krishna P. Gummadi,et al.  Canon in G major: designing DHTs with hierarchical structure , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[13]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[15]  Y. Charlie Hu,et al.  Transparent query caching in peer-to-peer overlay networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[16]  Zhiyong Xu,et al.  HIERAS: a DHT based hierarchical P2P routing algorithm , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..

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

[18]  Thomas Fuhrmann,et al.  Bootstrapping locality-aware P2P networks , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[19]  Azer Bestavros,et al.  Osmosis: scalable delivery of real-time streaming media in ad-hoc overlay networks , 2003, 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings..

[20]  Calton Pu,et al.  Constructing a proximity-aware power law overlay network , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[21]  An Interested-based Architecture for Peer-to-Peer Network Systems , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

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

[23]  Scott Shenker,et al.  Can Heterogeneity Make Gnutella Scalable? , 2002, IPTPS.

[24]  Lixia Zhang,et al.  Host multicast: a framework for delivering multicast to end users , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[25]  Li Xiao,et al.  A distributed approach to solving overlay mismatching problem , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[26]  James Zijun Wang,et al.  A novel self-configuration mechanism for heterogeneous P2P networks , 2004, Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004)..

[27]  Hyunsoo Yoon,et al.  Grapes: topology-based hierarchical virtual network for peer-to-peer lookup services , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[28]  Edith Cohen,et al.  Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.

[29]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[30]  Hiroaki Kobayashi,et al.  A self-organizing overlay network to exploit the locality of interests for effective resource discovery in P2P systems , 2005, The 2005 Symposium on Applications and the Internet.

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

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

[33]  Hao Liao,et al.  The Peering Problem in Tree-Based Master/Worker Overlays , 2006, GPC.

[34]  Mingchu Li,et al.  On the connectedness of peer-to-peer overlay networks , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).