Analysis of monotonic responsive functions for congestion control

  • Authors:
  • C. Chen;Z. G. Li;Y. C. Soh

  • Affiliations:
  • Centre for Modeling and Control of Complex Systems, Nanyang Technological University, Singapore;Media Division, Institute for Infocomm Research, Singapore;Centre for Modeling and Control of Complex Systems, Nanyang Technological University, Singapore

  • Venue:
  • MMM'07 Proceedings of the 13th International conference on Multimedia Modeling - Volume Part II
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.