Random Linear Network Coding (RLNC): Background and Practical Considerations
draft-heide-nwcrg-rlnc-background-00
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Janus Heide , Shirley Shi , Kerim Fouli , Muriel Medard , Vince Chook | ||
Last updated | 2019-08-15 (Latest revision 2019-02-11) | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document describes the use of Random Linear Network Coding (RLNC) schemes for reliable data transport. Both block and sliding window RLNC code implementations are described. By providing erasure correction using randomly generated repair symbols, such RLNC-based schemes offer advantages in accommodating varying frame sizes and dynamically changing connections, reducing the need for feedback, and lowering the amount of state information needed at the sender and receiver. The practical considerations' section identifies RLNC- encoded symbol representation as a valuable target for standardization.
Authors
Janus Heide
Shirley Shi
Kerim Fouli
Muriel Medard
Vince Chook
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)