Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Randomized algorithms
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
Efficiency of Data Distribution in BitTorrent-Like Systems
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Heuristic Algorithm for Optimization of P2P-Based Public-Resource Computing Systems
ICDCIT '08 Proceedings of the 5th International Conference on Distributed Computing and Internet Technology
Adding Trust to P2P Distribution of Paid Content
ISC '09 Proceedings of the 12th International Conference on Information Security
About the lifespan of peer to peer networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Performance tradeoffs in structured peer to peer streaming
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We analyze protocols for disseminating a collection of data blocks over a network of peers with a view towards Bit-Torrent and related peer-to-peer networks. Unlike previous work, we accurately model the distribution of the individual data blocks, a process which is critical to the parallelism that makes BitTorrent successful in practice. We also consider multiple network topologies and routing algorithms. We first demonstrate several routing algorithms that distribute b data blocks on a network with diameter d and maximum degree D in O(D(b + d)) phases of concurrent downloads with high probability. This is tight within a factor of D. We also specialize to the networks used by BitTorrent and we improve this bound to O(b ln n) phases where n is the number of clients. Finally, we discuss several practical extensions to BitTorrent, one of which improves the bound to a near-optimal O (b + (ln n)2) phases.