Decodability analysis of finite memory random linear coding in line networks

We consider the problem of decodability when random linear coding (RLC) is performed on a stream of packets in a line network. First, we clearly define the problem of decodability for a stream of arriving packets, and discuss its importance with some examples. Then, we will find the limits on the me...

Full description

Saved in:
Bibliographic Details
Published in:2015 IEEE International Conference on Communications (ICC) pp. 6050 - 6055
Main Authors: Torabkhani, Nima, Fekri, Faramarz
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2015
Subjects:
Decoding
Encoding
Markov processes
Network coding
Relays
Steady-state
Upper bound
ISSN:1550-3607
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the problem of decodability when random linear coding (RLC) is performed on a stream of packets in a line network. First, we clearly define the problem of decodability for a stream of arriving packets, and discuss its importance with some examples. Then, we will find the limits on the mean arrival rate under which the stream is decodable. Further, upper bounds will be derived for the average length of a decoded block of packets in multi-hop line networks. Finally, these analytical results are validated via simulations.
ISSN:1550-3607
DOI:10.1109/ICC.2015.7249286