Approximation algorithms
On the minimum delay peer-to-peer video streaming: how realtime can it be?
Proceedings of the 15th international conference on Multimedia
Using layered video to provide incentives in P2P live streaming
Proceedings of the 2007 workshop on Peer-to-peer streaming and IP-TV
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
SIAM Journal on Computing
Faster approximation schemes for fractional multicommodity flow problems
ACM Transactions on Algorithms (TALG)
rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes
IEEE Transactions on Parallel and Distributed Systems
A Study on Reducing Chunk Scheduling Delay for Mesh-Based P2P Live Streaming
GCC '08 Proceedings of the 2008 Seventh International Conference on Grid and Cooperative Computing
Traffic modeling and proportional partial caching for peer-to-peer systems
IEEE/ACM Transactions on Networking (TON)
Streamline: An Optimal Distribution Algorithm for Peer-to-Peer Real-Time Streaming
IEEE Transactions on Parallel and Distributed Systems
Flow control for cost-efficient peer-to-peer streaming
INFOCOM'10 Proceedings of the 29th conference on Information communications
A Measurement Study of a Large-Scale P2P IPTV System
IEEE Transactions on Multimedia
Will IPTV ride the peer-to-peer stream? [Peer-to-Peer Multimedia Streaming]
IEEE Communications Magazine
| Hi-index | 0.00 |
In this paper, we devise a streaming scheme, called iStream, to achieve the minimum average end-to-end P2P streaming delay by optimally allocating the bandwidth resource among peers. We first develop a generic analytical framework to model the minimum average delay P2P streaming problem, called the MADPS problem. We then present iStream to solve the MADPS problem. The core part of iStream is a fast approximation algorithm, called iStream-APX, based on primal-dual schema. We prove that the performance of iStream-APX is bounded by a ratio of 1 + Ω, where Ω is an adjustable input parameter. Furthermore, we show that the flexibility of Ω provides a trade-off between the approximation factor and the running time of iStream.