A hierarchical overlay with cluster-based reputation tree for dynamic peer-to-peer systems

Traditional peer-to-peer technologies and systems assume that people operate with desktop computers in fixed broadband networks. When people with modern mobile devices now access Internet and Web services much in the manner they used to on desktop computers, the classical peer-to-peer overlay models can be vulnerable in wireless and mobile networks. This paper proposes a hierarchical overlay architecture based on partially central and semi-structured overlay models for the deployment of peer-to-peer systems in dynamic network environments. To keep up system scalability and efficacy, this architecture design exploits peer locality and network proximity, and contends with several problems of peer churn, peer mobility, search redundancy and traffic overhead that become much stickier in dynamic network environments. This design also integrates the reputation notion to mitigate the free-riding problem in peer-to-peer systems. According to a special cluster-based reputation tree, the hierarchical overlay is adjustable to moderate unfair or imbalanced resource utilization over the system. Furthermore, the cluster hierarchy is resilient to any points of failure at peer clusters in the overlay topology. Therefore, the effort of this study achieves an efficient and robust overlay architecture in dynamic network environments. Simulation results show that the proposed architecture is not only scalable to peer population, but also sustainable to peer- and network-initiated dynamics and influences in peer-to-peer systems.

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

[2]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[3]  Ben Y. Zhao,et al.  Understanding user behavior in large-scale video-on-demand systems , 2006, EuroSys.

[4]  Hector Garcia-Molina,et al.  Taxonomy of trust: Categorizing P2P reputation systems , 2006, Comput. Networks.

[5]  Yuh-Jzer Joung,et al.  On the self-organization of a hybrid peer-to-peer system , 2010, J. Netw. Comput. Appl..

[6]  Jim Dowling,et al.  Properties and mechanisms of self-organizing MANET and P2P systems , 2007, TAAS.

[7]  Agustinus Borgy Waluyo,et al.  A pure P2P paradigm for query processing in mobile ad-hoc networks , 2011, MoMM '11.

[8]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[9]  Paul Resnick,et al.  Reputation systems , 2000, CACM.

[10]  Hamid Sarbazi-Azad,et al.  Analysis of Time-Based Random Waypoint Mobility Model for Wireless Mobile Networks , 2007, Fourth International Conference on Information Technology (ITNG'07).

[11]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[12]  Eng Keong Lua,et al.  P2p Networking And Applications , 2009 .

[13]  Mark Lillibridge,et al.  Incentives for Sharing in Peer-to-Peer Networks , 2001, WELCOM.

[14]  Chi-Yin Chow,et al.  GroCoca: group-based peer-to-peer cooperative caching in mobile environment , 2007, IEEE Journal on Selected Areas in Communications.

[15]  Ben Y. Zhao,et al.  Towards Location-aware Topology in both Unstructured and Structured P2P Systems , 2007, 2007 International Conference on Parallel Processing (ICPP 2007).

[16]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[17]  Leandros Tassiulas,et al.  Reputation-Based Resource Allocation in P2P Systems of Rational Users , 2010, IEEE Transactions on Parallel and Distributed Systems.

[18]  David Watson,et al.  Topology aware overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[19]  Shueng-Han Gary Chan,et al.  Reputation estimation and query in peer-to-peer networks , 2010, IEEE Communications Magazine.

[20]  Sheng-De Wang,et al.  Locality and resource aware peer‐to‐peer overlay networks , 2008 .

[21]  Ricardo Baeza-Yates,et al.  Information Retrieval: Data Structures and Algorithms , 1992 .

[22]  Sathya Narayanan,et al.  UP2P: a peer-to-peer overlay architecture for ubiquitous communications and networking , 2008, IEEE Communications Magazine.

[23]  Geoff Coulson,et al.  Free Riding on Gnutella Revisited: The Bell Tolls? , 2005, IEEE Distributed Syst. Online.

[24]  Bo Li,et al.  Distributed distance measurement for large-scale networks , 2003, Comput. Networks.

[25]  Hao Liao,et al.  Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[26]  Chunyan Miao,et al.  A Survey of Trust and Reputation Management Systems in Wireless Communications , 2010, Proceedings of the IEEE.

[27]  Michal Feldman,et al.  Overcoming free-riding behavior in peer-to-peer systems , 2005, SECO.

[28]  Yang Guo,et al.  A survey on peer-to-peer video streaming systems , 2008, Peer-to-Peer Netw. Appl..

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

[30]  Feng Wang,et al.  mTreebone: A Hybrid Tree/Mesh Overlay for Application-Layer Live Video Multicast , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[31]  Kevin Leyton-Brown,et al.  Incentives for sharing in peer-to-peer networks , 2001, EC '01.

[32]  CoulsonGeoff,et al.  Free Riding on Gnutella Revisited , 2005 .

[33]  Li Xiao,et al.  Location awareness in unstructured peer-to-peer systems , 2005, IEEE Transactions on Parallel and Distributed Systems.

[34]  Evangelos P. Markatos,et al.  ITA: Innocuous Topology Awareness for Unstructured P2P Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

[35]  Guillaume Urvoy-Keller,et al.  Rarest first and choke algorithms are enough , 2006, IMC '06.

[36]  Daniel Stutzbach,et al.  Understanding churn in peer-to-peer networks , 2006, IMC '06.

[37]  Sujata Banerjee,et al.  Estimating network proximity and latency , 2006, CCRV.

[38]  Anand Sivasubramaniam,et al.  Performance Evaluation of Neighborhood Signature Techniques for Peer-to-Peer Search , 2007 .

[39]  Matteo Sereno,et al.  A measurement study supporting P2P file-sharing community models , 2009, Comput. Networks.

[40]  Hamidah Ibrahim,et al.  Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks , 2012, Peer Peer Netw. Appl..

[41]  Chih-Lin Hu,et al.  Fair Peer Assignment Scheme for Peer-to-Peer File Sharing , 2010, KSII Trans. Internet Inf. Syst..

[42]  Pascal Felber,et al.  Efficient search in unstructured peer-to-peer networks , 2004, Eur. Trans. Telecommun..

[43]  Chi-Yin Chow,et al.  On Efficient and Scalable Support of Continuous Queries in Mobile Peer-to-Peer Environments , 2011, IEEE Transactions on Mobile Computing.

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

[45]  Yunhao Liu,et al.  AnySee: Peer-to-Peer Live Streaming , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[46]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[47]  Eng Keong Lua,et al.  Network-aware SuperPeers-Peers Geometric Overlay Network , 2007, 2007 16th International Conference on Computer Communications and Networks.

[48]  Ulrich Killat,et al.  Bandwidth trading in BitTorrent-like P2P networks for content distribution , 2008, Comput. Commun..

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

[50]  Yi Qiao,et al.  Designing less-structured P2P systems for the expected high churn , 2008, TNET.

[51]  Chung-Ming Huang,et al.  Network-aware P2P file sharing over the wireless mobile networks , 2007, IEEE Journal on Selected Areas in Communications.

[52]  Garcia-MolinaHector,et al.  Taxonomy of trust , 2006 .