Super-seeding

In file sharing, super-seeding is an algorithm developed by John Hoffman for the BitTorrent communications protocol that helps downloaders become uploaders more quickly, but it introduces the danger of total seeding failure if there is only one downloader.

The algorithm applies when there is only one seed in the swarm. By permitting each downloader to download only specific parts of the files listed in a torrent, it allows peers to start seeding more quickly.[1] Peers attached to a seed with super-seeding enabled therefore distribute pieces of the torrent file much more readily before they have completed the download themselves.[2][3]

In 2003, BitTornado became the first BitTorrent client to implement the algorithm.

Effects

Testing by one group found that super seeding can help save an upload ratio of around 20%. It works best when the upload speed of the seed is greater than that of individual peers.[4]

Super seeding transfers stall when there is only one downloading client. The seeders will not send more data until a second client receives the data. To avoid this, rTorrent continues to offer more pieces to the peers without waiting for confirmation, until it is uploading at its configured capacity.[5]

Supporting clients

References
  1. BitTorrent.org Archived 2010-06-12 at the Wayback Machine. Bittorrent.org (2008-02-25). Retrieved on 2011-12-03.
  2. "A Lesson in Seeding and Super-Seeding". Archived from the original on 2016-11-04. Retrieved 2016-11-02.
  3. "Super Seeding - VuzeWiki". Archived from the original on 2016-09-22. Retrieved 2016-11-02.
  4. Chen, Zhijia; Chen, Yang; Lin, Chuang; Nivargi, V.; Cao, P. (2008-05-30), "Experimental Analysis of Super-Seeding in BitTorrent", ICC '08. IEEE International Conference on Communications, 2008. ICC '08., Beijing, China: IEEE, p. 65, doi:10.1109/ICC.2008.20, S2CID 17965266
  5. RTorrentInitialSeeding – The libTorrent and rTorrent Project. Libtorrent.rakshasa.no. Retrieved on 2011-12-03.
  6. "BinaryNotions.com » Halite BitTorrent Client". Archived from the original on 2008-01-19.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.