Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao https://doi.org/10.1...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
https://doi.org/10.1109/netsof...
Article . 2019 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
DBLP
Conference object
Data sources: DBLP
versions View all 2 versions
addClaim

Improving Communication Reliability Efficiently: Adaptive Redundancy for RLNC in SDN

Authors: Justus Rischke; Frank Gabriel; Sreekrishna Pandi; Giang T. Nguyen 0002; Hani Salah; Frank H. P. Fitzek;

Improving Communication Reliability Efficiently: Adaptive Redundancy for RLNC in SDN

Abstract

A wide variety of applications ranging from distributed storage to Forward Error Correction (FEC) benefit from Random Linear Network Coding (RLNC). Recent research activities exploited Network Coding as a Service (NCaaS) as FEC for Software-Defined Networking (SDN). Based on the aforementioned research, in this paper we propose a more efficient approach to use RLNC in a reliability-centric network. By leveraging both, the knowledge possessed by the SDN switches on channel conditions and the dynamic flexibility provided by the virtualized coding instances, we developed a novel method to adapt the code rate of the underlying FEC, to support two different transport protocols with varying reliability and throughput requirements. We have implemented our approach in a realistic SDN emulator to evaluate it in a communication network with time-variant links for TCP and UDP flows comparing against existing fixed-code rate approaches. The results show that our method adapts the flows respectively to the channel conditions and thus delivers a good trade-off between reliability, bandwidth, and overhead. Specifically, our loss estimation algorithm can precisely estimate future losses with a deviation of up to 3%. Our approach is also able to precisely determine the delivery probability with a maximum deviation of 1.5%. In addition, we show that our adaptive redundancy enables TCP to achieve a stable throughput despite losses.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!