Reduction of Padding Overhead for RLNC Media Distribution With Variable Size Packets

Maroua Taghouti, Daniel E. Lucani, Juan A. Cabrera, Martin Reisslein, Morten Videbaek Pedersen, Frank H.P. Fitzek

Research output: Contribution to journalArticle

Abstract

Random linear network coding (RLNC) can enhance the reliability of multimedia transmissions over lossy communication channels. However, RLNC has been designed for equal size packets, while many efficient multimedia compression schemes, such as variable bitrate (VBR) video compression, produce unequal packet sizes. Padding the unequal packet sizes with zeros to the maximum packet size creates an overhead on the order of 20%-50% or more for typical VBR videos. Previous padding overhead reduction approaches have focused on packing the unequal packet sizes into fixed size packets, e.g., through packet bundling or chaining and fragmentation. We introduce an alternative padding reduction approach based on coding macro-symbols (MSs), whereby an MS is a fixed-sized part of a packet. In particular, we introduce a new class of RLNC, namely MS RLNC which conducts RLNC across columns of MSs, instead of the conventional RLNC across columns of complete packets of equal size. Judiciously arranging the source packets into columns of MSs, e.g., through shifting the source packets horizontally relative to each other, supports favorable MS RLNC coding properties. We specify the MS RLNC encoding and decoding mechanisms and analyze their complexity for a range of specific MS arrangement strategies within the class of MS RLNC. We conduct a comprehensive padding overhead evaluation encompassing both previous approaches of packing the unequal size packets into fixed size packets as well as the novel MS RLNC approaches with long VBR video frame size traces. We find that for small RLNC generation sizes that support low network transport delays, MS RLNC achieves the lowest padding overheads; while for large generation sizes, both the previous packing approaches and the novel MS RLNC approaches effectively reduce the padding overhead.

Original languageEnglish (US)
JournalIEEE Transactions on Broadcasting
DOIs
StateAccepted/In press - Jan 1 2019

Fingerprint

Linear networks
Network coding
Macros
Image compression
Decoding

Keywords

  • Random linear network coding (RLNC)
  • variable bitrate (VBR) video
  • variable-sized packets
  • video streaming
  • zero-padding

ASJC Scopus subject areas

  • Media Technology
  • Electrical and Electronic Engineering

Cite this

Reduction of Padding Overhead for RLNC Media Distribution With Variable Size Packets. / Taghouti, Maroua; Lucani, Daniel E.; Cabrera, Juan A.; Reisslein, Martin; Pedersen, Morten Videbaek; Fitzek, Frank H.P.

In: IEEE Transactions on Broadcasting, 01.01.2019.

Research output: Contribution to journalArticle

