Abstract
Research on P2P data structures has tacitly assumed that peers readily participate in the work, i.e., are cooperative. But such participation is voluntary, and free riding is the dominant strategy. This article describes a protocol that renders free riding unattractive, for one particular P2P data structure. The protocol is based on feedback that adjacent nodes exchange. This induces transitive logical networks of nodes that rule out uncooperative peers. The protocol uses proofs of work to deter free riding. To show that cooperative behavior dominates, we have come up with a cost model that quantifies the overall cost of peers, depending on their degree of cooperativeness and many other parameters. The cost model tells us that we can achieve a good discrimination against peers that are less cooperative, with moderate additional cost for cooperative peers. Extensive experiments confirm the validity of our approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aberer, K., P-Grid: A self-organizing access structure for P2P information systems. In: CooplS '01: Proceedings of the 9th International Conference on Cooperative Information Systems, pp. 179–194. Springer-Verlag, London, UK (2001)
Aberer, K., Despotovic, Z.: Managing trust in a peer-2-peer information system. In: Proceedings of the Conference on Information and Knowledge Management (2001)
Adar, E., Huberman, B.: Free riding on gnutella. First Monday 5(10) (2000)
Back, A.: Hashcash – A denial of service counter-measure. http://www.cypherspace.org/~adam/hashcash/ (2002)
Buchegger, S., Boudec, J.Y.L.: Coping with false accusations in misbehavior reputation systems for mobile ad-hoc networks. Technical Report IC/2003/31, EPFL (2003)
Buchmann, E., Böhm, K.: FairNet – how to counter free riding in peer-to-peer data structures. In: Proceedings of the International Conference on Cooperative Information Systems 2004, Agia Napa, Cyprus (2004)
Buchmann, E., Böhm, K.: How to run experiments with large peer-to-peer data structures. In: Proceedings of the 18th Int. Parallel and Distributed Processing Symposium, Santa Fe, USA (2004)
Buragohain, C., Agrawal, D., Suri, S.: A game-theoretic framework for incentives in P2P systems. In: Proceedings of P2P2003, Linkoping, Sweden (2003)
Chang, B.E., et al.: Trustless grid computing in ConCert. proceedings of Grid02, Berlin (2002)
Datta, A., Hauswirth, M., Aberer, K.: Beyond “Web of Trust”: enabling P2P E-commerce. Proceedings of the IEEE Conference on E-Commerce, USA (2003)
Feldman, M., Lai, K., Stoica, I., Chuang, J.: Robust incentive techniques for peer-to-peer networks. ACM Electronic Commerce, 2004. (2004)
Friedman, E., Resnick, P.: The social cost of cheap pseudonyms. Journal of Economics and Management Strategy 10(2) (1998)
Garcia-Molina, H., Schlosser, M.T., Kamvar, S.D.: The eigenTrust algorithm for reputation management in P2P networks. In: Proceedings of the Twelfth International World Wide Web Conference (2003)
Golle, P., et al.: Incentives for sharing in Peer-to-Peer Networks. Lecture Notes in Computer Science 2232 (2001)
Gribble, S.D., et al.: The Ninja architecture for robust Internet-scale systems and services. Computer Networks, Amsterdam, Netherlands 35(4) (1999)
Gummadi, K., et al.: The impact of DHT routing geometry on resilience and proximity. In: Proceedings of the SIGCOMM 2003. ACM Press (2003)
Jakobsson, M., Juels, A.: Proofs of work and bread pudding protocols. In: Proceedings of the CMS'99, Leuven, Belgium (1999)
Kroell, B., Widmayer, P.: Distributing a search tree among a growing number of processors. Technical Report 1994PA-drt, Swiss Federal Institute of Technology, Zürich (1994)
Litwin, W., Neimat, M.A., Schneider, D.A.: LH* – linear hashing for distributed files. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, D.C. ACM Press (1993)
Marsh, S.: Formalising trust as a computational concept. Ph.D. Thesis., Department of Mathematics and Computer Science, University of Stirling (1994)
Marti, S., et al.: Mitigating routing misbehavior in mobile ad hoc networks. In: Proceedings of the Conference on Mobile Computing and Networking. ACM Press (2000)
Padovan, B., et al.: A prototype for an agent based secure electronic marketplace including reputation tracking mechanisms. In: Proceedings of the Hawaii International Conference on System Sciences (2001)
Ramaswamy, L., Liu, L.: Free riding: A new challenge to peer-to-peer file sharing systems. In: Proceedings of the 36th HICSS Conference, Hawaii (2003)
Ratnasamy, S., et al.: A scalable content-sddressable network. In: Proceedings of the ACM SIGCOMM Conference. ACM Press, New York (2001)
Reidemeister, T., et al.: Malicious behaviour in content-addressable Peer-to-Peer Networks. Proceedings of the Third Conference on Communication Networks and Services Research, Canada (2005)
Resnick, P., et al.: Reputation systems. Commun. ACM 43(12) (2000)
Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (2001)
Stoica, I., et al.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM Conference (2001)
Xiong, L., Liu, L.: Peertrust: supporting reputation-based trust for peer-to-peer electronic communities. IEEE Trans. Knowl. Data Eng. 16(7) (2004)
Yang, B., Garcia-Molina, H.: PPay: Micropayments for peer-to-peer systems. In: V. Atluri, P. Liu (eds.) Proceedings of the 10th ACM Conference on Computer and Communication Security (CCS-03). ACM Press, New York (2003)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Böhm, K., Buchmann, E. Free riding-aware forwarding in Content-Addressable Networks. The VLDB Journal 16, 463–482 (2007). https://doi.org/10.1007/s00778-005-0175-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00778-005-0175-3