Network Coding as a WiMAX Link Reliability Mechanism: An Experimental Demonstration

Teerapittayanon, Surat; Fouli, Kerim; Médard, Muriel; Montpetit, Marie José; Shi, Xiaomeng; Seskar, Ivan; Gosain, Anjana

doi:10.1007/978-3-642-34976-8_7

Cited by 6 publications

(4 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The interaction between congestion control and the low delay code, as well as its performance when TCP is used, is also of interest. Finally, we believe, based on work done by [31], that this code construction can help improve network performance by removing or replacing complex lower layer reliability schemes such as hybrid ARQ (H-ARQ).…”

Section: Discussionmentioning

confidence: 99%

FEC for Lower In-Order Delivery Delay in Packet Networks

Karzand¹,

Leith²,

Cloud³

et al. 2015

Preprint

View full text Add to dashboard Cite

We consider use of Forward Error Correction (FEC) to reduce the in-order delivery delay over packet erasure channels. We propose a class of streaming codes that is capacity achieving and provides a superior throughput-delay trade-off compared to block codes by introducing flexibility in where and when redundancy is placed. This flexibility results in significantly lower in-order delay for a given throughput for a wide range of network scenarios. Furthermore, a major contribution of this paper is the combination of queuing and coding theory to analyze the code's performance. Finally, we present simulation and experimental results illustrating the code's benefits.

show abstract

Section: Discussionmentioning

confidence: 99%

FEC for Lower In-Order Delivery Delay in Packet Networks

Karzand¹,

Leith²,

Cloud³

et al. 2015

Preprint

View full text Add to dashboard Cite

show abstract

“…However, decreasing the underlying packet erasure rates may still drastically improve upper layer quality of service. Recent work in this area has shown that network coding is one tool that can help improve performance [9,10]. This section will compare both the generation-based and sliding-window coding schemes with respect to the upper-layer packet erasure probabilities and the expected in-order delivery delays.…”

Section: Unreliable Data Stream Performancementioning

confidence: 99%

Network Coding over SATCOM: Lessons Learned

Cloud

Médard

2015

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

Self Cite

View full text Add to dashboard Cite

Summary. Satellite networks provide unique challenges that can restrict users' quality of service. For example, high packet erasure rates and large latencies can cause significant disruptions to applications such as video streaming or voice-over-IP. Network coding is one promising technique that has been shown to help improve performance, especially in these environments. However, implementing any form of network code can be challenging. This paper will use an example of a generationbased network code and a sliding-window network code to help highlight the benefits and drawbacks of using one over the other. In-order packet delivery delay, as well as network efficiency, will be used as metrics to help differentiate between the two approaches. Furthermore, lessoned learned during the course of our research will be provided in an attempt to help the reader understand when and where network coding provides its benefits.

show abstract

“…Similar application to WiMAX (Worldwide Interoperability for Microwave Access) was studied in [24] and [25]. The trade-off between physical layer error correction coding and network layer erasure coding on fading channels was studied in [2] and [5].…”

Section: Network Codingmentioning

confidence: 99%

Benefits of Opportunistic Routing, Implicit Acknowledgments, and Network Coding on a Linear Broadcast Network

Whisman¹,

Médard

Kusuma

et al. 2016

2016 IEEE Globecom Workshops (GC Wkshps)

View full text Add to dashboard Cite

This thesis studies the benefits of using opportunistic routing, implicit acknowledgments, and network coding on a linear broadcast packet network. Nodes are arranged in a line, and the first node wishes to communicate with the end node. When node i transmits, it is received at node j with a probability P i,j . Several communication protocols are proposed and their performance studied using the mean and variance of the completion time as metrics. The protocols studied use end-to-end retransmission, end-to-end coding, and link-by-link retransmission with network coding both with and without opportunistic routing. Simulation and analytical results are presented.End-to-end coding significantly outperforms end-to-end retransmission on both metrics, and the link-by-link protocols outperform both. Opportunistic routing shows a mixed benefit over link-by-link protocols without it. When using opportunistic routing, the variance of the completion time is higher, and the mean is either similar or lower, depending on the channel conditions. When the loss probabilities are higher, opportunistic routing shows little benefit, whereas with a lower probability of packet loss, opportunistic routing shows a significant reduction in mean completion time.

show abstract

Network Coding as a WiMAX Link Reliability Mechanism: An Experimental Demonstration

Cited by 6 publications

References 1 publication

FEC for Lower In-Order Delivery Delay in Packet Networks

FEC for Lower In-Order Delivery Delay in Packet Networks

Network Coding over SATCOM: Lessons Learned

Benefits of Opportunistic Routing, Implicit Acknowledgments, and Network Coding on a Linear Broadcast Network

Contact Info

Product

Resources

About