J. Gemmell. ECRSM - Erasure Correcting Scalable Reliable Multicast. Microsoft Research Technical Report MS-TR-97-20, June 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... scalability of the sender and the network is of paramount importance, feedback to the sender needs to be limited and sending packets that are redundant for some receivers is wasteful, reliability may be able to be provided using erasure codes as described in [21] 28] 26] 27] 22] 23] [9] [7] 6] The attractiveness of this approach is that if the erasure codes are powerful enough then a single sender can potentially be used to reliably deliver data efficiently to a large number of concurrent receivers without feedback. The one to many problem is even more difficult when ....

J. Gemmell. ECRSM - Erasure Correcting Scalable Reliable Multicast. Microsoft Research Technical Report MS-TR-97-20, June 1997.

....Institute, Berkeley, California. Research supported in part by National Science Foundation operating grant NCR 9416101. The problems with solutions based on retransmission have led many researchers to consider applying Forward Error Correction based on erasure codes 1 to reliable multicast [4, 12, 13, 14, 16, 17, 18, 19]. The basic principle behind the use of erasure codes is that the original source data, in the form of a sequence of k packets, along with additional redundant packets, are transmitted by the sender, and the redundant data can be used to recover lost source data at the receivers. A receiver can ....

....1. 5.2 Practice In practice, Tornado codes where values of k and # are on the order of tens of thousands can be encoded and decoded in just a few seconds. In this section, we compare the efficiency of Tornado codes with standard codes that have been previously proposed for network applications [4, 14, 16, 17, 18, 19]. The erasure codes listed in Tables 2 and 3 as Vandermonde [16] and Cauchy [2] are standard implementations of Reed Solomon erasure codes, based on Vandermonde matrices and Cauchy matrices, respectively. Both Tornado A and Tornado A, 10,000 Runs Percent Unfinished vs. Length Overhead 0 20 40 60 ....

J. Gemmell, "ECRSM -- Erasure Correcting Scalable Reliable Multicast," Microsoft Research Technical Report MS-TR-97-20, June 1997.

....on satellite networks, where the back channel typically has high latency and limited capacity, if it is available at all. The problems with solutions based on retransmission have led many researchers to consider applying Forward Error Correction based on erasure codes 1 to reliable multicast [6, 17, 18, 20, 22, 23, 24, 25]. The basic principle behind the use of erasure codes is that the original source data, in the form of a sequence of k packets, along with additional redundant packets, are transmitted by the sender, and the redundant data can be used to recover lost source data at the receivers. A receiver can ....

....5.3 Performance In practice, Tornado codes where values of k and are on the order of tens of thousands can be encoded and decoded in just a few seconds. In this section, we compare the efficiency of Tornado codes with standard codes that have been previously proposed for network applications [6, 20, 22, 23, 24, 25]. The erasure code listed in Tables 2 and 3 as Cauchy [4] is a standard implementations of Reed Solomon erasure codes based on Cauchy matrices. We note that the Cauchy implementation, available at [8] is faster than the widely cited, publicly available implementation of Reed Solomon codes based ....

J. Gemmell, "ECRSM -- Erasure Correcting Scalable Reliable Multicast," Microsoft Research Technical Report MS-TR-97-20, June 1997.

....on satellite networks, where the back channel typically has high latency and limited capacity, if it is available at all. The problems with solutions based on retransmission have led many researchers to consider applying Forward Error Correction based on erasure codes 1 to reliable multicast [4, 12, 13, 14, 16, 17, 18, 19]. The basic principle behind the use of erasure codes is that the original source data, in the form of a sequence of k packets, along with additional redundant packets, are transmitted by the sender, and the redundant data can be used to recover lost source data at the receivers. A receiver can ....

....0.40 seconds 2.00 seconds 8 MB not available 3166 seconds 0.87 seconds 2.90 seconds 16 MB not available 13629 seconds 1.75 seconds 4.70 seconds Table 3: Comparison of decoding times for erasure codes. Tornado codes with standard codes that have been previously proposed for network applications [4, 14, 16, 17, 18, 19]. The erasure codes listed in Tables 2 and 3 as Vandermonde [16] and Cauchy [2] are standard implementations of Reed Solomon erasure codes, based on Vandermonde matrices and Cauchy matrices, respectively. Both Tornado A and Tornado B codes were designed using some of the principles described in ....

J. Gemmell, "ECRSM -- Erasure Correcting Scalable Reliable Multicast," Microsoft Research Technical Report MS-TR-97-20, June 1997.

....for example, use a form of codes based on polynomial arithmetic in a finite field to guard against losses and errors in transmission. Error correcting codes are also becoming popular for guarding against packet loss in Internet traffic, where the technique is known as forward error correction [19]. The source channel framework has also found application in settings seemingly unrelated to communication. For instance, the now standard approach to automatic speech recognition views the problem of transcribing a human utterance from a source channel perspective [2] In this case, the source ....

J. Gemmell. ECRSM -- erasure correcting scalable reliable multicast. Technical report, Microsoft (TR 97-20), 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC