Abstract
The TCP-style AIMD congestion control principle can’t meet the need of the upcoming multimedia applications. They demand smooth adjustment and congestion aware, thus recently many works design TCPfriendly congestion control algorithms. In this paper, we focus on understanding one class of TCP-friendly congestion control algorithms, adjustment-based congestion control, which adjust transmission rate when loss is detected and can generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current window (for TCP, k=0) and generalize TCP-style multiplicative-decrease by decreasing proportional to a power l of the current window (for TCP, l=1). We discuss their global fairness and stability. We prove that such class of congestion control algorithms can achieve (p, k+l+1)- proportional fairness globally no matter the network topology is and how many users there are. We also study their dynamical behaviors through a control theoretical approach. The smoothness of the congestion control will result in a less stable system and slower convergence to the fair bandwidth allocation. The modeling and discussions in this paper are quite general and can be easily applied to equation-based TCP-friendly congestion control scheme, another category of TCP-friendly transport protocols.
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
V. Jacobson, “Congestion Avoidance and Control,” in Proc. ACM SIGCOMM, August 1988, pp. 314–329
D-M. Chiu and R. Jain, “Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks,” Computer Networks and ISDN Systems, vol. 17, pp. 1–14, 1989.
B. Braden, D. Clark, J. Crowcroft, B. Davie, S. Deering, D. Estrin, S. Floyd, V. Jacobson, G. Minshall, C. Patridge, K. Ramakrishnan, S. Shenker, J. Wroclawski, and L. Zhang, “Recommendations on Queue Management and Congestion Avoidance in the Internet,” Internet Engineering Task Force, April 1998, RFC 2309.
S. Floyd and K. Fall, “Promoting the Use of End-to-End Congestion Control in the Internet,” IEEE/ACM Transactions on Networking, vol.7, No.4, August 1999.
J. Padhye, J. Kurose, D. Towsley, and R. Koodi, “A Model Based TCP-Friendly Rate Control Protocol,” Proc NOSSDAV’99, 1999.
S. Floyd, M. Handley, J. Padhye, and J. Widmer, “Equation-based Congestion Control for Unicast Applications,” Proc ACM SIGCOMM 2000, August 2000.
Injong Rhee, Volkan Ozdemir, and Yung Yi, “TEAR: TCP emulation at receivers — flow control for multimedia streaming,” Technical Report, Department of Computer Science, NCSU.
R. Rejaie, Mark Handley and D. Estrin, “RAP: An End-to-End Rate-based Congestion Control Mechanism for Realtime Streams in the Internet,” Proc IEEE Infocom’99, pp. 1337–1345
D. Sisalem and H. Schulzrinne, “The Loss-Delay based Adjustment Algorithm: A TCPFriendly Adaptation Scheme,” Proc NOSSDAV’98, July 1998.
Y. R. Yang and S. S. Lam, “General AIMD Congestion Control,” Proc ICNP’2000, Japan, Nov. 2000.
Deepak Bansal and Hari Balakrishnan, “Binomial Congestion Control Algorithms,” Proc IEEE INFOCOM’2001, April 2001.
J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, “Modeling TCP throughput: A Simple Model and its Expirical Validation,” Proc ACM SIGCOMM’98, Vancouver, Canada, 1998.
Sridhar Ramesh and Injong Rhee, “Issues on Equation-based Flow Control”, http://www.csc.ncsu.edu/faculty/rhee/export/tear_page/tcl_model.pdf.
F. P. Kelly, “Charging and Rate Control for Elastic Traffic,” Euro. Trans. Telecommun., vol.8, pp. 33–37, 1997.
F. P. Kelly, A. Maulloo, and D. Tan, “Rate Control for Communication Networks: Shadow prices, Proportional Fairness and stability
Steven H. Low and David E. Lapsley, “Optimization Flow Control —I: Basic Algorithm and Convergence,” IEEE/ACM Transactions on Networking, vol. 7, no. 6, Dec 1999.
J. Mo and J. Walrand, “Fair End-to-End Window-Based Congestion Control,” IEEE/ACM Transactions on Networking, vol.8, no. 5, Oct 2000.
L. Massoulie and J. Roberts, “Bandwidth Sharing: Objectives and Algorithms,” Proc IEEE INFOCOM’99.
S. Floyd and V. Jacobson, “Random Early Detection Gateways for Congestion Avoidence”, IEEE/ACM Transactions on Networking, vol. 1, no. 4, August 1993, pp. 397–413.
Vishal Misra, Wei-Bo Gong and Don Towsley, “Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED”, ACM SIGCOMM 2000.
C.V. Hollot, Vishal Misra, Don Towsley and Wei-Bo Gong, “A Control Theoretic Analysis of RED”, in Proceedings of IEEE INFOCOM’2001, April 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, W., Ren, Y., Shan, X. (2001). An Analytical Study on TCP-friendly Congestion Control for Multimedia Streams. In: van Sinderen, M.J., Nieuwenhuis, L.J.M. (eds) Protocols for Multimedia Systems. PROMS 2001. Lecture Notes in Computer Science, vol 2213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45481-0_15
Download citation
DOI: https://doi.org/10.1007/3-540-45481-0_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42708-7
Online ISBN: 978-3-540-45481-6
eBook Packages: Springer Book Archive