Please use this identifier to cite or link to this item:
https://doi.org/10.1145/1851276.1851289
Title: | Improving peer-to-peer file distribution: Winner doesn't have to take all | Authors: | Leong, B. Wang, Y. Wen, S. Carbunaru, C. Teo, Y.M. Chang, C. Ho, T. |
Keywords: | bittorrent file distribution peer-to-peer promise tit-for-tat |
Issue Date: | 2010 | 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. https://doi.org/10.1145/1851276.1851289 | 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. | Source Title: | Proceedings of the 1st ACM Asia-Pacific Workshop on Systems, APSys '10, Co-located with SIGCOMM 2010 | URI: | http://scholarbank.nus.edu.sg/handle/10635/41651 | ISBN: | 9781450301954 | DOI: | 10.1145/1851276.1851289 |
Appears in Collections: | Staff Publications |
Show full 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.