Fair Bandwidth and Storage Sharing in Peer-to-Peer Networks Abstract
Abstract:
While cooperative p2p applications are designed to share the resources of each computer in an overlay network, users do not necessarily have an incentive to donate resources to the system if they can get the system’s resources for free. We study mechanisms to enforce and encourage sharing for file sharing systems. In this paper, we present two such architectures, designed for systems with different limiting resources, and discuss some problems we faced and our future directions. 1
Citations
| 452 | Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility – Rowstron, Druschel - 2001 |
| 403 | Crowds: Anonymity for web transactions – Reiter, Rubin - 1997 |
| 319 | Free Riding on Gnutella – Adar, Huberman - 2000 |
| 310 | Incentives build robustness in BitTorrent – Cohen - 2003 |
| 120 | The social cost of cheap pseudonyms – Friedman, Resnick - 2001 |
| 66 | Enforcing Fair Sharing of Peer-to-Peer Resources – Ngan, Wallach, et al. - 2003 |
| 12 | Economic behavior of peer-to-peer storage networks – Fuqua, Ngan, et al. - 2003 |
| 11 | Pastry: Scalable, distributed object address and routing for large-scale peer-to-peer systems – Rowstron, Druschel - 2001 |
