Caterpillar RLNC (CRLNC): A Practical Finite Sliding Window RLNC Approach

Simon Wunderlich, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek, Martin Reisslein

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

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 to 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 inorder delays of sliding window RLNC.

Original languageEnglish (US)
JournalIEEE Access
DOIs
StateAccepted/In press - Sep 26 2017

Fingerprint

Linear networks
Network coding
Computational complexity
Feedback
Video streaming

Keywords

  • Computational complexity
  • Computational complexity
  • Decoding
  • Delay
  • Delays
  • Encoding
  • Network coding
  • Random linear network coding (RLNC)
  • Reliability
  • Sliding window

ASJC Scopus subject areas

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Cite this

Caterpillar RLNC (CRLNC) : A Practical Finite Sliding Window RLNC Approach. / Wunderlich, Simon; Gabriel, Frank; Pandi, Sreekrishna; Fitzek, Frank H.P.; Reisslein, Martin.

In: IEEE Access, 26.09.2017.

Research output: Contribution to journalArticle

Wunderlich, Simon ; Gabriel, Frank ; Pandi, Sreekrishna ; Fitzek, Frank H.P. ; Reisslein, Martin. / Caterpillar RLNC (CRLNC) : A Practical Finite Sliding Window RLNC Approach. In: IEEE Access. 2017.
@article{79b8b9ff88ae49c2872cdbb4503b4596,
title = "Caterpillar RLNC (CRLNC): A Practical Finite Sliding Window RLNC Approach",
abstract = "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 to 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 inorder delays of sliding window RLNC.",
keywords = "Computational complexity, Computational complexity, Decoding, Delay, Delays, Encoding, Network coding, Random linear network coding (RLNC), Reliability, Sliding window",
author = "Simon Wunderlich and Frank Gabriel and Sreekrishna Pandi and Fitzek, {Frank H.P.} and Martin Reisslein",
year = "2017",
month = "9",
day = "26",
doi = "10.1109/ACCESS.2017.2757241",
language = "English (US)",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Caterpillar RLNC (CRLNC)

T2 - A Practical Finite Sliding Window RLNC Approach

AU - Wunderlich, Simon

AU - Gabriel, Frank

AU - Pandi, Sreekrishna

AU - Fitzek, Frank H.P.

AU - Reisslein, Martin

PY - 2017/9/26

Y1 - 2017/9/26

N2 - 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 to 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 inorder delays of sliding window RLNC.

AB - 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 to 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 inorder delays of sliding window RLNC.

KW - Computational complexity

KW - Computational complexity

KW - Decoding

KW - Delay

KW - Delays

KW - Encoding

KW - Network coding

KW - Random linear network coding (RLNC)

KW - Reliability

KW - Sliding window

UR - http://www.scopus.com/inward/record.url?scp=85030787384&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030787384&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2017.2757241

DO - 10.1109/ACCESS.2017.2757241

M3 - Article

AN - SCOPUS:85030787384

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

ER -