loading...
A Transpositional Redundant Data Update Algorithm for Growing Server-Less Video Streaming Systems
Link?ping, Sweden September 01-September 03
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PTP.2003.1231507Third International Conference on Pee ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
T. K. Ho, Chinese University of Hong Kong
Jack Y. B. Lee, Chinese University of Hong Kong
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.
Citation:
T. K. Ho, Jack Y. B. Lee, "A Transpositional Redundant Data Update Algorithm for Growing Server-Less Video Streaming Systems," p2p, pp.84, Third International Conference on Peer-to-Peer Computing (P2P'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions