Skip to main content
Log in

Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

To address the two most critical issues in P2P file-sharing systems: efficient information discovery and authentic data acquisition, we propose a Gnutella-like file-sharing protocol termed Adaptive Gnutella Protocol (AGP) that not only improves the querying efficiency in a P2P network but also enhances the quality of search results at the same time. The reputation scheme in the proposed AGP evaluates the credibility of peers based on their contributions to P2P services and subsequently clusters nodes together according to their reputation and shared content, essentially transforming the P2P overlay network into a topology with collaborative and reputed nodes as its core. By detecting malicious peers as well as free-riders and eventually pushing them to the edge of the overlay network, our AGP propagates search queries mainly within the core of the topology, accelerating the information discovery process. Furthermore, the clustering of nodes based on authentic and similar content in our AGP also improves the quality of search results. We have implemented the AGP with the PeerSim simulation engine and conducted thorough experiments on diverse network topologies and various mixtures of honest/dishonest nodes to demonstrate improvements in topology transformation, query efficiency, and search quality by our AGP.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Notes

  1. Another metric could be the node’s buffer space for outgoing messages, during an epoch.

  2. Ultra-peers are nodes with high bandwidth capacity and high number of direct connections.

References

  1. McClain L (2004) RIAA posting bad music files to deter illegal downloaders. The Dialy Texan

  2. BBC NEWS (2004) Viruses turn to peer-to-peer nets. BBC NEWS

  3. Gnutella (2007) Gnutella protocol specification. http://gnutella-specs.rakjar.de/index.php/Gnutella_Protocol_Specification

  4. KazaA (2007) KazaA official site. http://www.kazaa.com/us/index.htm, August

  5. Castro M, Druschel P, Ganesh AJ, Rowstron AIT, Wallach DS (2002) Secure routing for structured peer-to-peer overlay networks. In: OSDI, Boston, December 2002

  6. Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S (2003) Making Gnutella-like P2P systems scalable. In: Proceedings of the 2003 ACM conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM ’03). ACM, Karlsruhe, pp 407–418

    Chapter  Google Scholar 

  7. Condie T, Kamvar SD, Garcia-Molina H (2004) Adaptive peer-to-peer topologies. In: Proceedings of the 4th international conference on peer-to-peer computing (P2P’04). IEEE Computer Society, Washington, DC, pp 53–62

    Chapter  Google Scholar 

  8. Cornelli F, Damiani E, De Capitani di Vimercati S, Paraboschi S, Samarati P (2002) Choosing reputable servents in a P2P network. In: WWW ’02: proceedings of the 11th international conference on world wide web. ACM, New York, pp 376–386

    Google Scholar 

  9. Crespo A, Garcia-Molina H (2004) Semantic overlay networks for P2P systems. In: AP2PC, New York, July 2004, pp 1–13

  10. Dwork C, Naor M, Sahai A (2004) Concurrent zero-knowledge. J ACM 51(6):851–898

    Article  MATH  MathSciNet  Google Scholar 

  11. Exarchakos G, Antonopoulos N (2007) Resource sharing architecture for cooperative heterogeneous P2P overlays. J Netw Syst Manag 15(3):311–334

    Article  Google Scholar 

  12. Feige U, Shamir A (1990) Witness indistinguishable and witness hiding protocols. In: STOC, Baltimore, 13–17 May 1990, pp 416–426

  13. Gupta M, Judge P, Ammar M (2003) A reputation system for peer-to-peer networks. In: NOSSDAV ’03: proceedings of the 13th international workshop on Network and operating systems support for digital audio and video. ACM, New York, pp 144–152

    Chapter  Google Scholar 

  14. Hughes D, Coulson G, Walkerdine J (2005) Free riding on Gnutella revisited: the bell tolls? IEEE Distrib Syst Online 6(6):1–13

    Article  Google Scholar 

  15. Jelasity M, Montresor A, Paolo Jesi G, Voulgaris S (2005) PeerSim: a peer-to-peer simulator. http://peersim.sourceforge.net December

  16. Kamvar SD, Schlosser MT, Garcia-Molina H (2003) The Eigentrust algorithm for reputation management in P2P networks. In: WWW ’03: proceedings of the 12th international conference on world wide web. ACM, New York, pp 640–651

    Google Scholar 

  17. Li J, Loo BT, Hellerstein JM, Kaashoek MF, Karger DR, Morris R (2003) On the feasibility of peer-to-peer web indexing and search. In: 2nd international workshop on peer-to-peer systems (IPTPS ’03), Berkeley, 20–21 February 2003, pp 207–215

  18. Liu L, Antonopoulos N, Mackin S (2007) Social peer-to-peer for resource discovery. In: PDP. Washington, DC, pp 459–466

  19. Liu L, Mackin S, Antonopoulos N (2006) Small world architecture for peer-to-peer networks. In: Proceedings of the 2006 IEEE/WIC/ACM international conference on web intelligence and intelligent agent technology. IEEE Computer Society, Washington, DC, pp 451–454

    Chapter  Google Scholar 

  20. Marti S, Garcia-Molina H (2004) Limited reputation sharing in P2P systems. In: EC ’04: proceedings of the 5th ACM conference on electronic commerce. ACM, New York, pp 91–101

    Chapter  Google Scholar 

  21. Marti S, Garcia-Molina H (2006) Taxonomy of trust: categorizing P2P reputation systems. Comput Netw 50(4):472–484

    Article  MATH  Google Scholar 

  22. Mekouar L, Iraqi Y, Boutaba R (2006) Peer-to-peer’s most wanted: malicious peers. Comput Netw 50(4):545–562

    Article  MATH  Google Scholar 

  23. Ramaswamy L, Liu L (2003) Free riding: a new challenge to peer-to-peer file sharing systems. In: Proceedings of the 36th annual Hawaii international conference on system sciences, 2003, 6–9 January 2003, p 10

  24. Rivest R (1992) RFC 1321 - MD5 message digest algorithm. http://tools.ietf.org/html/rfc1321

  25. Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126

    Article  MATH  MathSciNet  Google Scholar 

  26. Saroiu S, Gummadi PK Gribble SD (2002) A measurement study of peer-to-peer file sharing systems. In: MMCN ’02: proceedings of multimedia computing and networking, San Jose, January 2002

  27. Singh A, Liu L (2003) TrustMe: anonymous management of trust relationships in decentralized P2P systems. In: P2P ’03: proceedings of the 3rd international conference on peer-to-peer computing. IEEE Computer Society, Washington, DC, p 142

    Google Scholar 

  28. Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM conference. San Diego, California, pp 149–160

  29. Stutzbach D, Rejaie R, Sen S (2005) Characterizing unstructured overlay topologies in modern P2P file-sharing systems. In: Proceedings of the ACM SIGCOMM internet measurement conference. Berkeley, California

  30. Tsoumakos D, Roussopoulos N (2003) A comparison of peer-to-peer search methods. In: WebDB, San Diego, 12–13 June 2003

  31. Xiong L, Liu L (2003) A reputation-based trust model for peer-to-peer ecommerce communities. In: ACM conference on electronic commerce. San Diego, California, pp 228–229

  32. Zhu Y, Yang X, Hu Y (2005) Making search efficient on Gnutella-Like P2P systems. In: IPDPS ’05: proceedings of the 19th IEEE international parallel and distributed processing symposium (IPDPS’05) – papers. IEEE Computer Society, Washington, DC, p 56.1

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vassil Kriakov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pogkas, I., Kriakov, V., Chen, Z. et al. Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation. Peer-to-Peer Netw. Appl. 2, 37–59 (2009). https://doi.org/10.1007/s12083-008-0018-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-008-0018-2

Keywords

Navigation