An Analysis of Finite-Memory Random Linear Coding on Packet Streams,

We consider the following packet coding scheme: The coding node has a fixed, finite memory in which it stores packets formed from an incoming packet stream, and it sends packets formed from random linear combinations of its memory contents. We analyze the scheme in two settings: as a self-contained component in a network providing reliability on a single link, and as a component employed at intermediate nodes in a block-coded end-to-end connection. We believe that the scheme is a good alternative to automatic repeat request when feedback is too slow, too unreliable, or too difficult to implement.


Presented at:
2nd Workshop on Network Coding, Theory, and Applications (NetCod 2006), Boston, MA, USA, April 3-7, 2006
Year:
2006
Laboratories:




 Record created 2007-02-08, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)