FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Designing overlay multicast networks for streaming
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes
IEEE Transactions on Parallel and Distributed Systems
Rateless codes network coding for simple and efficient P2P video streaming
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Algorithms for optimizing the bandwidth cost of content delivery
Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimizing delivery cost in scalable streaming content distribution systems
IEEE Transactions on Multimedia
IEEE Transactions on Information Theory
IEEE Communications Magazine
Network Coding of Rateless Video in Streaming Overlays
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
Large-scale live streaming systems can experience bottlenecks within the infrastructure of the underlying Content Delivery Network. In particular, the "equipment bottleneck" occurs when the fan-out of a machine does not enable the concurrent transmission of a stream to multiple other equipments. In this paper, we aim to deliver a live stream to a set of destination nodes with minimum throughput at the source and limited increase of the streaming delay. We leverage on rateless codes and cooperation among destination nodes. With rateless codes, a node is able to decode a video block of k information symbols after receiving slightly more than k encoded symbols. To deliver the encoded symbols, we use multiple trees where inner nodes forward all received symbols. Our goal is to build a diffusion forest that minimizes the transmission rate at the source while guaranteeing on-time delivery and reliability at the nodes. When the network is assumed to be lossless and the constraint on delivery delay is relaxed, we give an algorithm that computes a diffusion forest resulting in the minimum source transmission rate. We also propose an effective heuristic algorithm for the general case where packet loss occurs and the delivery delay is bounded. Simulation results for realistic settings show that with our solution the source requires only slightly more than the video bit rate to reliably feed all nodes.