Abstract
This paper describes the design of a new rate and congestion controller (RCR) which employs FEC (forward error correction) support. The design follows the design principles of TCP but uses FEC to assure TCP-competitiveness. It is targeted primarily at one to many reliable bulk multicast data transfer. It shares bandwidth with other TCP flows fairly and is able to compensate drawbacks due to low responsiveness. The concept of RCR is validated by analytical and simulation results. The heuristic analysis is based on a new extended model for flows which implement a congestion control algorithm similar to TCP. Simulations and theoretical analysis for multicast as well as unicast setups show that already a very moderate level (some %) of redundancy suffices to strengthen a flow suffering from long delays and high loss probabilities.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brockners F. Bulk Multicast Data Transfer — towards the Integration of FEC and ARQ using a Lightweight Feedback Control Tree. Univ. of Cologne, ZPR, Tech.Rep. 97–279, July 1997.
Donar B.D. A Better Model for Gernerating Test Networks. In Proceedings of IEEE Global Telecommunications Conference GLOBECOM 96, London, November 1996.
Floyd S. Connections with Multiple Congested Gateways in Packet-Switched Networks, Part 1: One-way Traffic. Computer Communications Review, 21(5), October 1991.
Floyd S., Fall K. Promoting the Use of End-to-End Congestion Control in the Internet. Submitted to IEEE/ACM Transactions on Networking, February 1998.
Floyd S., Jacobson V., McCanne S., Liu C.G., Zhang L. A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing. In Proceedings of the ACM SIGCOMM Conference ’95, pages 342–356, October 1995.
Golestani S.J. Fundamental Observations on Multicast Congestion Control in the Internet, 1998.
Jacobson V. Congestion Avoidance and Control. Computer Communication Review, 18(4): 314–329, August 1988.
Mahdavi J., Floyd S. TCP-Friendly Unicast Rate-Based Flow Control. Technical note sent to the end2end-interest mailing list, January 1997.
Mathis M., Semke J., Mahdavi J., Ott T. The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm. Computer Communication Review, 27(3), July 1997.
Montgomery T. A Loss Tolerant Rate Controller for Reliable Multicast. Technical report, West Virginia University, NASA-IVV-97–011, August 1997.
Nonnenmacher J., Biersack E., Towsley D. Parity-Based Loss Recovery for Reliable Multicast Transmission. InProceedings of ACM SIGCO’97, Cannes, France, 1997.
NS-2: UCB/LBNL Network Simulator ns version 2. http://www-mash.cs.berkeley.edu/ns.
Paul S., Sabnani K., Lin J., Bhattacharyya S. Reliable Multicast Protocol (RMTP). IEEE Journal on Selected Areas in Communication, 15(3): 407–421, April 1997.
Paxson V., Floyd S. Wide-Area Traffic: The Failure of Poisson Modeling. ACM Computer Communication Review, 24(4), October 1994. SIGCOMM ’94 Symposium.
Rejaie R., Handley M., Estrin D. RAP: An End-to-end Rate-based Congestion Control Mechanism for Realtime Streams in the Internet. In Proceedings of IEEE Infocom, 1999.
Rizzo L. Effective Erasure Codes for Reliable Computer Communication Protocols. In Computer Communications Review, April 1997.
Vicisano L., Crowcroft J., Rizzo L. TCP-like congestion control for layered multicast data transfer. In Proceedings of IEEE Infocom ’98, San Francisco, USA, March 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brockners, F. (1999). The Case for FEC Fueled TCP-like Congestion Control. In: Steinmetz, R. (eds) Kommunikation in Verteilten Systemen (KiVS). Informatik Aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60111-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-60111-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65597-8
Online ISBN: 978-3-642-60111-8
eBook Packages: Springer Book Archive