A queueing system for modeling a file sharing principle

SimatosFlorian,; RobertPhilippe,; GuilleminFabrice,

doi:10.1145/1384529.1375478

Cited by 5 publications

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Estimating self-sustainability in peer-to-peer swarming systems

Menasché

Rocha

Silva

et al. 2010

Performance Evaluation

View full text Add to dashboard Cite

Peer-to-peer swarming is one of the de facto solutions for distributed content dissemination in today's Internet. By leveraging resources provided by clients, swarming systems reduce the load on and costs to publishers. However, there is a limit to how much cost savings can be gained from swarming; for example, for unpopular content peers will always depend on the publisher in order to complete their downloads. In this paper, we investigate this dependence. For this purpose, we propose a new metric, namely swarm self-sustainability. A swarm is referred to as self-sustaining if all its blocks are collectively held by peers; the self-sustainability of a swarm is the fraction of time in which the swarm is self-sustaining. We pose the following question: how does the self-sustainability of a swarm vary as a function of content popularity, the service capacity of the users, and the size of the file? We present a model to answer the posed question.We then propose efficient solution methods to compute self-sustainability. The accuracy of our estimates is validated against simulation. Finally, we also provide closed-form expressions for the fraction of time that a given number of blocks is collectively held by peers.

show abstract

Estimating self-sustainability in peer-to-peer swarming systems

Menasché

Rocha

Silva

et al. 2010

Performance Evaluation

View full text Add to dashboard Cite

show abstract

Minimizing retrieval latency for content cloud

Björkqvist

Chen

Vukolić

et al. 2011

2011 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Identifying, analyzing, and modeling flashcrowds in BitTorrent

Zhang

Iosup

Pouwelse

et al. 2011

2011 IEEE International Conference on Peer-to-Peer Computing

View full text Add to dashboard Cite

Abstract-Flashcrowds-sudden surges of user arrivals-do occur in BitTorrent, and they can lead to severe service deprivation. However, very little is known about their occurrence patterns and their characteristics in real-world deployments, and many basic questions about BitTorrent flashcrowds, such as How often do they occur? and How long do they last?, remain unanswered. In this paper, we address these questions by studying three datasets that cover millions of swarms from two of the largest BitTorrent trackers. We first propose a model for BitTorrent flashcrowds and a procedure for identifying, analyzing, and modeling BitTorrent flashcrowds. Then we evaluate quantitatively the impact of flashcrowds on BitTorrent users, and we develop an algorithm that identifies BitTorrent flashcrowds. Finally, we study statistically the properties of BitTorrent flashcrowds identified from our datasets, such as their arrival time, duration, and magnitude, and we investigate the relationship between flashcrowds and swarm growth, and the arrival rate of flashcrowds in BitTorrent trackers. In particular, we find that BitTorrent flashcrowds only occur in very small fractions (0.3-2%) of the swarms but that they can affect over ten million users.

show abstract

A queueing system for modeling a file sharing principle

Cited by 5 publications

References 17 publications

Estimating self-sustainability in peer-to-peer swarming systems

Estimating self-sustainability in peer-to-peer swarming systems

Minimizing retrieval latency for content cloud

Identifying, analyzing, and modeling flashcrowds in BitTorrent

Contact Info

Product

Resources

About