Go to:
Logótipo
You are here: Start > Publications > View > On the Delay Distribution of Random Linear Network Coding
Concurso de Escrita Criativa da FEUP
Publication

On the Delay Distribution of Random Linear Network Coding

Title
On the Delay Distribution of Random Linear Network Coding
Type
Article in International Scientific Journal
Year
2011
Authors
Maricica Nistor
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications Without AUTHENTICUS Without ORCID
Daniel E. Lucani
(Author)
FEUP
Tiago Travassos Vieira Vinhoza
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Costa, Rui Filipe Mendes Alves da
(Author)
FEUP
João Francisco Cordeiro de Oliveira Barros
(Author)
FEUP
Journal
Vol. 29 No. 5
Pages: 1084-1093
ISSN: 0733-8716
Publisher: IEEE
Indexing
Publicação em ISI Web of Science ISI Web of Science
Scientific classification
FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering
Other information
Abstract (EN): A fundamental understanding of the delay behavior of network coding is key towards its successful application in real-time applications with strict message deadlines. Previous contributions focused mostly on the average decoding delay, which although useful in various scenarios of interest is not sufficient for providing worst-case delay guarantees. To overcome this challenge, we investigate the entire delay distribution of random linear network coding for any field size and arbitrary number of encoded symbols (or generation size). By introducing a Markov chain model we are able to obtain a complete solution for the erasure broadcast channel with two receivers. A comparison with Automatic Repeat reQuest (ARQ) with perfect feedback, round robin scheduling and a class of fountain codes reveals that network coding on GF(24) offers the best delay performance for two receivers. We also conclude that GF(2) induces a heavy tail in the delay distribution, which implies that network coding based on XOR operations although simple to implement bears a relevant cost in terms of worst-case delay. For the case of three receivers, which is mathematically challenging, we propose a brute-force methodology that gives the delay distribution of network coding for small generations and field size up to GF(24).
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Whether and Where to Code in the Wireless Relay Channel (2012)
Article in International Scientific Journal
Xiaomeng Shi; Muriel Médard; Daniel E. Lucani
Underwater Acoustic Networks: Channel Models and Network Coding based Lower Bound to Transmission Power for Multicast (2008)
Article in International Scientific Journal
Daniel E. Lucani; Muriel Médard; Milica Stojanovic
Secure Network Coding for Multi-Resolution Wireless Video Streaming (2010)
Article in International Scientific Journal
L. Lima; S. Gheorghiu; J. Barros; M. Médard; A. L. Toledo
Real-Time Network Coding for Live Streaming in Hyper-Dense WiFi Spaces (2014)
Article in International Scientific Journal
Diogo Ferreira; Rui Costa; João Barros
On Optimal Policies for Network Coded Cooperation : Theory and Implementation (2014)
Article in International Scientific Journal
Hana Khamfroush; Daniel Lucani; Pahlevani, P.; João Barros

See all (9)

Recommend this page Top
Copyright 1996-2024 © Faculdade de Engenharia da Universidade do Porto  I Terms and Conditions  I Accessibility  I Index A-Z  I Guest Book
Page generated on: 2024-09-27 at 16:27:35 | Acceptable Use Policy | Data Protection Policy | Complaint Portal