Article

Monetary incentive with reputation for virtual market-place based P2P

Authors:

Krit Wongrujira,

Aruna SeneviratneAuthors Info & Claims

CoNEXT '05: Proceedings of the 2005 ACM conference on Emerging network experiment and technology

Pages 135 - 145

https://doi.org/10.1145/1095921.1095940

Published: 24 October 2005 Publication History

Abstract

One of the underlying assumptions on the design of peer-to-peer (P2P) network is that each peer trusts each other for forwarding transit messages. However, with the growth of P2P application, especially in business model, some peers may behave as selfish, irrational nodes due to conflict of interest or for conservation bandwidth. In our model, the P2P network is considered as a virtual market-place where peers can find, provide, and use services. Since peers are owned and operated by different entities, they do not necessarily share the same goals, but rather, to serve their own interests. In this paper, incentive mechanism to motivate peers to forward messages is proposed. We have implemented the monetary as an incentive mechanism, in which peers can setup their cost to charge for transiting a message. However, with only monetary incentive, peers may misbehave. Therefore, the decentralized reputation has been implemented with monetary mechanism. This will allow an application with dramatically improved utility, co-operate among peers and hence enable whole new domains of use.

References

[1]

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek and H. Balakrishnan,"Chord: A scalable peer-to-peer lookup service for Internet applications", In Proc. ACM SIGCOMM'01, 2001.]]

Digital Library

[2]

A. Rowstron, and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems", IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001.]]

Digital Library

[3]

B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, "Tapestry: An Infrastructure for fault-resilient widearea address and routing", Technical Report, UCB/CSD-01-1141, U. C. Berkeley, April, 2001.]]

Digital Library

[4]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network", In Proc. of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2001.]]

Digital Library

[5]

Kazaa. http://www.kazaa.com]]

[6]

Sheng Zhong, Jiang Chen, and Yang Richard Yang, "Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks", Technical Report Yale/DCS/TR1235, Department of Computer Science, Yale University, July 2002. A revised version in Proceedings of IEEE INFOCOM 2003, San Francisco, CA, April 2003.]]

[7]

E. Adar and B. Huberman, "Free riding on Gnutella", First Monday, 5(10), October 2000.]]

[8]

Karger D., Lehman E., Leighton F., Levine M., Lewin D., and Panigrahy R., "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web", In Proceedings of the 29$^th$ Annual ACM Symposium of Theory of Computing (El Paso, TX, May 1997), pp. 654--663.]]

Digital Library

[9]

M. Portmann, S. Ardon, A. Seneviratne, "Mitigating Routing Misbehaviour of Rational Nodes in CHORD", In Proceedings of the IEEE/IPSJ Symposium on Applications and the Internet (SAINT 2004), Tokyo, Japan, 2004.]]

Digital Library

[10]

S. Ardon, T. Rakotoarivelo, P. Senac, and A. Seneviratne, "OPENDIR: An Open Distributed Service Directory", Technical Report to Centie-II Project, CSIRO and University of New South Wales, Aug 2004.]]

[11]

Tim Hing-ting Hu, K. Wongrujira, and A. Seneviratne, "Reputation in Peer-to-Peer Networks", In Proc ICC 2004, Paris, France, June 2004.]]

[12]

Napster http://www.napster.com]]

[13]

A. Josang, S. Hird, and E. Faccer."Simulating the Effect of Reputation Systems on e-Markets", In Proc. of the 1st International Conference on Trust Management, Crete, May 2003.]]

Digital Library

[14]

C. Dellarocas. "Efficiency and Robustness of Binary Feedback Mechanisms in Trading Enviornments with Moral Hazard", MIT Sloan Working Paper No. 4297-03, January 2003.]]

[15]

K. Wongrujira, Tim Hing-ting, and A. Seneviratne, "Avoidance routing to misbebaving nodes in P2P by using reputation and variance", The 6th IEEE International Conference on Advanced Communication Technology, Volume 2, Page(s):1035 -- 1039, Korea 2004.]]

[16]

www.mmapps.org]]

[17]

H. R. Varian. "Economic mechanism design for computerized agents", In Proceedings of the First Usenix Workshop on Electronic Commerce, 1995.]]

Digital Library

[18]

F. Cornelli, E. Damiani, S.D.C. di Vimercati, S. Paraboshci, and P. Samarati. "Choosing reputable servents in a P2P network", In Proc. of eleventh international conference on World Wide Web, 2002.]]

Digital Library

[19]

K. Aberer and Z. Depotovic. "Managing trust in a peer-to-peer information system", In Proc. of the tenth international conference on Information and knowledge management, 2002.]]

Digital Library

[20]

K. Aberer. "P-grid: A self-organizing access structure of P2P information system", In Proc. of COOPIS, 2001.]]

Digital Library

[21]

Kamvar, S., Schlosser, M., "The EigenTrust Algorithm for Reputation Management in P2P Networks", WWW, Budapest, Hungary 2003.]]

Digital Library

[22]

Mojo J. McCoy, "Mojo Nation Responds", http://www.openp2p.com/pub/a/p2p/2001/01/11/mojo.html]]

[23]

David Hausheer, Nicolas C. Liebau, Andreas Mauthe, Ralf Steinmetz, Burkhard Stiller, "Token-based Accounting and Distributed Pricing to Introduce Market Mechanisms in a Peer-to-Peer File Sharing Scenario", In Proc. 3rd IEEE International Conference on Peer-to-Peer Computing, Linkoping, Sweden, September 1-2, 2003.]]

Digital Library

[24]

C. Dellarocas. "Efficiency and Robustness of Binary Feedback Mechanisms in Trading Enviornments with Moral Hazard", MIT Sloan Working Paper No. 4297-03, January 2003.]]

[25]

