| Abstract: | Various version of Transmission Control Protocol (TCP) congestion window model are available in the literature. TCP congestion control is handled in two phases: (a) slow start and (b) congestion avoidance. This paper deals with congestion avoidance phase that is based on additive increase multiplicative decrease (AIMD) mechanism in which window size either increase by one or cuts to half of the previous window size. For distribution of window sizes, a model developed by Yan et al has been presented for two loss indications: (a) triple duplicate (TD) and (b) time‐outs (TOs) only while it does not deal with the window size limitation. It does not allow to cap over the TCP congestion window size if the buffer size is restricted to a fixed value though window size could not move beyond that. The unconstrained window size moves on in the presence of low loss probability. In this paper, we propose a model for the case where the window size is bounded by a maximum value that makes applicable to window size limitation as well. Further, the work has been extended to develop a new model that obtains a cumulative distribution function for TD periods (TDPs). The proposed model is validated on ns‐2, and we conclude that observed results for distribution function are very closed to our proposed model. |
