Network coding designs suited for the real world: What works, what doesn't, what's promising

Pedersen, Morten Videbæk; Lucani, Daniel E.; Fitzek, Frank H. P.; Sorensen, Chres W.; Badr, Arash Shahbaz

doi:10.1109/itw.2013.6691231

Cited by 16 publications

(45 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [19], the authors discuss several issues that affect the performance, in terms of computational complexity, for practical network coding implementations including network coding parameters, such as, generation and field size, and also platform dependent and protocol related issues. CoMP suggested in [20] is a multipath online network coding scheme that is aimed at improving the performance of TCP sessions in multihop wireless mesh networks.…”

Section: Introductionmentioning

confidence: 99%

On the performance of network coding and forwarding schemes with different degrees of redundancy for wireless mesh networks

Ploumidis

Παππάς

Siris

et al. 2015

Computer Communications

View full text Add to dashboard Cite

This work explores the throughput and delay that can be achieved by various forwarding schemes, employing multiple paths and different degrees of redundancy, focusing on linear network coding. The key contribution of the study is an analytical framework for modeling the throughput and delay forvarious schemes, considering wireless mesh networks where unicast traffic is forwarded and hop-by-hop retransmissions are employed for achieving reliability. The analytical framework is generalized for an arbitrary number of paths and hops per path. Another key contribution of the study is the evaluation and extension of the numerical results, drawn from the analysis, through system-level simulations. Our results show that, in scenarios with significant interference, the best throughput-delay tradeoff is achieved by single path forwarding. Moreover, when significant interference is present and network coding employs the larger packet generation size, it experiences higher delay than the other schemes. This is due to the inter-arrival times aggregating over all coded packets required to decode a packet generation. (C) 2015 Elsevier B.V. All rights reserved.

Funding Agencies|HERACLEITUS II - University of Crete

show abstract

Section: Introductionmentioning

confidence: 99%

On the performance of network coding and forwarding schemes with different degrees of redundancy for wireless mesh networks

Ploumidis

Παππάς

Siris

et al. 2015

Computer Communications

View full text Add to dashboard Cite

Funding Agencies|HERACLEITUS II - University of Crete

show abstract

“…Therefore, a practical range for the density excludes the zero case, 0 < d ≤ 1. Furthermore, in GF(2), there is no benefit of using d > 0.5 in terms of generating linearly-independent packets [28]. Thus, we limit the range to 0 < d ≤ 0.5 in GF (2).…”

Section: Methods 1: Fixing the Coding Densitymentioning

confidence: 99%

“…Furthermore, we have specified a dependency on the field size for practical density values. In the case of employing GF(2), the maximum plausible density is restricted up to 0.5, since higher values incur in more frequent linearly-dependent coded packets [28] accompanied by higher coding complexity.…”

Section: Methods 1: Fixing the Coding Densitymentioning

confidence: 99%

On Goodput and Energy Measurements of Network Coding Schemes in the Raspberry Pi

et al. 2016

View full text Add to dashboard Cite

Abstract:Given that next generation networks are expected to be populated by a large number of devices, there is a need for quick deployment and evaluation of alternative mechanisms to cope with the possible generated traffic in large-scale distributed data networks. In this sense, the Raspberry Pi has been a popular network node choice due to its reduced size, processing capabilities, low cost and its support by widely-used operating systems. For information transport, network coding is a new paradigm for fast and reliable data processing in networking and storage systems, which overcomes various limitations of state-of-the-art routing techniques. Therefore, in this work, we provide an in-depth performance evaluation of Random Linear Network Coding (RLNC)-based schemes for the Raspberry Pi Models 1 and 2, by showing the processing speed of the encoding and decoding operations and the corresponding energy consumption. Our results show that, in several scenarios, processing speeds of more than 80 Mbps in the Raspberry Pi Model 1 and 800 Mbps in the Raspberry Pi Model 2 are attainable. Moreover, we show that the processing energy per bit for network coding is below 1 nJ or even an order of magnitude less in these scenarios.

show abstract

“…Network coding is no exception and its transition to the real world has been a major topic of study. As an example, in [29] we can find a discussion on practical settings where network coding may be more or less suitable, and common implementation aspects that are usually not accounted for in theory but which influence the performance in practice. Besides showing potential use cases for network coding, it is becoming more important to showcase its benefits in practice.…”

Section: File Transfer In Androidmentioning

confidence: 99%

“…The design of coding systems is also influenced by the existence of transmission delays [29]. When the Round Trip Delay (RTD) is not negligible when compared to the transmission time of one generation, keeping only one generation active is not the best approach to achieve good throughput performance.…”

Section: B Coding In Practicementioning

confidence: 99%

Coded Schemes for Asymmetric Wireless Interfaces: Theory and Practice

Moreira

Lucani

2015

IEEE J. Select. Areas Commun.

Self Cite

View full text Add to dashboard Cite

A fundamental understanding of the delay and throughput benefits of network coding over multiple heterogeneous half-duplex communication interfaces is critical to fully exploit current and future devices that incorporate multiple communication technologies. The goal of this paper is twofold. First, to present fundamental limits and several strategies to tradeoff data and feedback when using multiple interfaces. Our work sets forth a systematic approach to i) analyze a variety of schemes in the presence of channels with heterogeneous round-trip delays, packet transmission rates, and packet loss probability, and to ii) determine the optimal number of transmissions to be allocated to each channel based on these characteristics. Our analytical results show that the gains over a variety of uncoded approaches can be several fold and that our proposed strategies are within 1 dB to an optimal system with full duplex interfaces over a wide range of operating conditions. Our second goal is to understand the practical implications of these results by designing a protocol for file transmissions, implement it in Android smart phones, and measure its performance when combining various interfaces, including, Bluetooth, WiFi, and 3G cellular networks. Our measurements show that throughput is increased not only by the aggregation of multiple interfaces but also by providing a much more robust erasure correction mechanism.

show abstract

Network coding designs suited for the real world: What works, what doesn't, what's promising

Cited by 16 publications

References 15 publications

On the performance of network coding and forwarding schemes with different degrees of redundancy for wireless mesh networks

On the performance of network coding and forwarding schemes with different degrees of redundancy for wireless mesh networks

On Goodput and Energy Measurements of Network Coding Schemes in the Raspberry Pi

Coded Schemes for Asymmetric Wireless Interfaces: Theory and Practice

Contact Info

Product

Resources

About