A dynamic erasure code for multicasting live data

Authors:
Erik M. Ferragut
Affiliations:
Institute for Defense Analyses, Princeton, New Jersey
Venue:
Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies
Year:
2009

Citing 3
Cited 0

OceanStore: an architecture for global-scale persistent storage

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Digital fountains, a class of erasure codes, have been used for multicasting stream data and for robust distributed data storage. These methods produce a potentially endless sequence of packets from a fixed (static) message. The dynamic erasure code problem is to extend the digital fountains concept to a message generated simultaneously with the transmission (i.e., live data). Solution of this problem provides a means for robust multicasting or one-way transmission of live data on a computer network. It also gives a method for robust distributed storage of log data, or other serially generated data. A new erasure code is proposed as a solution to the dynamic erasure code problem. It is analytically shown to have a fast decoding algorithm and to be highly bandwidth-efficient.