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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2015 IEEE International Conference on Communications (ICC) s. 6050 - 6055
Hlavní autoři: Torabkhani, Nima, Fekri, Faramarz
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2015
Témata:
Decoding
Encoding
Markov processes
Network coding
Relays
Steady-state
Upper bound
ISSN:1550-3607
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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