In this paper we address the issue of content availability in p2p file sharing systems. Content availability is a public good: the copying of a file by one peer does not prevent another peer also from copying it; but contributing files to the common pool is costly. The asymptotic analysis of certain public good models for p2p file sharing suggests that when the aim is to maximize social welfare, a fixed contribution scheme in terms of the number of files shared per unity of time can be asymptotically optimal as the number of participants n grows to infinity. However, the enforcement of such an incentive scheme is not straightforward in a realistic p2p system, where no trusted software or central entity accounting for peers' transactions can be assumed and peers are free to change their identity with no cost. We present a realistic version of the fixed contribution scheme, which does not require the use of system memory but relies only on the time peers are consuming resources to ensure that they contribute adequately. We describe the functionality that should be supported for enforcement and discuss the additional incentive issues that arise in this context, proposing some practical solutions to address them. We also formulate a suitable economic model to estimate the efficiency-loss of the proposed mechanism (compared to the one achieved using the theoretically optimal schemes under complete and incomplete information) and provide some insights for the correct tuning of its basic parameters. Our first results indicate that the proposed mechanism constitutes a good compromise between economic efficiency and implementability and should lead to some interesting and practical solutions for providing incentives for content availability in p2p systems.
End of preview. The entire article is 10 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/incentives-for-content-availability-in-memory-less-peer-to-peer-file-6OLRytBAIg
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Incentives for content availability in memory-less peer-to-peer file sharing systems
Antoniadis, Panayotis; Courcoubetis, Costas; Strulo, Ben
Follow ACM SIGecom Exchanges
, Volume 5 (4)
Association for Computing Machinery – Jul 1, 2005
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
