Introducing CPU Time as a Scarce Resource in P2P Systems to Achieve Fair Use in a Distributed DNS

Peer-to-peer (P2P) systems are flexible, robust, and self-organizing resource sharing infrastructures which are typically designed in a fully decentralized manner. However, a key problem of such systems are peers overusing a resource. This paper presents a fully decentralized scheme to achieve fair use in P2P systems, which does not require a priori information about a peer. The approach developed is based on a scarce resource trading scheme (SRTCPU), which utilizes CPU time as a form of payment. SRTCPU provides an incentive to offer CPU time in return of consuming a scarce resource. A distributed DNS has been implemented as an example application that uses SRTCPU.

[1]  Ernesto Damiani,et al.  A reputation-based approach for choosing reliable resources in peer-to-peer networks , 2002, CCS '02.

[2]  Hector Garcia-Molina,et al.  Peer-to-Peer Resource Trading in a Reliable Distributed System , 2002, IPTPS.

[3]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[4]  Adam Back,et al.  Hashcash - A Denial of Service Counter-Measure , 2002 .

[5]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[6]  Hector Garcia-Molina,et al.  PPay: micropayments for peer-to-peer systems , 2003, CCS '03.

[7]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[8]  David Hausheer,et al.  PeerMint: Decentralized and Secure Accounting for Peer-to-Peer Applications , 2005, NETWORKING.

[9]  Robert Tappan Morris,et al.  Serving DNS Using a Peer-to-Peer Lookup Service , 2002, IPTPS.

[10]  David R. Karger,et al.  Looking up data in P2P systems , 2003, CACM.

[11]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[12]  Harry DeAngelo,et al.  Accounting choice in troubled companies , 1994 .

[13]  Burkhard Stiller,et al.  Rich and scalable peer-to-peer search with SHARK , 2003, 2003 Autonomic Computing Workshop.

[14]  Hector Garcia-Molina,et al.  Incentives for Combatting Freeriding on P2P Networks , 2003, Euro-Par.

[15]  B. Achiriloaie,et al.  VI REFERENCES , 1961 .

[16]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[17]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[18]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[19]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[20]  Andy Oram,et al.  Peer-to-Peer: Harnessing the Power of Disruptive Technologies , 2001 .

[21]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[22]  Ion Stoica,et al.  Robust incentive techniques for peer-to-peer networks , 2004, EC '04.

[23]  김기경.  Accountability , 2019, Encyclopedia of Food and Agricultural Ethics.

[24]  Karl Aberer,et al.  Managing trust in a peer-2-peer information system , 2001, CIKM '01.