Analysis of a transport protocol based on rateless erasure correcting codes

• Published in: 2010 IEEE International Conference on Intelligent Computer Communication and Processing pp. 465 - 471
• Main Authors: Botos, Anghel, Polgar, Zsolt A, Bota, Vasile
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.08.2010
• Subjects: congestion control; Electronic mail; erasure channel; Internet; linear random codes; Markov processes; Mathematical model; Protocols; rateless erasure codes; Steady-state; Throughput; transport protocol
• ISBN: 9781424482283; 1424482283
• DOI: 10.1109/ICCP.2010.5606396

This paper presents a protocol designed as an alternative to classical TCP for channels which experience high loss-rates. The protocol is simplified with respect to TCP by eliminating the need of retransmissions and the associated buffers. This is achieved by applying a rateless erasure correcting code to the data that is going to be transferred. A modified version of the TCP congestion control algorithms is used in order to better differentiate between losses caused by errors on the channel and losses caused by congestion in the network. A statistical model for the steady-state throughput of the protocol is included in the paper as well. Using simulations performed in ns-2 the throughput model is validated. Other aspects of the behavior of the protocol are also investigated. The results are promising, mainly showing that the protocol does not experience any significant performance degradation in terms of steady-state throughput, even if the loss rate on the channel is high.