Enforcing Fair Sharing of Peer-to-Peer Resources

  • Tsuen-Wan “Johnny’‘ Ngan
  • Dan S. Wallach
  • Peter Druschel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2735)


Cooperative peer-to-peer applications are designed to share the resources of each computer in an overlay network for the common good of everyone. However, users do not necessarily have an incentive to donate resources to the system if they can get the system’s resources for free. This paper presents architectures for fair sharing of storage resources that are robust against collusions among nodes. We show how requiring nodes to publish auditable records of their usage can give nodes economic incentives to report their usage truthfully, and we present simulation results that show the communication overhead of auditing is small and scales well to large networks.


Smart Card Overlay Network Malicious Node Local List Byzantine Fault 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adar, E., Huberman, B.: Free riding on Gnutella. First Monday 5(10) (October 2000)Google Scholar
  2. 2.
    Anderson, R.: The Eternity service. In: Proc. 1st Int’l Conf. on the Theory and Applications of Cryptology, Prague, Czech Republic, October 1996, pp. 242–252 (1996)Google Scholar
  3. 3.
    Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Security for structured peer-to-peer overlay networks. In: Proc. OSDI 2002, Boston, MA (December 2002)Google Scholar
  4. 4.
    Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proc. OSDI 1999, New Orleans, LA (February 1999)Google Scholar
  5. 5.
    Cooper, B.F., Garcia-Molina, H.: Bidding for storage space in a peer-to-peer data preservation system. In: Proc. 22nd Int’l Conf. on Distributed Computing Systems, Vienna, Austria (July 2002)Google Scholar
  6. 6.
    Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proc. SOSP 2001, Chateau Lake Louise, Banff, Canada (October 2001)Google Scholar
  7. 7.
    Druschel, P., Rowstron, A.: PAST: A large-scale, persistent peer-to-peer storage utility. In: Proc. 8th Workshop on Hot Topics in Operating Systems, Schoss Elmau, Germany (May 2001)Google Scholar
  8. 8.
    Fehr, E., Gachter, S.: Altruistic punishment in humans. Nature (415), 137–140 (January 2002)CrossRefGoogle Scholar
  9. 9.
    Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: Proc. 6th Int’l Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Atlanta, GA, September 2002, pp. 1–13 (2002)Google Scholar
  10. 10.
    Maymounkov, P., Mazières, D.: Kademlia: A peer-to-peer information system based on the XORmetric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 53. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. SIGCOMM 2001, San Diego, CA, pp. 161–172 (August 2001)Google Scholar
  12. 12.
    Reiter, M.K., Rubin, A.D.: Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security 1(1), 66–92 (1998)CrossRefGoogle Scholar
  13. 13.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object address and routing for large-scale peer-to-peer systems. In: Proc. IFIP/ACM Int’l Conf. on Distributed Systems Platforms, Heidelberg, Germany, November 2001, pp. 329–350 (2001)Google Scholar
  14. 14.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. SIGCOMM 2001, San Diego, CA (August 2001)Google Scholar
  15. 15.
    Waldman, M., Mazières, D.: Tangler: A censorship-resistant publishing system based on document entanglements. In: Proc. 8th ACM Conf. on Computer and Communications Security (November 2001)Google Scholar
  16. 16.
    Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-resilient wide-area address and routing. Technical Report UCB//CSD-01- 1141, U. C. Berkeley (April 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Tsuen-Wan “Johnny’‘ Ngan
    • 1
  • Dan S. Wallach
    • 1
  • Peter Druschel
    • 1
  1. 1.Department of Computer ScienceRice University 

Personalised recommendations