Introduction to finite fields and their applications
Introduction to finite fields and their applications
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Informed content delivery across adaptive overlay networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A Scalable Peer-to-Peer Architecture for Distributed Information Monitoring Applications
IEEE Transactions on Computers
Content availability, pollution and poisoning in file sharing peer-to-peer networks
Proceedings of the 6th ACM conference on Electronic commerce
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Node-capability-aware replica management for peer-to-peer grids
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
SwinDeW-a p2p-based decentralized workflow management system
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
IEEE Transactions on Information Theory
Efficient erasure correcting codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Multicast with network coding in application-layer overlay networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
Peer-to-peer (P2P) content distribution systems based on random linear combination coding schemes outperform traditional block forwarding and source coding systems but have large storage requirements and high computation and communication overheads. To resolve this problem, this paper presents an efficient and scalable P2P content dissemination system based on novel altruistic demand and recoding dissemination mechanisms. In the proposed approach, the shared-content file is segmented and encoded using Reed-Solomon code at a seed. Downstream peers wishing to obtain the file utilize an altruistic demand mechanism to issue demand requests for coded blocks which are useful not only to themselves but also to their neighbors. Upon receiving these requests, the upstream peers utilize a recoding dissemination mechanism to provide the downstream peers with either an existing useful coded block or a new coded block produced using a Lagrange polynomial interpolation method. The two mechanisms rapidly increase the diversity of the coded blocks within the network and therefore provide an effective solution to the missing last block problem. In addition, it is shown that the proposed content distribution system demonstrates a substantial improvement over P2P systems based on random linear combination coding in terms of a lower storage requirement, reduced computation and communication costs, and an improved download efficiency.