The method of creative telescoping
Journal of Symbolic Computation
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Rarest first and choke algorithms are enough
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
The Long Tail: Why the Future of Business Is Selling Less of More
The Long Tail: Why the Future of Business Is Selling Less of More
Optimal scheduling of peer-to-peer file dissemination
Journal of Scheduling
On the design of hybrid peer-to-peer systems
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A queueing system for modeling a file sharing principle
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On Server Dimensioning for Hybrid P2P Content Distribution Networks
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
The TANGRAMII integrated modeling environment for computer systems and networks
ACM SIGMETRICS Performance Evaluation Review
Antfarm: efficient content distribution with managed swarms
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Content availability and bundling in swarming systems
Proceedings of the 5th international conference on Emerging networking experiments and technologies
On uncoordinated file distribution with non-altruistic downloaders
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Do incentives build robustness in bit torrent
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Analyzing the dynamics and resource usage of p2p file sharing by a spatio-temporal model
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Stability of a peer-to-peer communication system
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Implications of peer selection strategies by publishers on the performance of P2P swarming systems
ACM SIGMETRICS Performance Evaluation Review
Heterogeneous download times in a homogeneous BitTorrent swarm
Computer Networks: The International Journal of Computer and Telecommunications Networking
Content availability and bundling in swarming systems
IEEE/ACM Transactions on Networking (TON)
On the interplay between content popularity and performance in p2p systems
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
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 such a dependence of peers on a publisher. 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 simulations. Finally, we also provide closed-form expressions for the fraction of time that a given number of blocks is collectively held by peers.