Content-access QoS in peer-to-peer networks using a fast MDS erasure code

Dairaine, Laurent; Lacan, Jérôme; Lancérica, Laurent; Fimes, Jérôme

doi:10.1016/j.comcom.2004.12.023

Cited by 13 publications

(11 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Indeed, any [n, k] MDS code with block length n and k symbols of information can be successfully recovered from any subset of its entries of length k or more. This property makes MDS codes favorable FEC schemes over the erasure channels like the Internet [10], [11].…”

Section: Introductionmentioning

confidence: 99%

Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation

Fashandi

Gharan

Khandani

2007

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

Abstract-Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correction (FEC) is applied across multiple independent paths to enhance the end-to-end reliability. Internet paths are modeled as erasure Gilbert-Elliot channels [1], [2]. First, it is shown that over any erasure channel, Maximum Distance Separable (MDS) codes achieve the minimum probability of irrecoverable loss among all block codes of the same size. Then, we prove the probability of irrecoverable loss decays exponentially for the asymptotically large number of paths. Moreover, it is shown that in the optimal rate allocation, each path is assigned a positive rate iff its quality is above a certain threshold. The quality of a path is defined as the percentage of the time it spends in the bad state. Finally, using dynamic programming, a heuristic suboptimal algorithm with polynomial runtime is proposed for rate allocation over the available paths. This algorithm converges to the asymptotically optimal rate allocation when the number of paths is large. The simulation results show that the proposed algorithm approximates the optimal rate allocation very closely, and provides significant performance improvement compared to the alternative schemes of rate allocation.

show abstract

Section: Introductionmentioning

confidence: 99%

Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation

Fashandi

Gharan

Khandani

2007

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

show abstract

“…2, the average size of the Tetrys encoding window is 521.6 bundles. Following [13] and the encoding window size, we would have been able to achieve a maximum bit rate of 210KB/s on a PIII 933 Mhz, twice the bit rate assumed in our settings. Depending on the trade-off between the complexity and the cost of the feedback mechanism, we can adapt the latter (active/passive/bridged) [5] since the smaller the feedback delay, the smaller the complexity.…”

Section: O(mentioning

confidence: 99%

Robust Streaming in Delay Tolerant Networks

Tournoux

Lochin

Leguay

et al. 2010

2010 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-Delay Tolerant Networks (DTN) do not provide any end to end connectivity guarantee. Thus, transporting data over such networks is a tough challenge as most of Internet applications assume a form of persistent end to end connection. While research in DTN has mainly addressed the problem of routing in various mobility contexts with the aim to improve bundle delay delivery and data delivery ratio, little attention has been paid to applications. This paper investigates the support of streaming-like applications over DTN. We identify how DTN characteristics impact on the overall performances of these applications and present Tetrys, a transport layer mechanism, which enables robust streaming over DTN. Tetrys is based on an on the fly coding mechanism able to ensure full reliability without retransmission and fast in-order bundle delivery in comparison to classical erasure coding schemes. We evaluate our Tetrys prototype on real DTN connectivity traces captured from the Rollerblading tour in Paris. Simulations show that on average, Tetrys clearly outperforms all other reliability schemes in terms of bundles delivery service.

show abstract

“…Indeed, any [N, K] MDS code can be successfully decoded from any subset of its coded symbols of size K or more. This property makes MDS codes suitable for use over the erasure channels like the Internet [1], [2], [10]. However, the practical encoding-decoding algorithms for such codes have quadratic time complexity in terms of the code block length [11].…”

Section: Introductionmentioning

confidence: 99%

“…Different erasure channel models are adopted to study the performance of end-to-end connections over the Internet [1], [2]. In such models, each packet is seen as a q = 2 b -ary symbol where b is the packet length in bits.…”

Section: Introductionmentioning

confidence: 99%

Coding over an erasure channel with a large alphabet size

Fashandi

Gharan

Khandani

2008

2008 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Assuming a memoryless erasure channel, the error exponent of MDS codes are compared with that of random codes. It is shown that the envelopes of these two exponents are identical for rates above the critical rate. Noting the optimality of MDS codes, it is concluded that random coding is exponentially optimal as long as the block size N satisfies N < q + 1.

show abstract

Content-access QoS in peer-to-peer networks using a fast MDS erasure code

Cited by 13 publications

References 18 publications

Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation

Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation

Robust Streaming in Delay Tolerant Networks

Coding over an erasure channel with a large alphabet size

Contact Info

Product

Resources

About