Skip to main content
Log in

SocialTrust: Enabling long-term social cooperation in peer-to-peer services

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

Abstract

Peer-to-peer(P2P) services heavily rely on users’ cooperation to achieve desired performance. However, most current P2P systems only encourage short-term and direct cooperation between peers. The lack of incentives for long term and indirect cooperation has severely limited the performance of P2P systems. On the other hand, recent measurements on large-scale networks show that peers’ behavior often demonstrates strong social patterns. In this paper, we design and implement a social P2P network, named SocialTrust, based on peers’ common interests. In SocialTrust, each peer tries to find a small number of friends and maintains long term social links with them. We also propose a distributed trust mechanism. The trust between two friends reflects their cooperation level and serves as the credit limit between them. A peer with higher trust can download data from its friends more efficiently. The trust can be propagated among friends to support indirect reciprocity. We formally prove that the proposed distributed trust mechanism is secure and can defend against various forms of attacks. By adding asmall number of long term social links to the existing P2P network, SocialTrust relaxes the constraint of direct incentive mechanisms and encourages peers to perform various forms of long-term cooperation. Both trace-driven simulation and real Internet experiments show that SocialTrust can significantly improve file availability and download performance of current P2P file sharing systems.

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.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Iamnitchi A, Ripeanu M, Foster I (2004) Small-world file-sharing communities. In: Proc IEEE INFOCOM, vol 2, pp 952–963

  2. Handurukande SB, Kermarrec A-M, Fessant FL, Massouli L, Patarin S (2006) Peer sharing behaviour in the edonkey network, and implications for the design of server-less file sharing systems. ACM SIGOPS Oper Syst Rev 40(4):359–371

    Article  Google Scholar 

  3. Choffnes DR, Duch J, Malmgren D, Guimera R, Bustamante FE, Amaral L (2010) Strange bedfellows: communities in bittorrent. In: Proc. IPTPS’10

  4. Cohen B (2003) Incentives build robustness in bittorrent. [Online]. Available: http://www.ittc.ku.edu/niehaus/classes/750-s06/documents/BT-description.pdf. Accessed 1 June 2011

  5. Sherman A, Nieh J, Stein C (2009) Fairtorrent: bringing fairness to peer-to-peer systems. In: Proc CONEXT’09, pp 133–144

  6. Keidar I, Melamed R, Orda A (2009) Equicast: scalable multicast with selfish users. Comput Netw 53:2373–2386

    Article  MATH  Google Scholar 

  7. Levin D, LaCurts K, Spring N, Bhattacharjee B (2008) Bittorrent is an auction: analyzing and improving bittorrent’s incentives. In: Proc SIGCOMM’08, pp 243–254

  8. Li HC, Clement A, Wong EL, Napper J, Roy I, Alvisi L, Dahlin M (2006) Bar gossip. In: Proc. 7th USENIX OSDI. USENIX Association, Berkeley, CA, USA, pp 14–14

    Google Scholar 

  9. Fan B, Lui JCS, Chiu D-M (2009) The design trade-offs of bittorrent-like file sharing protocols. IEEE/ACM Trans Netw 17(2):365–376

    Article  Google Scholar 

  10. Li HC, Clement A, Marchetti M, Kapritsos M, Robison L, Alvisi L, Dahlin M (2008) Flightpath: obedience vs choice in cooperative services. In: Proc OSDI’08, pp 355–368

  11. Menasche DS, Rocha AA, Li B, Towsley D, Venkataramani A (2009) Content availability and bundling in swarming systems. In: Proc. CONEXT’09. ACM, New York, NY, USA, pp 121–132

    Google Scholar 

  12. Sirivianos M, Park JH, Yang X, Jarecki S (2007) Dandelion: cooperative content distribution with robust incentives. In: Proc. USENIX ATC’07, pp 12:1–12:14

  13. Vishnumurthy V, Chandrakumar S, Sirer EG (2003) KARMA: a secure economic framework for P2P resource sharing. In: Proceedings of the 3rd workshop on economics of peer-to-peer systems, P2PEcon’03

  14. Liu Z, Hu H, Liu Y, Ross KW, Wang Y, Mobius M (2010) P2p trading in social networks: the value of staying connected. In: Proc. IEEE INFOCOM. IEEE Press, Piscataway, NJ, USA, pp 2489–2497

    Google Scholar 

  15. Landa R, Griffin D, Clegg RG, Mykoniati E, Rio M (2009) A sybilproof indirect reciprocity mechanism for peer-to-peer networks. In: Proc. IEEE INFOCOM, pp 343–351

  16. Piatek M, Isdal T, Krishnamurthy A, Anderson T (2008) One hop reputations for peer to peer file sharing workloads. In: Proc. USENIX NSDI, ser. NSDI’08. USENIX Association, Berkeley, CA, USA, pp 1–14

    Google Scholar 

  17. Douceur JR (2002) The sybil attack. In: Revised papers from the first international workshop on peer-to-peer systems, pp 251–260

  18. Resnick P, Sami R (2009) Sybilproof transitive trust protocols. In: Proc EC’09, pp 345–354

  19. Cheng A, Friedman E (2005) Sybilproof reputation mechanisms. In: Proc. ACM SIGCOMM workshop on economics of peer-to-peer systems, pp 128–132

  20. Kamvar SD, Schlosser MT, Garcia-Molina H (2003) The eigentrust algorithm for reputation management in p2p networks. In: WWW. ACM, New York, NY, USA, pp 640–651

    Google Scholar 

  21. Damiani E, di Vimercati DC, Paraboschi S, Samarati P, Violante F (2002) A reputation-based approach for choosing reliable resources in peer-to-peer networks. In: Proceedings of the 9th ACM conference on Computer and communications security, ser CCS ’02, pp 207–216

  22. Srivatsa M, Xiong L, Liu L (2005) Trustguard countering vulnerabilities in reputation management for decentralized overlay networks. In: WWW. ACM, New York, NY, USA, pp 422–431

    Google Scholar 

  23. Cornelli F, Damiani E, di Vimercati SDC, Paraboschi S, Samarati P (2002) Choosing reputable servents in a p2p network. In: WWW. ACM, New York, NY, USA, pp 376–386

    Google Scholar 

  24. Post A, Shah V, Mislove A (2011) Bazaar: strengthening user reputations in online marketplaces. In: Proc. NSDI’11, Boston, MA

  25. Pouwelse J, Garbacki P, Wang J, Bakker A, Yang J, Iosup A, Epema D, Reinders M, van Steen M, Sips H (2008) Tribler: a social- based peer-to-peer system. Concurr Comput Pract Exp 20:127–138

    Article  Google Scholar 

  26. Garbacki P, Iosup A, Epema D, Steen M (2006) 2Fast: collaborative downloads in P2P networks. In: Proc. IEEE Peer-to-peer Computing, pp 23–30

  27. Wang J, Yeo C, Prabhakaran V, Ramchandran K (2007) On the role of helpers in peer-to-peer file download systems: design, analysis and simulation. In: Proc. IEEE IPTPS’07

  28. He Y, Guan L (2009) Improving the streaming capacity in p2p vod systems with helpers. In: Proc ICME, pp 790–793

  29. Ashwin Bharambe CH, Padmanabhan V (2006) Analyzing and improving a bittorrent network’s performance mechanisms. In: Proc. IEEE INFOCOM, pp 1–12

  30. Bittorrent ver 5.3: http://bittorrent.com/. Accessed 1 June 2011

  31. Gummadi KP, Dunn RJ, Saroiu S, Gribble SD, Levy HM, Zahorjan J (2003) Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. SIGOPS Oper Syst Rev 37:314–329

    Article  Google Scholar 

  32. Aidouni F, Latapy M, Magnien C (2009) Ten weeks in the life of an edonkey server. In: Proc. IPDPS, pp 1–5

  33. Planetlab testbed: http://www.planet-lab.org. Accessed 1 June 2011

  34. Clearbits website: http://www.clearbits.net. Accessed 1 June 2011

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yusuo Hu.

Additional information

This work was done in Microsoft Research Asia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hu, Y., Wang, D., Zhong, H. et al. SocialTrust: Enabling long-term social cooperation in peer-to-peer services. Peer-to-Peer Netw. Appl. 7, 525–538 (2014). https://doi.org/10.1007/s12083-013-0198-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-013-0198-2

Keywords

Navigation