Super-seeding

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

The algorithm applies to a scenario in which 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 equips peers to begin seeding sooner.[1]

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.[2]

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.[3] This improves the upload speed until enough peers have joined the swarm, at the cost of not being able to detect cheating peers, who engage in such anti-social actions as downloading only from seeds, downloading from the fastest peers, or advertising false pieces.[4]

Supporting clients

References

  1. BitTorrent.org. Bittorrent.org (2008-02-25). Retrieved on 2011-12-03.
  2. Chen, Zhijia; Yang Chen, Chuang Lin (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 Cite uses deprecated parameter |coauthors= (help);
  3. RTorrentInitialSeeding – The libTorrent and rTorrent Project. Libtorrent.rakshasa.no. Retrieved on 2011-12-03.
  4. https://torrentfreak.com/cheating-bittorrent/
  5. http://www.binarynotions.com/halite-bittorrent-client/

External links

This article is issued from Wikipedia - version of the Thursday, April 14, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.