Conference Paper

Exchange-based incentive mechanisms for peer-to-peer file sharing

CIS Dept., Pennsylvania Univ., Philadelphia, PA, USA
DOI: 10.1109/ICDCS.2004.1281619 Conference: Distributed Computing Systems, 2004. Proceedings. 24th International Conference on
Source: IEEE Xplore

ABSTRACT Performance of peer-to-peer resource sharing networks depends upon the level of cooperation of the participants. To date, cash-based systems have seemed too complex, while lighter-weight credit mechanisms have not provided strong incentives for cooperation. We propose exchange-based mechanisms that provide incentives for cooperation in peer-to-peer file sharing networks. Peers give higher service priority to requests from peers that can provide a simultaneous and symmetric service in return. We generalize this approach to n-way exchanges among rings of peers and present a search algorithm for locating such rings. We have used simulation to analyze the effect of exchanges on performance. Our results show that exchange-based mechanisms can provide strong incentives for sharing, offering significant improvements in service times for sharing users compared to free-riders, without the problems and complexity of cash- or credit-based systems.

0 Bookmarks
 · 
71 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: The self-interest of peers degrades the system usability of P2P file sharing networks. Debt-based files exchange network constructs an incentive mechanism which induces cooperative and equivalent file exchange where creditor's rights between neighbors play as light weight cash in file download. Creditor's rights need only be maintained between neighbors, so maintenance cost is low and the mechanism is scalable for large networks. Number of files shared can be seen as a peer's strategy selection. The game among rational peers exists a Nash equilibrium and the approximate algorithm of strategy selection gradually converges. Simulations indicate the effectiveness of incentive mechanism and steady performance in dynamic networks.
    Communications and Networking in China, 2007. CHINACOM '07. Second International Conference on; 09/2007
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The pace of research on peer-to-peer (P2P) networking in the last five years warrants a critical survey. P2P has the makings of a disruptive technology—it can aggregate enormous storage and processing resources while minimizing entry and scaling costs. Failures are common amongst massive numbers of distributed peers, though the impact of individual failures may be less than in conventional architectures. Thus the key to realizing P2P’s potential in applications other than casual file sharing is robustness.P2P search methods are first couched within an overall P2P taxonomy. P2P indexes for simple key lookup are assessed, including those based on Plaxton trees, rings, tori, butterflies, de Bruijn graphs and skip graphs. Similarly, P2P indexes for keyword lookup, information retrieval and data management are explored. Finally, early efforts to optimize range, multi-attribute, join and aggregation queries over P2P indexes are reviewed. Insofar as they are available in the primary literature, robustness mechanisms and metrics are highlighted throughout. However, the low-level mechanisms that most affect robustness are not well isolated in the literature. Furthermore, there has been little consensus on robustness metrics. Recommendations are given for future research.
    Computer Networks 01/2006; · 1.23 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In mobile ad-hoc peer-to-peer (M-P2P) networks, economic models become a necessity for enticing non-cooperative mobile peers to provide service. M-P2P users may issue queries with varying constraints on query response time, data quality of results and trustworthiness of the data source. This work proposes ConQuer, which addresses constraint queries in economy- based M-P2P networks. ConQuer proposes a broker-based incentive M-P2P model for handling user-defined constraint queries. It also provides incentives for MPs to form collaborative peer groups for maximizing data availability and revenues by mutually allocating and deallocating data items using a royalty-based revenue-sharing method. Such reallocations facilitate MPs in providing better data quality, thereby allowing them to further increase their revenues.
    8th International Conference on Mobile Data Management (MDM 2007), Mannheim, Germany, May 7-11, 2007; 01/2007

Full-text (3 Sources)

View
30 Downloads
Available from
May 26, 2014

Michael B. Greenwald