Reliable broadband communication using a burst erasure correcting code

McAuley, A.

doi:10.1145/99508.99566

Cited by 190 publications

(52 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The Stutter XOR scheme [24] is an example of a simple erasure code. More sophisticated codes have been applied to packet switched networks [43,29,39].…”

Section: Feedbackmentioning

confidence: 99%

Explicit transport error notification (ETEN) for error-prone wireless and satellite networks

Krishnan¹,

Sterbenz

Eddy

et al. 2004

Computer Networks

View full text Add to dashboard Cite

Wireless and satellite networks often have non-negligible packet corruption rates that can significantly degrade TCP performance. This is due to TCP's assumption that every packet loss is an indication of network congestion (causing TCP to reduce the transmission rate). This problem has received much attention in the literature. In this paper, we take a broad look at the problem of enhancing TCP performance under corruption losses, and include a discussion of the key issues. The main contributions of this paper are: ( ) a confirmation of previous studies that show the reduction of TCP performance in the face of corruption loss, and in addition a plausible upper bound achievable with perfect knowledge of the cause of loss, ( ) a classification of the potential mitigation space, and ( ) the introduction of a promising new mitigation that employs rich cumulative information from intermediate nodes in a path to form a better congestion response.We first illustrate the performance implications of corruption-based loss for a variety of networks via simulation. In addition, we show a rough upper bound on the performance gains a TCP could get if it could perfectly determine the cause of each segment loss -independent of any specific mechanism for TCP to learn the root cause of packet loss. Next, we provide a taxonomy of potential practical classes of mitigations that TCP end-points and intermediate network elements can cooperatively use to decrease the performance impact of corruption-based loss. Finally, we briefly consider a potential mitigation, called cumulative explicit transport error notification (CETEN), which covers a portion of the solution space previously unexplored. CETEN is shown to be a promising mitigation strategy, but a strategy with numerous formidable practical hurdles still to overcome.£ Pre-print: Accepted for publication in Elsevier Computer Networks.

show abstract

“…The Stutter XOR scheme [24] is an example of a simple erasure code. More sophisticated codes have been applied to packet switched networks [43,29,39].…”

Section: Feedbackmentioning

confidence: 99%

Explicit transport error notification (ETEN) for error-prone wireless and satellite networks

Krishnan¹,

Sterbenz

Eddy

et al. 2004

Computer Networks

View full text Add to dashboard Cite

show abstract

“…To deal with this, a new trend other than replication, includes the information dispersal algorithms [47,48]. By implementing erasure coding, these algorithms encode the data into multiple blocks among which only a portion is necessary to recover the original data.…”

Section: B Istorementioning

confidence: 99%

ZHT: A Light-Weight Reliable Persistent Dynamic Scalable Zero-Hop Distributed Hash Table

Zhou

Brandstatter

et al. 2013

2013 IEEE 27th International Symposium on Parallel and Distributed Processing

114

View full text Add to dashboard Cite

Abstract-This paper presents ZHT, a zero-hop distributed hash table, which has been tuned for the requirements of high-end computing systems. ZHT aims to be a building block for future distributed systems, such as parallel and distributed file systems, distributed job management systems, and parallel programming systems. The goals of ZHT are delivering high availability, good fault tolerance, high throughput, and low latencies, at extreme scales of millions of nodes. ZHT has some important properties, such as being light-weight, dynamically allowing nodes join and leave, fault tolerant through replication, persistent, scalable, and supporting unconventional operations such as append (providing lock-free concurrent key/value modifications) in addition to insert/lookup/remove. We have evaluated ZHT's performance under a variety of systems, ranging from a Linux cluster with 512-cores, to an IBM Blue Gene/P supercomputer with 160K-cores. Using micro-benchmarks, we scaled ZHT up to 32K-cores with latencies of only 1.1ms and 18M operations/sec throughput. This work provides three real systems that have integrated with ZHT, and evaluate them at modest scales. 1) ZHT was used in the FusionFS distributed file system to deliver distributed meta-data management at over 60K operations (e.g. file create) per second at 2K-core scales. 2) ZHT was used in the IStore, an information dispersal algorithm enabled distributed object storage system, to manage chunk locations, delivering more than 500 chunks/sec at 32-nodes scales. 3) ZHT was also used as a building block to MATRIX, a distributed job scheduling system, delivering 5000 jobs/sec throughputs at 2K-core scales. We compared ZHT against other distributed hash tables and key/value stores and found it offers superior performance for the features and portability it supports.

show abstract

“…• Quasi-reliable connection mode (Figure 9) eliminates ACKs and ARQ entirely, using only open-loop error recovery mechanisms such as erasure coding, across multiple paths if available [22]. In this mode the strength of the coding can be tuned using cross-layer optimizations based on the quality of the wireless channel being traversed, available bandwidth, and the sensitivity of the data to loss.…”

Section: Error Control and Qos-based Transfer Modesmentioning

confidence: 99%

Opportunistic transport for disrupted airborne networks

Rohrer

Pathapati

Nguyen

et al. 2012

MILCOM 2012 - 2012 IEEE Military Communications Conference

View full text Add to dashboard Cite

Abstract-Due to the challenging network conditions posed by a highly-dynamic airborne telemetry environment, it is essential for the transport protocol to provide automated mechanisms that dynamically adapt to changing end-to-end performance on any path. The AeroTP multi-mode transport protocol provides service tailored to the requirements of the telemetry mission control and data packets, achieving better performance compared to the traditional TCP and UDP. We use ns-3 to simulate the AeroTP protocol's reliable and quasi-reliable modes and demonstrate the performance tradeoffs between the modes, as well as comparing their performance with TCP and UDP.

show abstract

Reliable broadband communication using a burst erasure correcting code

Cited by 190 publications

References 14 publications

Explicit transport error notification (ETEN) for error-prone wireless and satellite networks

Explicit transport error notification (ETEN) for error-prone wireless and satellite networks

ZHT: A Light-Weight Reliable Persistent Dynamic Scalable Zero-Hop Distributed Hash Table

Opportunistic transport for disrupted airborne networks

Contact Info

Product

Resources

About