Redundant Data Composition of Peers in P2P Streaming Systems Using Cauchy Reed-Solomon Codes

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.