A. Jøsang, S. Hird, E. Faccer, "Simulating the Effect of Reputation Systems one-Markets", In Proc. of the 1st International Conference on Trust Management, Crete, May 2003.]]

[26]

Xiaohui Gu, Klara Nahrstedt, Bin Yu, "SpiderNet: An Integrated Peer-to-Peer Service Composition Framework", in Proc. of IEEE International Symposium on High-Performance Distributed Computing (HPDC-13), Honolulu, Hawaii, June 4-6, 2004.]]

Digital Library

[27]

J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. "OceanStore: An architecture for global-scale persistent storage", In Proceedings of the 9th Interational Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Cambridge, MA, Nov. 2000. ACM.]]

Digital Library

[28]

K. Lai, M. Feldman, I. Stoica, and J. Chuang, "Incentives for cooperation in peer-to-peer networks", In Workshop on Economics of Peer-toPeer Systems, 2003.]]

[29]

Feigenbaum and S. Shenker. "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, pages 1-13, Atlanta, GA, Sept. 2002.]]

Digital Library

[30]

P. Golle, K.Leyton-Brown, and I.Mironov, "Incentives for Sharing in Peer-to-Peer Networks", ACM Conference on Electronic Commerce, 2002.]]

Digital Library

[31]

C. Buragohain, D. Agrawal, and S. Suri. "A game theoretic framework for incentives in P2P systems", In Proc. 3rd Intl. Conf. on Peer-to-Peer Computing, 2003.]]

Digital Library

Cited By

Haddi FRahmani MBenchaba M(2018)A Credits-Based Economy for P2P Systems2018 International Conference on Applied Smart Systems (ICASS)10.1109/ICASS.2018.8652019(1-6)Online publication date: Nov-2018
https://doi.org/10.1109/ICASS.2018.8652019
Hendrikx FBubendorfer KChard R(2015)Reputation systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2014.08.00475:C(184-197)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1016/j.jpdc.2014.08.004
Dutta ASchulzrinne H(2014)ReferencesMobility Protocols and Handover Optimization10.1002/9781119945505.refs(409-424)Online publication date: 28-Mar-2014
https://doi.org/10.1002/9781119945505.refs
Show More Cited By

Index Terms

Monetary incentive with reputation for virtual market-place based P2P
1. Hardware
  1. Communication hardware, interfaces and storage
2. Networks

Recommendations

The Eigentrust algorithm for reputation management in P2P networks
WWW '03: Proceedings of the 12th international conference on World Wide Web

Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, as recent experience shows, the anonymous, open nature of these networks offers an almost ideal environment for the ...
Push-pull incentive-based P2P live media streaming system

Peer-to-peer (P2P) file sharing has become increasingly popular, accounting for as much as 70% of Internet traffic by some estimates. Recently, we have been witnessing the emergence of a new class of popular P2P applications, namely, P2P audio and video ...
Reciprocity: Enforcing Contribution in P2P Perpendicular Downloading

Flash bulk files downloading in style of P2P through perpendicular pattern becomes more popular recently. Many peers download different pieces of shared files from the source in parallel. They try to reconstruct complete files by exchanging needed ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CoNEXT '05: Proceedings of the 2005 ACM conference on Emerging network experiment and technology

October 2005

318 pages

ISBN:159593197X

DOI:10.1145/1095921

General Chairs:
Michel Diaz
LAAS-CNRS, France
,
Arturo Azcorra
University Carlos III de Madrid, Spain
,
Program Chairs:
Philippe Owezarski
LAAS-CNRS, France
,
Serge Fdida
Universitè P&M Curie (Paris 6), France

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

ACM: Association for Computing Machinery

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
735
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Haddi FRahmani MBenchaba M(2018)A Credits-Based Economy for P2P Systems2018 International Conference on Applied Smart Systems (ICASS)10.1109/ICASS.2018.8652019(1-6)Online publication date: Nov-2018
https://doi.org/10.1109/ICASS.2018.8652019
Hendrikx FBubendorfer KChard R(2015)Reputation systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2014.08.00475:C(184-197)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1016/j.jpdc.2014.08.004
Dutta ASchulzrinne H(2014)ReferencesMobility Protocols and Handover Optimization10.1002/9781119945505.refs(409-424)Online publication date: 28-Mar-2014
https://doi.org/10.1002/9781119945505.refs
Kwok Y(2012)BibliographyPeer-to-Peer Computing10.1201/b11091-10(175-195)Online publication date: 21-Feb-2012
https://doi.org/10.1201/b11091-10
Bany Mohammed AAltmann J(2010)A funding and governing model for achieving sustainable growth of computing e-infrastructuresannals of telecommunications - annales des télécommunications10.1007/s12243-010-0188-965:11-12(739-756)Online publication date: 4-Jul-2010
https://doi.org/10.1007/s12243-010-0188-9
Kwok Y(2009)Autonomic Peer-to-Peer Systems: Incentive and Security IssuesAutonomic Computing and Networking10.1007/978-0-387-89828-5_9(205-236)Online publication date: 30-Apr-2009
https://doi.org/10.1007/978-0-387-89828-5_9
Ruffo GSchifanella R(2007)FairPeersJournal of Network and Systems Management10.1007/s10922-007-9066-915:3(355-382)Online publication date: 1-Sep-2007
https://dl.acm.org/doi/10.1007/s10922-007-9066-9
Loytynoja MKoskela TBrockman MSeppanen T(2006)Mobile DRM-Enabled Multimedia Platform for Peer-to-Peer ApplicationsProceedings of the Eighth IEEE International Symposium on Multimedia10.1109/ISM.2006.108(139-144)Online publication date: 11-Dec-2006
https://dl.acm.org/doi/10.1109/ISM.2006.108

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten