Concrete Math
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Informed content delivery across adaptive overlay networks
IEEE/ACM Transactions on Networking (TON)
rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes
IEEE Transactions on Parallel and Distributed Systems
Foundations and Trends® in Networking
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
XORs in the air: practical wireless network coding
IEEE/ACM Transactions on Networking (TON)
Analysis of PPLive through active and passive measurements
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Rateless codes network coding for simple and efficient P2P video streaming
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
The Design and Performance of Distributed LT Codes
IEEE Transactions on Information Theory
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we propose a practical Random Network Coding (RNC) scheme for data distribution in a peer-to-peer (P2P) overlay network. The use of RNC incurs a significant computational cost that, till present, has limited its deployment in practical applications. In this study, it is shown that RNC complexity can be lowered by using Luby Transform (LT) codes to pre-encode the data and by letting intermediate nodes use RNC in a low-order Galois Field, i.e. GF(2). Moreover, we exploit a recently proposed variant of the Gaussian Elimination algorithm (OFG) to improve further both the creation of random combinations for RNC and the final decoding of the content. Our analysis is based on both analytical modeling and simulations over P2P overlay networks generated from random graphs and real snapshots of the PPLive streaming application. The results point out that using LT codes and RNC in GF(2) one is able to significantly improve the overall performance in terms of both delay and bandwidth utilization at a reasonable computational cost. Finally, the RNC strategies we propose do not require any prior knowledge of the overlay network topology thus making them very general.