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

The Seeder Promotion Problem: Measurements, Analysis and Solution Space

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

The Seeder Promotion Problem: Measurements, Analysis and Solution Space. / Kaune, Sebastian; Tyson, Gareth; Pussep, Konstantin et al.
Proceedings of 19th International Conference on Computer Communications and Networks (ICCCN), 2010 . IEEE, 2009. p. 1-8.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Kaune, S, Tyson, G, Pussep, K, Mauthe, A & Steinmetz, R 2009, The Seeder Promotion Problem: Measurements, Analysis and Solution Space. in Proceedings of 19th International Conference on Computer Communications and Networks (ICCCN), 2010 . IEEE, pp. 1-8, 19th International Conference on Computer Communications and Networks (ICCCN), Zurich, Switzerland, 2/08/10. https://doi.org/10.1109/ICCCN.2010.5560089

APA

Kaune, S., Tyson, G., Pussep, K., Mauthe, A., & Steinmetz, R. (2009). The Seeder Promotion Problem: Measurements, Analysis and Solution Space. In Proceedings of 19th International Conference on Computer Communications and Networks (ICCCN), 2010 (pp. 1-8). IEEE. https://doi.org/10.1109/ICCCN.2010.5560089

Vancouver

Kaune S, Tyson G, Pussep K, Mauthe A, Steinmetz R. The Seeder Promotion Problem: Measurements, Analysis and Solution Space. In Proceedings of 19th International Conference on Computer Communications and Networks (ICCCN), 2010 . IEEE. 2009. p. 1-8 doi: 10.1109/ICCCN.2010.5560089

Author

Kaune, Sebastian ; Tyson, Gareth ; Pussep, Konstantin et al. / The Seeder Promotion Problem: Measurements, Analysis and Solution Space. Proceedings of 19th International Conference on Computer Communications and Networks (ICCCN), 2010 . IEEE, 2009. pp. 1-8

Bibtex

@inproceedings{98850e2768dd4bfa880fcfcd63046807,
title = "The Seeder Promotion Problem: Measurements, Analysis and Solution Space",
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.",
author = "Sebastian Kaune and Gareth Tyson and Konstantin Pussep and Andreas Mauthe and Ralf Steinmetz",
year = "2009",
doi = "10.1109/ICCCN.2010.5560089",
language = "English",
isbn = "978-1-4244-7114-0",
pages = "1--8",
booktitle = "Proceedings of 19th International Conference on Computer Communications and Networks (ICCCN), 2010",
publisher = "IEEE",
note = "19th International Conference on Computer Communications and Networks (ICCCN) ; Conference date: 02-08-2010 Through 05-08-2010",

}

RIS

TY - GEN

T1 - The Seeder Promotion Problem: Measurements, Analysis and Solution Space

AU - Kaune, Sebastian

AU - Tyson, Gareth

AU - Pussep, Konstantin

AU - Mauthe, Andreas

AU - Steinmetz, Ralf

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

U2 - 10.1109/ICCCN.2010.5560089

DO - 10.1109/ICCCN.2010.5560089

M3 - Conference contribution/Paper

SN - 978-1-4244-7114-0

SP - 1

EP - 8

BT - Proceedings of 19th International Conference on Computer Communications and Networks (ICCCN), 2010

PB - IEEE

T2 - 19th International Conference on Computer Communications and Networks (ICCCN)

Y2 - 2 August 2010 through 5 August 2010

ER -