Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Erasure Code Replication Revisited
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
A Hybrid Redundancy Approach for Data Availability in Structured P2P Network Systems
PRDC '07 Proceedings of the 13th Pacific Rim International Symposium on Dependable Computing
Churn Impact on Replicated Data Duration in Structured P2P Networks
WAIM '08 Proceedings of the 2008 The Ninth International Conference on Web-Age Information Management
A performance evaluation and examination of open-source erasure coding libraries for storage
FAST '09 Proccedings of the 7th conference on File and storage technologies
Content-access QoS in peer-to-peer networks using a fast MDS erasure code
Computer Communications
High availability in DHTs: erasure coding vs. replication
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
Erasure codes are used in many distributed applications. This paper applies Cauchy Reed-Solomon codes to P2P streaming systems which is different from classical Reed-Solomon codes. Due to churn in these systems, streaming data composition is vital for system management. We mainly concern about how to apply the coding into these systems and present the interaction among the peers and effective buffer management. This distributed sources increase the selection on disseminated encoded data and therefore statistically enhances the overall performance.