12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > The Seeder Promotion Problem: Measurements, Ana...
View graph of relations

« Back

The Seeder Promotion Problem: Measurements, Analysis and Solution Space

Research output: Contribution in Book/Report/ProceedingsPaper

Published

  • Sebastian Kaune
  • Gareth Tyson
  • Konstantin Pussep
  • Andreas Mauthe
  • Ralf Steinmetz
Publication date2009
Host publicationProceedings of 19th International Conference on Computer Communications and Networks (ICCCN), 2010
PublisherIEEE
Pages1-8
Number of pages8
ISBN (Print)978-1-4244-7114-0
Original languageEnglish

Conference

Conference19th International Conference on Computer Communications and Networks (ICCCN)
CityZurich, Switzerland
Period2/08/105/08/10

Conference

Conference19th International Conference on Computer Communications and Networks (ICCCN)
CityZurich, Switzerland
Period2/08/105/08/10

Abstract

BitTorrent has become the de-facto standard for peer-to-peer content delivery, however, it has been found that it suffers from one fundamental problem: the long-term availability of content. Previous work has attributed this to what is termed the seeder promotion problem in which peers refuse to continue serving content after their own download has completed. As of yet, no deployed solution exists to this problem. In this paper, we objectively investigate the solution space for dealing with the seeder promotion problem. Specifically, both single-torrent and cross-torrent approaches are investigated to ascertain which is superior based on three key metrics: availability, performance, and fairness. To achieve this, two large-scale BitTorrent measurement studies have been performed which include 46K torrents and 29M users. Through these, we first quantify the seriousness of the seeder promotion problem before exploiting the data logs to execute accurate trace-based simulations for the different solutions considered. Using the results, we ascertain and describe the different trade-offs between the four general solutions: extending seeding times, cross-torrent bartering, local persistent histories, and global shared histories. We find that single-torrent solutions are profoundly impractical when considering the user behaviour observed in our studies. In contrast, we discover that the different cross-torrent approaches can offer a far more effective solution for satisfying (to varying degrees) the need for high availability, good performance, and fairness between users.