Abstract
This paper proposes a new unicast TCP-Friendly protocol called RAAR-MT, which on-line predicts the tendency of traffic level in the near future and use this predicted information to exert multiple time scale traffic control at receivers. Simulation shows that this protocol can improve the performance in loss rate on self-similar traffic network. Even in traditional short-range dependent environment, the performance will not degrade severely. Compared with TFRC, RAAR-MT has better performance in TCP-Friendliness, intraprotocol fairness and smoothness. RAAR-MT is also a promising avenue of development for congestion control of multicast multimedia traffic since it is not a per-packet acknowledgement and is mainly implemented at receivers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y. R. Yang, Min S. Kim, and Simon S. Lam. “Transient Behaviors of TCP-Friendly Congestion Control Protocols,” Networking Research Laboratory, Department of Computer Sciences, The University of Texas at Austin, Technical ReportTR-2000-14July2000.
S. Floyd, K. Fall. “Promoting the Use of End-to-End Congestion Control,” IEEE/ACM Transactions on Networking, August 1999.
I. Rhee, V. Ozdemir, Y. Yi, “TEAR: TCP Emulation at Receivers-Flow Control for Multimedia Streaming,” Technical report, North Carolina State University, April 2000.
R. Rejaie, M. Handley, and D. Estrin, “RAP: An End-to-end Rate-based Congestion Control Mechanism for Realtime Streams in the Internet.” Technical Report 98-686, CS-USC, November 1998.
Y. Hu, “Study of Multimedia Traffic Transport Congestion Control Protocol in the Internet,” Ph.D. Thesis, SUN YAT-SEN University, PR.China, October 2001.
S. Floyd, M. Handley, J. Padhye, and J. Widmer, “Equation-Based Congestion Control for Unicast Applications,” Proceedings of SIGCOMM 2000, August 2000
K. Park, W. Willinger. “Self-similar Network Traffic: An Overview” Self-Similar Network Traffic and Performance Evaluation (ed.), Wiley-Interscience, 2000.
K. Park and T. Tuan, “Performance Evaluation of Multiple Time Scale TCP under Selfsimilar Traffic Conditions”, ACM Transactions on Modeling and Computer Simulation, 2000
T. Tuan and K. Park, “Multiple time scale congestion control for self-similar network traffic”, Performance Evaluation, 1999, 36,359–386.
Y. R. Yang and S. S. Lam, “General AIMD Congestion Control,” In Proceedings ICNP 2000, Osaka, Japan, November 2000.
UC Berkeley, LBL, USC/ISI, and Xerox PARC, The ns Manual (formerly ns Notes and Documentation), March 2001.
W. Willinger, V. Paxson and M. S. Taqqu. “Self-Similary and Heavy Tails: Structural Modeling of Network Traffic,”, appears on pages 27–53 in the book: “A Practical Guide To Heavy Tails: Statistical Techniques and Applications.”, Birkhauser, Boston, 1998
M. Handley, J. Pahdye, S. Floyd, and J. Widmer, “TCP Friendly Rate Control (TFRC): Protocol Specification,” Internet draft draft-ietf-tsvwg-tfrc-04.txt, April 2002.
J. Widmer. “Equation-Based Congestion Control,” Diploma Thesis, February 2000.
J. Padhye. “Towards A Comprehensive Congestion Control Framework for Continuous Media Flows in Best Effort Networks,” Ph.D. Thesis, University of Massachusetts Amherst, March 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, Y., Hu, Y., Zhang, G. (2002). TCP-Friendly Congestion Control Algorithm on Self-Similar Traffic Network. In: Chen, YC., Chang, LW., Hsu, CT. (eds) Advances in Multimedia Information Processing — PCM 2002. PCM 2002. Lecture Notes in Computer Science, vol 2532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36228-2_110
Download citation
DOI: https://doi.org/10.1007/3-540-36228-2_110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00262-8
Online ISBN: 978-3-540-36228-9
eBook Packages: Springer Book Archive