Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/13905
DC FieldValueLanguage
dc.contributor.authorPsounis, Konstantinos-
dc.contributor.authorPapadopoulos, Fragkiskos-
dc.contributor.authorLiao, Wei Cherng-
dc.date.accessioned2019-05-31T08:52:55Z-
dc.date.available2019-05-31T08:52:55Z-
dc.date.issued2006-01-01-
dc.identifier.citationNETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, pp. 592-605en_US
dc.identifier.isbn9783540341925-
dc.identifier.issn2-s2.0-33745920166-
dc.identifier.issnhttps://api.elsevier.com/content/abstract/scopus_id/33745920166-
dc.identifier.issn2-s2.0-33745920166-
dc.description5th International IFIP-TC6 Networking Conference, Coimbra, Portugal, May 15-19, 2006. Proceedings Part of the Lecture Notes in Computer Science book series (LNCS, volume 3976)en_US
dc.description.abstractThe performance of peer-to-peer systems depends on the level of cooperation of the system's participants. While most existing peer-to-peer architectures have assumed that users are generally cooperative, there is great evidence from widely deployed systems suggesting the opposite. To date, many schemes have been proposed to alleviate this problem. However, the majority of these schemes are either too complex to use in practice, or do not provide strong enough incentives for cooperation. In this work we propose a scheme based on the general idea that offering uploads brings revenue to a node, and performing downloads has a cost. We also introduce a theoretical model that predicts the performance of the system and computes the values of the scheme's parameters that achieve a desired performance. Our scheme is quite simple and very easy to implement. At the same time, it provides very strong incentives for cooperation and improves the performance of P2P networks significantly. In particular, theory and realistic simulations show that it reduces the query response times and file download delays by one order of magnitude, and doubles the system's throughput. © IFIP International Federation for Information Processing 2006.en_US
dc.formatpdfen_US
dc.language.isoenen_US
dc.subjectP2P networksen_US
dc.subjectRealistic simulationsen_US
dc.subjectTheoretical analysisen_US
dc.subjectUser cooperationen_US
dc.titleAn efficient algorithm for resource sharing in peer-to-peer networksen_US
dc.typeConference Papersen_US
dc.collaborationUniversity of Southern Californiaen_US
dc.subject.categoryElectrical Engineering - Electronic Engineering - Information Engineeringen_US
dc.countryUnited Statesen_US
dc.subject.fieldEngineering and Technologyen_US
dc.publicationPeer Revieweden_US
dc.relation.conferenceNETWORKING: International Conference on Research in Networkingen_US
dc.identifier.doi10.1007/11753810_50en_US
dc.identifier.scopus2-s2.0-33745920166en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/33745920166en
dc.contributor.orcid#NODATA#en
dc.contributor.orcid#NODATA#en
dc.contributor.orcid#NODATA#en
dc.relation.volume3976 LNCSen
cut.common.academicyear2005-2006en_US
item.openairecristypehttp://purl.org/coar/resource_type/c_c94f-
item.openairetypeconferenceObject-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.languageiso639-1en-
item.fulltextNo Fulltext-
crisitem.author.deptDepartment of Electrical Engineering, Computer Engineering and Informatics-
crisitem.author.facultyFaculty of Engineering and Technology-
crisitem.author.orcid0000-0002-4072-5781-
crisitem.author.parentorgFaculty of Engineering and Technology-
Appears in Collections:Δημοσιεύσεις σε συνέδρια /Conference papers or poster or presentation
CORE Recommender
Show simple item record

SCOPUSTM   
Citations 50

4
checked on Mar 14, 2024

Page view(s) 50

316
Last Week
2
Last month
1
checked on Nov 23, 2024

Google ScholarTM

Check

Altmetric


Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.