Trust-based decentralized service discovery in structured Peer-to-Peer networks

In a Peer-to-Peer(P2P) network, efficient cooperation among peers (nodes) is an important issue since a peer may not believe another peer for various service discovery applications. Chord protocol faces stale routing entries (finger table entries) due to the presence of malicious peers in the network. We propose a trust-based routing algorithm for efficient service discovery for Chord network. The proposed algorithm improves the data accessibility in the presence of malicious peers by computing a trust value for each peer. The trust value is calculated using a Bayesian network based trust model. In this algorithm, the finger table entries including the trust attribute are retrieved using an improved querying algorithm while identifying a trusted peer. The trust is computed based on entities such as age, number of uploads and downloads of a peer. The proposed approach is flexible(one or many entities can be chosen to compute trust) and can be customized based on application requirements. Performance evaluation has been performed by considering performance metrics, such as, responses of queries, number of uploads and downloads and trust value of a peer in the P2P network.

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

[2]  Qi Liu,et al.  Modeling and analysis of free riding in peer-to-peer streaming systems , 2011, 2011 6th International ICST Conference on Communications and Networking in China (CHINACOM).

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

[4]  Divyakant Agrawal,et al.  A peer-to-peer framework for Web service discovery with ranking , 2004 .

[5]  Ling Liu,et al.  TrustMe: anonymous management of trust relationships in decentralized P2P systems , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[6]  Dana Porrat,et al.  INFORMATION THEORY OF WIDEBAND COMMUNICATIONS , 2007, IEEE Communications Surveys & Tutorials.

[7]  Robert Tappan Morris,et al.  Security Considerations for Peer-to-Peer Distributed Hash Tables , 2002, IPTPS.

[8]  Rishabh Kaushal,et al.  Free-rider detection and punishment in BitTorrent based P2P networks , 2014, 2014 IEEE International Advance Computing Conference (IACC).

[9]  Valentin Cristea,et al.  Decentralized Trust Management in Peer-to-Peer Systems , 2011, 2011 10th International Symposium on Parallel and Distributed Computing.

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

[11]  Rupali Bhardwaj,et al.  An Overview on Tools for Peer to Peer Network Simulation , 2010 .

[12]  David Heckerman,et al.  Causal independence for probability assessment and inference using Bayesian networks , 1996, IEEE Trans. Syst. Man Cybern. Part A.

[13]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[14]  Raouf Boutaba,et al.  Resource and service discovery in large-scale multi-domain networks , 2007, IEEE Communications Surveys & Tutorials.

[15]  Hai Jin,et al.  Chord4S: A P2P-based Decentralised Service Discovery Approach , 2008, 2008 IEEE International Conference on Services Computing.

[16]  Miguel Castro,et al.  Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.

[17]  Kai Hwang,et al.  GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks , 2008, IEEE Transactions on Knowledge and Data Engineering.

[18]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[19]  Akbar Ghaffarpour Rahbar,et al.  PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing , 2007, IEEE Transactions on Parallel and Distributed Systems.

[20]  David Heckerman,et al.  A Tutorial on Learning with Bayesian Networks , 1998, Learning in Graphical Models.

[21]  K. Kant,et al.  Reduction of look up latency in location-aware clusters of large-scale P2P overlay networks , 2008, TENCON 2008 - 2008 IEEE Region 10 Conference.

[22]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

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

[24]  Krishna Kant,et al.  A Centralized Server Based Cluster Integrated Protocol in Hybrid P2P Systems , 2008, 2008 First International Conference on Emerging Trends in Engineering and Technology.

[25]  Chunling Cheng,et al.  Advanced chord routing algorithm based on redundant information replaced and objective resource table , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

[26]  Ling Liu,et al.  A reputation-based trust model for peer-to-peer ecommerce communities , 2003, EC.

[27]  Julita Vassileva,et al.  Bayesian network-based trust model , 2003, Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003).