Taghouti, Maroua ; Lucani, Daniel E. ; Cabrera, Juan A. ; Reisslein, Martin ; Pedersen, Morten Videbaek ; Fitzek, Frank H.P. / Reduction of Padding Overhead for RLNC Media Distribution With Variable Size Packets. In: IEEE Transactions on Broadcasting. 2019.
@article{7ff56104cc564395aa301d3f56008210,
title = "Reduction of Padding Overhead for RLNC Media Distribution With Variable Size Packets",
abstract = "Random linear network coding (RLNC) can enhance the reliability of multimedia transmissions over lossy communication channels. However, RLNC has been designed for equal size packets, while many efficient multimedia compression schemes, such as variable bitrate (VBR) video compression, produce unequal packet sizes. Padding the unequal packet sizes with zeros to the maximum packet size creates an overhead on the order of 20{\%}-50{\%} or more for typical VBR videos. Previous padding overhead reduction approaches have focused on packing the unequal packet sizes into fixed size packets, e.g., through packet bundling or chaining and fragmentation. We introduce an alternative padding reduction approach based on coding macro-symbols (MSs), whereby an MS is a fixed-sized part of a packet. In particular, we introduce a new class of RLNC, namely MS RLNC which conducts RLNC across columns of MSs, instead of the conventional RLNC across columns of complete packets of equal size. Judiciously arranging the source packets into columns of MSs, e.g., through shifting the source packets horizontally relative to each other, supports favorable MS RLNC coding properties. We specify the MS RLNC encoding and decoding mechanisms and analyze their complexity for a range of specific MS arrangement strategies within the class of MS RLNC. We conduct a comprehensive padding overhead evaluation encompassing both previous approaches of packing the unequal size packets into fixed size packets as well as the novel MS RLNC approaches with long VBR video frame size traces. We find that for small RLNC generation sizes that support low network transport delays, MS RLNC achieves the lowest padding overheads; while for large generation sizes, both the previous packing approaches and the novel MS RLNC approaches effectively reduce the padding overhead.",
keywords = "Random linear network coding (RLNC), variable bitrate (VBR) video, variable-sized packets, video streaming, zero-padding",
author = "Maroua Taghouti and Lucani, {Daniel E.} and Cabrera, {Juan A.} and Martin Reisslein and Pedersen, {Morten Videbaek} and Fitzek, {Frank H.P.}",
year = "2019",
month = "1",
day = "1",
doi = "10.1109/TBC.2019.2892594",
language = "English (US)",
journal = "IEEE Transactions on Broadcasting",
issn = "0018-9316",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Reduction of Padding Overhead for RLNC Media Distribution With Variable Size Packets

AU - Taghouti, Maroua

AU - Lucani, Daniel E.

AU - Cabrera, Juan A.

AU - Reisslein, Martin

AU - Pedersen, Morten Videbaek

AU - Fitzek, Frank H.P.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Random linear network coding (RLNC) can enhance the reliability of multimedia transmissions over lossy communication channels. However, RLNC has been designed for equal size packets, while many efficient multimedia compression schemes, such as variable bitrate (VBR) video compression, produce unequal packet sizes. Padding the unequal packet sizes with zeros to the maximum packet size creates an overhead on the order of 20%-50% or more for typical VBR videos. Previous padding overhead reduction approaches have focused on packing the unequal packet sizes into fixed size packets, e.g., through packet bundling or chaining and fragmentation. We introduce an alternative padding reduction approach based on coding macro-symbols (MSs), whereby an MS is a fixed-sized part of a packet. In particular, we introduce a new class of RLNC, namely MS RLNC which conducts RLNC across columns of MSs, instead of the conventional RLNC across columns of complete packets of equal size. Judiciously arranging the source packets into columns of MSs, e.g., through shifting the source packets horizontally relative to each other, supports favorable MS RLNC coding properties. We specify the MS RLNC encoding and decoding mechanisms and analyze their complexity for a range of specific MS arrangement strategies within the class of MS RLNC. We conduct a comprehensive padding overhead evaluation encompassing both previous approaches of packing the unequal size packets into fixed size packets as well as the novel MS RLNC approaches with long VBR video frame size traces. We find that for small RLNC generation sizes that support low network transport delays, MS RLNC achieves the lowest padding overheads; while for large generation sizes, both the previous packing approaches and the novel MS RLNC approaches effectively reduce the padding overhead.

AB - Random linear network coding (RLNC) can enhance the reliability of multimedia transmissions over lossy communication channels. However, RLNC has been designed for equal size packets, while many efficient multimedia compression schemes, such as variable bitrate (VBR) video compression, produce unequal packet sizes. Padding the unequal packet sizes with zeros to the maximum packet size creates an overhead on the order of 20%-50% or more for typical VBR videos. Previous padding overhead reduction approaches have focused on packing the unequal packet sizes into fixed size packets, e.g., through packet bundling or chaining and fragmentation. We introduce an alternative padding reduction approach based on coding macro-symbols (MSs), whereby an MS is a fixed-sized part of a packet. In particular, we introduce a new class of RLNC, namely MS RLNC which conducts RLNC across columns of MSs, instead of the conventional RLNC across columns of complete packets of equal size. Judiciously arranging the source packets into columns of MSs, e.g., through shifting the source packets horizontally relative to each other, supports favorable MS RLNC coding properties. We specify the MS RLNC encoding and decoding mechanisms and analyze their complexity for a range of specific MS arrangement strategies within the class of MS RLNC. We conduct a comprehensive padding overhead evaluation encompassing both previous approaches of packing the unequal size packets into fixed size packets as well as the novel MS RLNC approaches with long VBR video frame size traces. We find that for small RLNC generation sizes that support low network transport delays, MS RLNC achieves the lowest padding overheads; while for large generation sizes, both the previous packing approaches and the novel MS RLNC approaches effectively reduce the padding overhead.

KW - Random linear network coding (RLNC)

KW - variable bitrate (VBR) video

KW - variable-sized packets

KW - video streaming

KW - zero-padding

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

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

U2 - 10.1109/TBC.2019.2892594

DO - 10.1109/TBC.2019.2892594

M3 - Article

AN - SCOPUS:85061330818

JO - IEEE Transactions on Broadcasting

JF - IEEE Transactions on Broadcasting

SN - 0018-9316

ER -