Rate-optimal schemes for Peer-to-Peer live streaming
Performance Evaluation
Journal of Network and Computer Applications
An analytical framework for self-organizing peer-to-peer anti-entropy algorithms
Performance Evaluation
Push/pull protocols for streaming in P2P systems
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Fast file dissemination in peer-to-peer networks with upstream bandwidth constraint
Future Generation Computer Systems
SWOB: swarm intelligent odour based routing for geographic wireless sensor network applications
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Order-optimal consensus through randomized path averaging
IEEE Transactions on Information Theory
A simple model for chunk-scheduling strategies in P2P streaming
IEEE/ACM Transactions on Networking (TON)
Design and evaluation of load balancing algorithms in P2P streaming protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
Video streaming over P2P networks: Challenges and opportunities
Image Communication
Modeling and performance analysis of pull-based live streaming schemes in Peer-to-Peer network
Computer Communications
| Hi-index | 754.90 |
This paper investigates the dissemination of multiple pieces of information in large networks where users contact each other in a random uncoordinated manner, and users upload one piece per unit time. The underlying motivation is the design and analysis of piece selection protocols for peer-to-peer networks which disseminate files by dividing them into pieces. We first investigate one-sided protocols, where piece selection is based on the states of either the transmitter or the receiver. We show that any such protocol relying only on pushes, or alternatively only on pulls, is inefficient in disseminating all pieces to all users. We propose a hybrid one-sided piece selection protocol-INTERLEAVE-and show that by using both pushes and pulls it disseminates k pieces from a single source to n users in 9(k + log n) time, while obeying the constraint that each user can upload at most one piece in one unit of time, with high probability for large n. An optimal, unrealistic, centralized protocol would take k + log2 n time in this setting. For a soft upload constraint, the finishing time of INTERLEAVE is, with high probability, at most 3.2(k + log n). Moreover, efficient dissemination is also possible if the source implements forward erasure coding, and users push the latest released coded pieces (but do not pull). We also investigate two-sided protocols where piece selection is based on the states of both the transmitter and the receiver. We show that it is possible to disseminate n pieces to n users in n + O(log n) time, starting from an initial state where each user has a unique piece.