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

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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:arXiv.org
Hlavní autori: Tassi, Andrea, Chatzigeorgiou, Ioannis, Lucani, Daniel E
Médium: Paper
Jazyk:English
Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 20.11.2015
Predmet:
ISSN:2331-8422
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
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.
AbstractList 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 Lucani, Daniel E
Chatzigeorgiou, Ioannis
Tassi, Andrea
Author_xml – sequence: 1
  givenname: Andrea
  surname: Tassi
  fullname: Tassi, Andrea
– sequence: 2
  givenname: Ioannis
  surname: Chatzigeorgiou
  fullname: Chatzigeorgiou, Ioannis
– sequence: 3
  givenname: Daniel
  surname: Lucani
  middlename: E
  fullname: Lucani, Daniel E
BookMark eNotj81OAjEYABujiYg8gLcmnhfbr9tt90iIiglKAtyx235rikuL7YI_Ty-JnuYwySRzRc5DDEjIDWfjUkvJ7kz68scxl5yPmdQ1nJEBCMELXQJcklHOW8YYVAqkFAPyOgmm-84-UxMcXex7v_M_pvcx0NjS1d6kjHR5cnFH5z6gSfQF-8-Y3uk0Oh_eaBsTXWLnTdMhfT50vbcm93SF6egt5mty0Zou4-ifQ7J-uF9PZ8V88fg0ncwLI6EqjNW1VbJRzEquTFsjuNqhA20VlqWrrGVaWQsc0FSuNFY2tWCOgWgk6EYMye1fdp_ixwFzv9nGQzq95Q0wzUoFoqrEL1KRWM0
ContentType Paper
Copyright 2015. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2015. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.1511.05892
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest MSED
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest Technology Collection
ProQuest One
ProQuest Central Korea
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: ProQuest Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a526-ac89c75b70c517af9e2d9ded28c7e44d6cc087cc212ea6d4ac5b930d023b528b3
IEDL.DBID M7S
IngestDate Mon Jun 30 09:26:03 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a526-ac89c75b70c517af9e2d9ded28c7e44d6cc087cc212ea6d4ac5b930d023b528b3
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2080472366?pq-origsite=%requestingapplication%
PQID 2080472366
PQPubID 2050157
ParticipantIDs proquest_journals_2080472366
PublicationCentury 2000
PublicationDate 20151120
PublicationDateYYYYMMDD 2015-11-20
PublicationDate_xml – month: 11
  year: 2015
  text: 20151120
  day: 20
PublicationDecade 2010
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2015
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.5782355
SecondaryResourceType preprint
Snippet Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Cellular communication
Coding
Complexity
Computation
Decoding
Electronic devices
Mobile communication systems
Multicasting
Network reliability
Optimization
Power consumption
Resource allocation
Wireless communications
Title Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services
URI https://www.proquest.com/docview/2080472366
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV09T8MwELWgBYmJb_FRKg-sKfly7ExIVK1gIERthzIV52xLHZqUpFT8fM5pCgMSC2PkDJGT3Lt3fnePkFuENKOl0Y5ErHVCxqWTBVo4LjOgjcqUp01tNsGTREyncdoU3KpGVrmNiXWgVgXYGjmSdGEHGwZRdL98d6xrlD1dbSw0dknbTknwaune-LvG4kccM-Zgc5hZj-66k-XnfN3DW72eNdTzf4XgGleGh_99oiPSTuVSl8dkR-cnZL_Wc0J1St62w0aozBV9wbiwaBouaWHoeIl0VtMRrhULinQUP3eabAThtF9YOKOYzFKrV7atVbRu0wVZreg2tpyRyXAw6T86jZmCI5kfORJEDJxl3AXmcWli7atYaeUL4DoMVQTgCg6ASKZlpEIJLIsDVyGkZ8wXWXBOWnmR6wtCPY0cx5M-0yBCFbgSWa4rAQSPpTCZd0k62_2aNT9ENfvZrKu_l6_JAeYkzLb7-W6HtFblh74he7BezauyS9oPgyQddev3jFfp03P6-gU2zbXP
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LU9swEN5JSTtwAkoZHoHqUI6mtmxZ8qHDIcCEgQam5MAtyKv1DAfiEIfXj-I_duXE9NCZ3nLoWTMaySt_337SPgC-MaUVZAsKLHNtkChtgzwmE4SqQCpc7iIq6mYTut83NzfZVQvemlwYH1bZYGIN1K5Ef0fOIt34woZxmh6NHwLfNcq_rjYtNGbH4pxen1myVT_Ojtm-B1Kengy6vWDeVSCwSqaBRZOhVrkOUUXaFhlJlzly0qCmJHEpYmg0IkM62dQlFlWexaFjbsuVNHnM036ANu9MZnWk4PX7lY5MNTvo8ezttK4U9t1OXu6eDplVo0Pfv0_-hfg1jZ2u_mcfYA3aV3ZMk3Vo0egzfKqjVbHagNumlIqwIycuGfXu5-mkoizE9ZjFOolfPFbeCxbbvGjRn4W7i27pyVqwqy58NLZPHBN1EjLaaioa5PwCg0XsaROWRuWItkBExAouslIRmsTFoWUNH1pEozNrijzahk5jnuH8d6-Gf2yz8-_hr7DcG_y8GF6c9c93YYW9L-UTG2XYgaXp5JH24CM-Te-qyX59tAQMF2zJ36b7EAQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Analysis+and+Optimization+of+Sparse+Random+Linear+Network+Coding+for+Reliable+Multicast+Services&rft.jtitle=arXiv.org&rft.au=Tassi%2C+Andrea&rft.au=Chatzigeorgiou%2C+Ioannis&rft.au=Lucani%2C+Daniel+E&rft.date=2015-11-20&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.1511.05892