A Bandwidth-Aware Scheduling Strategy for P2P-TV Systems
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
Optimizing the Throughput of Data-Driven Peer-to-Peer Streaming
IEEE Transactions on Parallel and Distributed Systems
On the Optimal Scheduling of Streaming Applications in Unstructured Meshes
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Streamline: An Optimal Distribution Algorithm for Peer-to-Peer Real-Time Streaming
IEEE Transactions on Parallel and Distributed Systems
Improving QoS in bittorrent-like VoD systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
UUSee: large-scale operational on-demand streaming with random network coding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Delay bounds of chunk-based peer-to-peer video streaming
IEEE/ACM Transactions on Networking (TON)
A simple model for chunk-scheduling strategies in P2P streaming
IEEE/ACM Transactions on Networking (TON)
A content propagation metric for efficient content distribution
Proceedings of the ACM SIGCOMM 2011 conference
Chainsaw: eliminating trees from overlay multicast
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
There are substantial differences in chunk dissemination manner between P2P live streaming and BitTorrent, and inappropriate algorithms will result in inefficiency of live streaming systems. In this paper, we study the chunk dissemination of P2P live streaming, and introduce a discrete and slotted mathematical model to analyze chunk selection algorithms, including rarest first algorithm and greedy algorithm. Moreover, we present a performance metric to evaluate chunk selection algorithms, as well as the optimization function for the exploration of chunk dissemination strategies. We point out the causes of poor performance of these algorithms, and propose a service request randomization mechanism to promote the use of peer resources, which can prevent chunk requests from rendezvous on a few of peers. Simultaneously, we employ weight assignment strategies to avoid excessive requests for rare chunks. Besides, we present an enhanced model, which adds node degree constraint, to improve our model. We revisit the chunk selection algorithms based on the enhanced model. The results of simulation experiments validate our theoretical analysis and indicate that the weighted randomization mechanism is resilient to flash crowd and peer churn, and can improve the performance of P2P live streaming.