Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services

Andrea Tassi, Ioannis Chatzigeorgiou, Daniel Enrique Lucani Roetter

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

22 Citationer (Scopus)

Resumé

Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different random linear network coding (RLNC) techniques. We deal with a fundamental problem: the computational complexity of the RLNC decoder. The higher the number of decoding operations is, the more the user's computational overhead grows and, consequently, the faster the battery of mobile devices drains. By referring to several sparse RLNC techniques, and without any assumption on the implementation of the RLNC decoder in use, we provide an efficient way to characterize the performance of users targeted by ultra-reliable layered multicast services. The proposed modeling allows to efficiently derive the average number of coded packet transmissions needed to recover one or more service layers. We design a convex resource allocation framework that allows to minimize the complexity of the RLNC decoder by jointly optimizing the transmission parameters and the sparsity of the code. The designed optimization framework also ensures service guarantees to predetermined fractions of users. The performance of the proposed optimization framework is then investigated in a LTE-A eMBMS network multicasting H.264/SVC video services.
OriginalsprogEngelsk
TidsskriftI E E E Transactions on Communications
Vol/bind64
Udgave nummer1
Sider (fra-til)285 - 299
ISSN0090-6778
DOI
StatusUdgivet - jan. 2016

Fingerprint

Linear networks
Network coding
Next generation networks
Multicasting
Communication
Mobile devices
Resource allocation
Decoding
Computational complexity

Citer dette

Tassi, Andrea ; Chatzigeorgiou, Ioannis ; Roetter, Daniel Enrique Lucani. / Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services. I: I E E E Transactions on Communications. 2016 ; Bind 64, Nr. 1. s. 285 - 299.
@article{42268060deb44d098dc347f0c8453e75,
title = "Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services",
abstract = "Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different random linear network coding (RLNC) techniques. We deal with a fundamental problem: the computational complexity of the RLNC decoder. The higher the number of decoding operations is, the more the user's computational overhead grows and, consequently, the faster the battery of mobile devices drains. By referring to several sparse RLNC techniques, and without any assumption on the implementation of the RLNC decoder in use, we provide an efficient way to characterize the performance of users targeted by ultra-reliable layered multicast services. The proposed modeling allows to efficiently derive the average number of coded packet transmissions needed to recover one or more service layers. We design a convex resource allocation framework that allows to minimize the complexity of the RLNC decoder by jointly optimizing the transmission parameters and the sparsity of the code. The designed optimization framework also ensures service guarantees to predetermined fractions of users. The performance of the proposed optimization framework is then investigated in a LTE-A eMBMS network multicasting H.264/SVC video services.",
author = "Andrea Tassi and Ioannis Chatzigeorgiou and Roetter, {Daniel Enrique Lucani}",
year = "2016",
month = "1",
doi = "10.1109/TCOMM.2015.2503398",
language = "English",
volume = "64",
pages = "285 -- 299",
journal = "I E E E Transactions on Communications",
issn = "0090-6778",
publisher = "IEEE",
number = "1",

}

Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services. / Tassi, Andrea; Chatzigeorgiou, Ioannis; Roetter, Daniel Enrique Lucani.

I: I E E E Transactions on Communications, Bind 64, Nr. 1, 01.2016, s. 285 - 299.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

TY - JOUR

T1 - Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services

AU - Tassi, Andrea

AU - Chatzigeorgiou, Ioannis

AU - Roetter, Daniel Enrique Lucani

PY - 2016/1

Y1 - 2016/1

N2 - Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different random linear network coding (RLNC) techniques. We deal with a fundamental problem: the computational complexity of the RLNC decoder. The higher the number of decoding operations is, the more the user's computational overhead grows and, consequently, the faster the battery of mobile devices drains. By referring to several sparse RLNC techniques, and without any assumption on the implementation of the RLNC decoder in use, we provide an efficient way to characterize the performance of users targeted by ultra-reliable layered multicast services. The proposed modeling allows to efficiently derive the average number of coded packet transmissions needed to recover one or more service layers. We design a convex resource allocation framework that allows to minimize the complexity of the RLNC decoder by jointly optimizing the transmission parameters and the sparsity of the code. The designed optimization framework also ensures service guarantees to predetermined fractions of users. The performance of the proposed optimization framework is then investigated in a LTE-A eMBMS network multicasting H.264/SVC video services.

AB - Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different random linear network coding (RLNC) techniques. We deal with a fundamental problem: the computational complexity of the RLNC decoder. The higher the number of decoding operations is, the more the user's computational overhead grows and, consequently, the faster the battery of mobile devices drains. By referring to several sparse RLNC techniques, and without any assumption on the implementation of the RLNC decoder in use, we provide an efficient way to characterize the performance of users targeted by ultra-reliable layered multicast services. The proposed modeling allows to efficiently derive the average number of coded packet transmissions needed to recover one or more service layers. We design a convex resource allocation framework that allows to minimize the complexity of the RLNC decoder by jointly optimizing the transmission parameters and the sparsity of the code. The designed optimization framework also ensures service guarantees to predetermined fractions of users. The performance of the proposed optimization framework is then investigated in a LTE-A eMBMS network multicasting H.264/SVC video services.

U2 - 10.1109/TCOMM.2015.2503398

DO - 10.1109/TCOMM.2015.2503398

M3 - Journal article

VL - 64

SP - 285

EP - 299

JO - I E E E Transactions on Communications

JF - I E E E Transactions on Communications

SN - 0090-6778

IS - 1

ER -