Towards efficient video chunk dissemination in peer-to-peer live streaming

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 m...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2013-10, Vol.57 (15), p.3009-3024
Main Authors: Hu, Chao, Chen, Ming, Xing, Changyou
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Chunk selection
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Mathematical models
Optimization techniques
Peer to peer computing
Peer-to-peer live streaming
Performance optimization
Simulation
Software
Streaming media
Studies
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Weighted randomization mechanism
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2013.07.003