Enforcing fair sharing of peer-to-peer resources

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2735, Issue , 2003, Pages 149-159

  Ngan, Tsuen Wan ^a   Wallach, Dan S ^a   Druschel, Peter ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; OVERLAY NETWORKS;

COMMUNICATION OVERHEADS; ECONOMIC INCENTIVE; FAIR SHARING; LARGE NETWORKS; PEER TO PEER; PEER-TO-PEER APPLICATION; STORAGE RESOURCES;

PEER TO PEER NETWORKS;

EID: 35248864021     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45172-3_14     Document Type: Article

References (16)

1. E. Adar and B. Huberman. Free riding on Gnutella. First Monday, 5(10), October 2000.
2. R. Anderson. The Eternity service. In Proc. 1st Int'l Conf. on the Theory and Applications of Cryptology, pages 242-252, Prague, Czech Republic, October 1996.
3. Miguel Castro, Peter Druschel, Ayalvadi Ganesh, Antony Rowstron, and Dan S. Wallach. Security for structured peer-to-peer overlay networks. In Proc. OSDI'02, Boston, MA, December 2002.
4. Miguel Castro and Barbara Liskov. Practical Byzantine fault tolerance. In Proc. OSDI'99, New Orleans, LA, February 1999.
5. Brian F. Cooper and Hector Garcia-Molina. 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.
6. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. SOSP'01, Chateau Lake Louise, Banff, Canada, October 2001.
7. Peter Druschel and Antony Rowstron. 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.
8. Ernst Fehr and Simon Gachter. Altruistic punishment in humans. Nature, (415):137-140, January 2002.
9. Joan Feigenbaum and Scott 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, September 2002.
10. P. Maymounkov and D. Mazières. Kademlia: A peer-to-peer information system based on the XOR metric. In Proc. IPTPS'02, Cambridge, MA, March 2002.
11. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. SIGCOMM'01, pages 161-172, San Diego, CA, August 2001.
12. M.K. Reiter and A.D. Rubin. Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security, 1(1):66-92, 1998.
13. Antony Rowstron and Peter Druschel. 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, pages 329-350, Heidelberg, Germany, November 2001.
14. 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. SIGCOMM'01, San Diego, CA, August 2001.
15. M. Waldman and D. Mazières. Tangler: A censorship-resistant publishing system based on document entanglements. In Proc. 8th ACM Conf. on Computer and Communications Security, November 2001.
16. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-resilient wide-area address and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley, April 2001.