Please use this identifier to cite or link to this item:
https://doi.org/10.1145/1851276.1851289
DC Field | Value | |
---|---|---|
dc.title | Improving peer-to-peer file distribution: Winner doesn't have to take all | |
dc.contributor.author | Leong, B. | |
dc.contributor.author | Wang, Y. | |
dc.contributor.author | Wen, S. | |
dc.contributor.author | Carbunaru, C. | |
dc.contributor.author | Teo, Y.M. | |
dc.contributor.author | Chang, C. | |
dc.contributor.author | Ho, T. | |
dc.date.accessioned | 2013-07-04T08:32:30Z | |
dc.date.available | 2013-07-04T08:32:30Z | |
dc.date.issued | 2010 | |
dc.identifier.citation | Leong, B.,Wang, Y.,Wen, S.,Carbunaru, C.,Teo, Y.M.,Chang, C.,Ho, T. (2010). Improving peer-to-peer file distribution: Winner doesn't have to take all. Proceedings of the 1st ACM Asia-Pacific Workshop on Systems, APSys '10, Co-located with SIGCOMM 2010 : 55-59. ScholarBank@NUS Repository. <a href="https://doi.org/10.1145/1851276.1851289" target="_blank">https://doi.org/10.1145/1851276.1851289</a> | |
dc.identifier.isbn | 9781450301954 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/41651 | |
dc.description.abstract | Recent work on BitTorrent has shown that the choke/unchoke mechanism implements an auction where each peer tries to induce other peers into "unchoking" it by uploading more data than competing peers. Under such a scenario, fast peers tend to trade with one another and neglect slower peers. In this work, we revisit the peer-to-peer (p2p) file distribution problem and show that this does not have to be the case. We describe a p2p file distribution algorithm, the Tit-For-Tat Transport Protocol (TFTTP), that is able to achieve faster download performance than BitTorrent by employing a new mechanism called a promise. Our experiments show that the average throughput for TFTTP is some 30% to 70% higher than that for BitTorrent under controlled and realistic network conditions. We also show that TFTTP exhibits fairer sharing behavior and avoids the situation where "winner takes all". © 2010 ACM. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/1851276.1851289 | |
dc.source | Scopus | |
dc.subject | bittorrent | |
dc.subject | file distribution | |
dc.subject | peer-to-peer | |
dc.subject | promise | |
dc.subject | tit-for-tat | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.doi | 10.1145/1851276.1851289 | |
dc.description.sourcetitle | Proceedings of the 1st ACM Asia-Pacific Workshop on Systems, APSys '10, Co-located with SIGCOMM 2010 | |
dc.description.page | 55-59 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.