Random shift and XOR of unequal-sized packets (RaSOR) to shave off transmission overhead

Maroua Taghouti, Daniel Enrique Lucani Rötter, Frank H P Fitzek

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

3 Citations (Scopus)

Abstract

We propose the design of a novel coding scheme of unequal-sized packets. Unlike the conventional wisdom that consists of brute-force zero-padding in Random Linear Network Coding (RLNC), we exploit this heterogeneity to shave off this trailing overhead and transmit considerably less coded packets. Thanks to the very basic design, which consists of randomly shifting each original packet then applying XOR-wise operations on a macro-symbol basis (concatenated bytes) to create a coded packet, our scheme has a very low complexity compared to RLNC. The performance depends on the packet sizes distributions as well as the random choice of the shifts only. Our simulation results performed on a state-of-the-art video trace show that in average we need to send only the third of what RLNC for higher finite fields needs to transmit before decoding.

Original languageEnglish
Title of host publication2017 51st Annual Conference on Information Sciences and Systems, CISS 2017
Number of pages6
PublisherIEEE
Publication date10 May 2017
Article number7926102
ISBN (Electronic)9781509047802
DOIs
Publication statusPublished - 10 May 2017
Externally publishedYes
EventConference on Information Sciences and Systems 2017 - Baltimore, United States
Duration: 22 Mar 201724 Mar 2017
https://ciss.jhu.edu/

Conference

ConferenceConference on Information Sciences and Systems 2017
Country/TerritoryUnited States
CityBaltimore
Period22/03/201724/03/2017
Internet address

Fingerprint

Dive into the research topics of 'Random shift and XOR of unequal-sized packets (RaSOR) to shave off transmission overhead'. Together they form a unique fingerprint.

Cite this