Approximately optimal assignment for unequal loss protection

This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework. It first finds the optimal assignment under convex hull and fractional bit allocation assumptions. It then relaxes those constraints to find an assignment that approximates the global optimum. The algorithm has a running time of O(hNlogN) where h is the number of points on the convex hull of the source's utility-cost curve and N is the number of packets transmitted.

[1]  Richard E. Ladner,et al.  Graceful degradation over packet erasure channels through forward error correction , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[2]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[3]  Ray A. Jarvis,et al.  On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..

[4]  K. Ramchandran,et al.  Multiple description source coding using forward error correction codes , 1999, Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020).

[5]  Stefan Savage,et al.  Sting: A TCP-based Network Measurement Tool , 1999, USENIX Symposium on Internet Technologies and Systems.

[6]  Luigi Rizzo,et al.  Effective erasure codes for reliable computer communication protocols , 1997, CCRV.

[7]  Sally Floyd,et al.  Why we don't know how to simulate the Internet , 1997, WSC '97.

[8]  David G. Kirkpatrick,et al.  The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..

[9]  Madhu Sudan,et al.  Priority encoding transmission , 1996, IEEE Trans. Inf. Theory.