Redundant data composition of peers in P2P streaming systems using Cauchy Reed-Solomon codes
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
| Hi-index | 0.00 |
For practical deployment of peer-to-peer (P2P) systems, it is one of the most important and challengeable aspects to achieve high data availability in structured P2P systems since the environment is much scalable and dynamic. The paper utilizes the hybrid of two data redundancy schemes, namely replication and erasure coding, to improve system availability. To mask or hide the high churn from the short-lived but churn-frequent peers and permanent failure peers, we use replication among the nodes in a certain interval of the identifier space that can be considered as a virtual node. Then with an erasurecoded redundancy scheme, we consider that a set of virtual nodes that cooperatively provide guaranteed over the networks. The paper presents the hybrid redundancy prototype and protocol. The evaluation shows that the approach is effective with an empirical trace by setting different system parameters.