Epidemic live streaming: optimal performance trade-offs
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A multi-swarm approach for neighbor selection in peer-to-peer networks
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
Towards low-redundancy push-pull P2P live streaming
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Live streaming performance of the Zattoo network
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
LayerP2P: using layered video chunks in P2P live streaming
IEEE Transactions on Multimedia
Tree-based analysis of mesh overlays for peer-to-peer streaming
DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
An adaptive peer-to-peer live streaming system with incentives for resilience
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable peer-to-peer video streaming in WiMAX networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Contracts: practical contribution incentives for P2P live streaming
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Optimal incentive-based scheduling of layered video packets in P2P streaming
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Live streaming with receiver-based peer-division multiplexing
IEEE/ACM Transactions on Networking (TON)
SmartPeerCast: a Smart QoS driven P2P live streaming framework
Multimedia Tools and Applications
A design for securing data delivery in mesh-based peer-to-peer streaming
Computer Networks: The International Journal of Computer and Telecommunications Networking
Survey A survey of peer-to-peer live video streaming schemes - An algorithmic perspective
Computer Networks: The International Journal of Computer and Telecommunications Networking
StrU: a user behaviour-aware video-on-demand streaming service
Proceedings of the 10th International Conference on Advances in Mobile Computing & Multimedia
Self-* in Multimedia Communication Overlays
Computer Communications
On incentivizing upload capacity in P2P-VoD systems: Design, analysis and evaluation
Computer Networks: The International Journal of Computer and Telecommunications Networking
The state of peer-to-peer network simulators
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
Large-scale live media streaming is a challenge for traditional server-based approaches. To appropriately support big audiences, broadcasters must be able to allocate huge bandwidth and computational resources. The costs involved with such an infrastructure exclude all but the established content producers from exploiting the Internet as a distribution medium. Publishers of not-yet-popular content, unless they manage to properly predict their maximum audience size, will likely fail to dimension correctly their broadcast infrastructure. Peer-to-peer systems for live streaming allow the users to support content distribution by contributing their unused resources: this increases the scalability of the content distribution while reducing at the same time the economical burden on the streaming provider. This paper presents and evaluates PULSE, an unstructured mesh-based peer-to-peer system designed to support live streaming to large audiences under the arbitrary resource availability as is typically the case for the Internet. PULSE is a highly dynamic system: it constantly optimizes its mesh of data connections using a feedback-driven peer selection strategy that is based on pairwise incentives. We evaluate the behavior of PULSE under realistic scenarios via simulation and emulation, and present the advantages of our approach, namely a best-effort response to system-wide resource scarcity, high resilience to node churn, and good hop-count properties of the average data distribution paths.