Abstract
Cooperative peer-to-peer (p2p) applications are designed to share the resources of participating computers for the common good of all users. However, users do not necessarily have an incentive to donate resources to the system if they can use the system’s services for free. In this paper, we describe Scrivener, a fully decentralized system that ensures fair sharing of bandwidth in cooperative content distribution networks. We show how participating nodes, tracking only first-hand observed behavior of their peers, can detect when their peers are behaving selfishly and refuse to provide them service. Simulation results show that our mechanisms effectively limit the quality of service received by a user to a level that is proportional to the amount of resources contributed by that user, while incurring modest overhead.
This research was supported in part by Texas ATP (003604-0079-2001), by NSF (ANI- 0225660, http://project-iris.net) and by gifts from Microsoft Research and from Intel Research.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Aberer, K., Despotovic, Z.: Managing trust in a peer-2-peer information system. In: Proc. of the 10th Int’l Conf. of Information and Knowledge Management, Atlanta, GA (2001)
Adar, E., Huberman, B.: Free riding on Gnutella. First Monday 5(10) (October 2000)
Anagnostakis, K.G., Greenwald, M.B.: Exchange-based incentive mechanisms for peer-to-peer file sharing. In: Proc. 24nd Int’l Conf. on Distributed Computing Systems, Washington, DC (March 2004)
Blanc, A., Liu, Y.-K., Vahdat, A.: Designing Incentives for Peer-to-Peer Routing. In: Proc. 24th IEEE Infocom, Miami, FL (March 2005)
Buchegger, S., Le Boudec, J.-Y.: Performance analysis of the CONFIDANT protocol. In: Proc. MobiHoc 2002, Lausanne, Switzerland (June 2002)
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)
Cohen, B.: Incentives build robustness in BitTorrent. In: Workshop on Econ. of Peer-to-Peer Systems, Berkeley, CA (June 2003)
Cox, L.P., Noble, B.D.: Samsara: Honor among thieves in peer-to-peer storage. In: Proc. SOSP 2003, Bolton Landing, NY (October 2003)
Dabek, F., Zhao, B., Druschel, P., Kubiatowicz, J., Stoica, I.: Towards a common API for structured peer-to-peer overlays. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Dingledine, R., Freedman, M.J., Molnar, D.: Accountability. In: Oram, A. (ed.) Peer-to-Peer: Harnessing the Power of Disruptive Technologies. O’Reilly & Associates, Sebastopol (2001)
Douceur, J.R.: The Sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 251. Springer, Heidelberg (2002)
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)
FreePastry. Open source implementation of Pastry, http://freepastry.rice.edu/
Friedman, E., Resnick, P.: The social cost of cheap pseudonym. Journal of Economics and Management Strategy 10(2), 173–199 (2001)
Fu, K., Kaashoek, M.F., Mazières, D.: Fast and secure distributed read-only file system. ACM Transactions on Computer Systems 20(1) (February 2002)
Fu, Y., Chase, J.S., Chun, B.N., Schwab, S., Vahdat, A.: SHARP: An architecture for secure resource peering. In: Proc. SOSP 2003, Bolton Landing, NY (October 2003)
Gnutella, http://www.gnutella.com/
Golle, P., Leyton-Brown, K., Mironov, I., Lillibridge, M.: Incentives for sharing in peer-to-peer networks. In: Proc. 3rd ACM Conf. on Electronic Commerce, Tampa, FL (October 2001)
Grothoff, C.: An excess-based economic model for resource allocation in peer-to-peer networks. In: Wirtschaftsinformatik (June 2003)
Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proc. SOSP 2003, Bolton Landing, NY (October 2003)
Hardin, G.: The tragedy of the commons. Science 162, 1243–1248 (1968)
Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The EigenTrust algorithm for reputation management in p2p networks. In: Proc. WWW 2003, Budapest, Hungary (May 2003)
KaZaA, http://www.kazaa.com/
Mahajan, R., Rodrig, M., Wetherall, D., Zahorjan, J.: Sustaining Cooperation in Multi-hop Wireless Networks. In: Proc. NSDI 2005 (May 2005)
Marti, S., Giuli, T., Lai, K., Baker, M.: Mitigating routing misbehavior in mobile ad hoc networks. In: Proc. MobiCom 2000, Boston, MA (August 2000)
MojoNation see also Mnet, http://en.wikipedia.org/wiki/MojoNation/ , http://en.wikipedia.org/wiki/MojoNation/
Ngan, T.-W.J., Wallach, D.S., Druschel, P.: Enforcing fair sharing of peer-to-peer resources. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Ngan, T.-W.J., Wallach, D.S., Druschel, P.: Incentives-compatible peer-to-peer multicast. In: 2nd Workshop on the Economics of Peer-to-Peer Systems, Cambridge, MA (June 2004)
Ntarmos, N., Triantafillou, P.: SeAl: Managing accesses and data in peer-to-peer sharing networks. In: Proc. of the 4th IEEE Int’l Conf. on P2P Computing, Zurich, Switzerland (2004)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object address and routing for large-scale peer-to-peer systems. In: Proc. Middleware, Heidelberg, Germany (November 2001)
Rowstron, A., Druschel, P.: Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Proc. SOSP 2001 (October 2001)
Salem, N.B., Buttyan, L., Hubaux, J.-P., Jakobsson, M.: Node cooperation in hybrid ad hoc networks. IEEE Transactions on Mobile Computing (2005) (to appear)
Shneidman, J., Parkes, D.: Rationality and self-interest in peer to peer networks. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
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)
Sun, Q., Garcia-Molina, H.: SLIC: A selfish link-based incentive mechanism for unstructured peer-to-peer networks. In: Proc. 24nd Int’l Conf. on Distributed Computing Systems, Washington, DC (March 2004)
Vishnumurthy, V., Chandrakumar, S., Sirer, E.G.: KARMA: A secure economic framework for p2p resource sharing. In: Workshop on Econ. of Peer-to-Peer Systems, Berkeley, CA (June 2003)
Waldman, M., Mazières, D.: Tangler: A censorship-resistant publishing system based on document entanglements. In: Proc. ACM CCS, Philadelphia, PA (November 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Nandi, A., Ngan, TW.“., Singh, A., Druschel, P., Wallach, D.S. (2005). Scrivener: Providing Incentives in Cooperative Content Distribution Systems. In: Alonso, G. (eds) Middleware 2005. Middleware 2005. Lecture Notes in Computer Science, vol 3790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11587552_14
Download citation
DOI: https://doi.org/10.1007/11587552_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30323-7
Online ISBN: 978-3-540-32269-6
eBook Packages: Computer ScienceComputer Science (R0)