Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
CYRF: a theory of window-based unicast congestion control
IEEE/ACM Transactions on Networking (TON)
Switched and Impulsive Systems: Analysis, Design and Applications (Lecture Notes in Control and Information Sciences)
MRF: a framework for source and destination based bandwidth differentiation service
IEEE/ACM Transactions on Networking (TON)
Incentive-compatible adaptation of Internet real-time multimedia
IEEE Journal on Selected Areas in Communications
A unified architecture for real-time video-coding systems
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.01 |
The convergence of response functions of memoryless window-based congestion control protocols is analyzed in this paper. All the control schemes (or response functions) is classified into 4 types according to the monotony of their response functions. Sufficient conditions are established for the convergence of Type 1 scheme, which includes most of the existing protocols such as additive-increase multiplicative-decrease (AIMD), generalized AIMD, binomial congestion control (BCC), Choose Your Response Function (CYRF) and so on. Type 4 scheme is not convergent while Type 2 and Type 3 schemes are conditional convergent, and their convergent conditions are derived. Furthermore, the proposed scheme can be made TCP-friendly and TCP-compatible. The proposed scheme can also be used to design multimedia friendly congestion control protocols. Thus the proposed result is very useful for extending the network service to different applications.