Optimization theory with applications
Optimization theory with applications
Pseudo-serving: a user-responsible paradigm for Internet access
Selected papers from the sixth international conference on World Wide Web
A prototype implementation of archival Intermemory
Proceedings of the fourth ACM conference on Digital libraries
Mitigating server-side congestion in the Internet through pseudoserving
IEEE/ACM Transactions on Networking (TON)
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Incentives for sharing in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Games of Life: Explorations in Ecology, Evolution and Behaviour
Games of Life: Explorations in Ecology, Evolution and Behaviour
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
The Evolving Field of Distributed Storage
IEEE Internet Computing
Maintenance-Free Global Data Storage
IEEE Internet Computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Secure Distributed Computing in a Commercial Environment
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
OceanStore: An Extremely Wide-Area Storage System
OceanStore: An Extremely Wide-Area Storage System
One ring to rule them all: service discovery and binding in structured peer-to-peer overlay networks
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
On neighbor-selection strategy in hybrid peer-to-peer networks
Future Generation Computer Systems - Systems performance analysis and evaluation
Applying Mathematica and webMathematica to graph coloring
Future Generation Computer Systems
A collaborative virtual geographic environment based on P2P and Grid technologies
Information Sciences: an International Journal
QoS content management for P2P file-sharing applications
Future Generation Computer Systems
Design of Application-Specific Incentives in P2P Networks
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
Towards a Cluster Based Incentive Mechanism for P2P Networks
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
International Journal of Networking and Virtual Organisations
Multi-objective peer-to-peer neighbor-selection strategy using genetic algorithm
HiPC'07 Proceedings of the 14th international conference on High performance computing
Resisting free-riding behavior in BitTorrent
Future Generation Computer Systems
Pricing digital content distribution over heterogeneous channels
Decision Support Systems
Peer enterprises: design and implementation of a cross-organisational peer-to-peer framework
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
A crucial aspect of Peer-to-Peer (P2P) systems is that of providing incentives for users to contribute their resources to the system. Without such incentives, empirical data show that a majority of the participants act as free riders. As a result, a substantial amount of resource goes untapped, and, frequently, P2P systems devolve into client-server systems with attendant issues of performance under high load. We propose to address the free rider problem by introducing the notion of a P2P contract. In it, peers are made aware of the benefits they receive from the system as a function of their contributions. In this paper, we first describe a utility-based framework to determine the components of the contract and formulate the associated resource allocation problem. We consider the resource allocation problem for a flash crowd scenario and show how the contract mechanism implemented using a centralized server can be used to quickly create pseudoservers that can serve out the requests. We then study a decentralized implementation of the P2P contract scheme in which each node implements the contract based on local demand. We show that in such a system, other than contributing storage and bandwidth to serve out requests, it is also important that peer nodes function as application-level routers to connect pools of available pseudoservers. We study the performance of the distributed implementation with respect to the various parameters including the terms of the contract and the triggers to create pseudoservers and routers.