An analytical model for perpetual network codes in packet erasure channels

Peyman Pahlevani, Sergio Crisostomo, Daniel Enrique Lucani Roetter

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

2 Citationer (Scopus)

Resumé

Perpetual codes provide a sparse, but structured coding for fast encoding and decoding. In this work, we illustrate that perpetual codes introduce linear dependent packet transmissions in the presence of an erasure channel. We demonstrate that the number of linear dependent packet transmissions is highly dependent on a parameter called the width (ωω), which represents the number of consecutive non-zero coding coefficient present in each coded packet after a pivot element. We provide a mathematical analysis based on the width of the coding vector for the number of transmitted packets and validate it with simulation results. The simulations show that for ω=5ω=5, generation size g=256g=256, and low erasure probability on the link, a destination can receive up to 70%70% overhead in average. Moreover, increasing the width, the overhead contracts, and for ω≥60ω≥60 it becomes negligible.
OriginalsprogEngelsk
TitelMultiple Access Communications : 9th International Workshop, MACOM 2016, Aalborg, Denmark, November 21-22, 2016, Proceedings
Antal sider10
Vol/bind10121
ForlagSpringer
Publikationsdato2016
Sider126-135
ISBN (Trykt)978-3-319-51375-1
ISBN (Elektronisk)978-3-319-51376-8
DOI
StatusUdgivet - 2016
Begivenhed9th International Workshop on Multiple Access Communications - Aalborg, Danmark
Varighed: 21 nov. 201622 nov. 2016

Konference

Konference9th International Workshop on Multiple Access Communications
LandDanmark
ByAalborg
Periode21/11/201622/11/2016
NavnLecture Notes in Computer Science
ISSN0302-9743

Fingerprint

Analytical models
Decoding

Citer dette

Pahlevani, P., Crisostomo, S., & Roetter, D. E. L. (2016). An analytical model for perpetual network codes in packet erasure channels. I Multiple Access Communications: 9th International Workshop, MACOM 2016, Aalborg, Denmark, November 21-22, 2016, Proceedings (Bind 10121, s. 126-135). Springer. Lecture Notes in Computer Science https://doi.org/10.1007/978-3-319-51376-8_10
Pahlevani, Peyman ; Crisostomo, Sergio ; Roetter, Daniel Enrique Lucani. / An analytical model for perpetual network codes in packet erasure channels. Multiple Access Communications: 9th International Workshop, MACOM 2016, Aalborg, Denmark, November 21-22, 2016, Proceedings. Bind 10121 Springer, 2016. s. 126-135 (Lecture Notes in Computer Science).
@inproceedings{70da7302828c443e8b2ff8d673627915,
title = "An analytical model for perpetual network codes in packet erasure channels",
abstract = "Perpetual codes provide a sparse, but structured coding for fast encoding and decoding. In this work, we illustrate that perpetual codes introduce linear dependent packet transmissions in the presence of an erasure channel. We demonstrate that the number of linear dependent packet transmissions is highly dependent on a parameter called the width (ωω), which represents the number of consecutive non-zero coding coefficient present in each coded packet after a pivot element. We provide a mathematical analysis based on the width of the coding vector for the number of transmitted packets and validate it with simulation results. The simulations show that for ω=5ω=5, generation size g=256g=256, and low erasure probability on the link, a destination can receive up to 70{\%}70{\%} overhead in average. Moreover, increasing the width, the overhead contracts, and for ω≥60ω≥60 it becomes negligible.",
author = "Peyman Pahlevani and Sergio Crisostomo and Roetter, {Daniel Enrique Lucani}",
year = "2016",
doi = "10.1007/978-3-319-51376-8_10",
language = "English",
isbn = "978-3-319-51375-1",
volume = "10121",
pages = "126--135",
booktitle = "Multiple Access Communications",
publisher = "Springer",
address = "Germany",

}

Pahlevani, P, Crisostomo, S & Roetter, DEL 2016, An analytical model for perpetual network codes in packet erasure channels. i Multiple Access Communications: 9th International Workshop, MACOM 2016, Aalborg, Denmark, November 21-22, 2016, Proceedings. bind 10121, Springer, Lecture Notes in Computer Science, s. 126-135, Aalborg, Danmark, 21/11/2016. https://doi.org/10.1007/978-3-319-51376-8_10

An analytical model for perpetual network codes in packet erasure channels. / Pahlevani, Peyman; Crisostomo, Sergio; Roetter, Daniel Enrique Lucani.

Multiple Access Communications: 9th International Workshop, MACOM 2016, Aalborg, Denmark, November 21-22, 2016, Proceedings. Bind 10121 Springer, 2016. s. 126-135 (Lecture Notes in Computer Science).

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

TY - GEN

T1 - An analytical model for perpetual network codes in packet erasure channels

AU - Pahlevani, Peyman

AU - Crisostomo, Sergio

AU - Roetter, Daniel Enrique Lucani

PY - 2016

Y1 - 2016

N2 - Perpetual codes provide a sparse, but structured coding for fast encoding and decoding. In this work, we illustrate that perpetual codes introduce linear dependent packet transmissions in the presence of an erasure channel. We demonstrate that the number of linear dependent packet transmissions is highly dependent on a parameter called the width (ωω), which represents the number of consecutive non-zero coding coefficient present in each coded packet after a pivot element. We provide a mathematical analysis based on the width of the coding vector for the number of transmitted packets and validate it with simulation results. The simulations show that for ω=5ω=5, generation size g=256g=256, and low erasure probability on the link, a destination can receive up to 70%70% overhead in average. Moreover, increasing the width, the overhead contracts, and for ω≥60ω≥60 it becomes negligible.

AB - Perpetual codes provide a sparse, but structured coding for fast encoding and decoding. In this work, we illustrate that perpetual codes introduce linear dependent packet transmissions in the presence of an erasure channel. We demonstrate that the number of linear dependent packet transmissions is highly dependent on a parameter called the width (ωω), which represents the number of consecutive non-zero coding coefficient present in each coded packet after a pivot element. We provide a mathematical analysis based on the width of the coding vector for the number of transmitted packets and validate it with simulation results. The simulations show that for ω=5ω=5, generation size g=256g=256, and low erasure probability on the link, a destination can receive up to 70%70% overhead in average. Moreover, increasing the width, the overhead contracts, and for ω≥60ω≥60 it becomes negligible.

U2 - 10.1007/978-3-319-51376-8_10

DO - 10.1007/978-3-319-51376-8_10

M3 - Article in proceeding

SN - 978-3-319-51375-1

VL - 10121

SP - 126

EP - 135

BT - Multiple Access Communications

PB - Springer

ER -

Pahlevani P, Crisostomo S, Roetter DEL. An analytical model for perpetual network codes in packet erasure channels. I Multiple Access Communications: 9th International Workshop, MACOM 2016, Aalborg, Denmark, November 21-22, 2016, Proceedings. Bind 10121. Springer. 2016. s. 126-135. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-51376-8_10