Caterpillar RLNC (CRLNC): A Practical Finite Sliding Window RLNC Approach
| Autor: | Sreekrishna Pandi, Martin Reisslein, Frank H. P. Fitzek, Simon Wunderlich, Frank Gabriel |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
General Computer Science
Network packet Computer science delay Real-time computing General Engineering 020206 networking & telecommunications 02 engineering and technology sliding window random linear network coding (RLNC) law.invention Computational complexity law Sliding window protocol Linear network coding Internet Protocol 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing General Materials Science lcsh:Electrical engineering. Electronics. Nuclear engineering Algorithm lcsh:TK1-9971 Decoding methods |
| Zdroj: | IEEE Access, Vol 5, Pp 20183-20197 (2017) |
| ISSN: | 2169-3536 |
| Popis: | Random linear network coding (RLNC) is a popular coding scheme for improving communication and content distribution over lossy channels. For packet streaming applications, such as video streaming and general IP packet streams, recent research has shown that sliding window RLNC approaches can reduce the in-order delay compared with block-based RLNC. However, existing sliding window RLNC approaches have prohibitive computational complexity or require feedback from the receivers to the sender. We introduce caterpillar RLNC (CRLNC), a practical finite sliding window RLNC approach that does not require feedback. CRLNC requires only simple modifications of the encoded packet structure and elementary pre-processing steps of the received coded packets before feeding the received coding coefficients and symbols into a standard block-based RLNC decoder. We demonstrate through extensive simulations that CRLNC achieves the reliability and low computational complexity of block-based RLNC, while achieving the low in-order delays of sliding window RLNC. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|