A Transpositional Redundant Data Update Algorithm for Growing Server-Less Video Streaming Systems

Recently, a new server-less architecture is proposed for building low-cost yet scalable video streaming systems. In this architecture, video blocks are distributed among user hosts and these hosts cooperate to stream video blocks to one another. To improve reliability, data and capacity redundancy are introduced to sustain node failures. However, the data placement as well as the redundant data in the system will need to be updated whenever new nodes join the system. Results show that the redundancy update overhead is very significant and even exceeds that in data reorganization. In this study, we present a new Transpositional Redundant Data Update algorithm that takes advantage of the structure of Reed-Solomon Erasure Correction codes and employs a special encoding scheme to significantly reduce the redundancy update overhead, especially when updates are performed in batch.

• Type: Conference
• Year: 2003
• Where: P2P
• Authors: Tsz Kin Ho, Jack Y. B. Lee
• Keywords: P2P 2003, Peer-to-Peer Computing, Redundancy Update Overhead, Redundant Data, Video Blocks