In the window based algorithm, a fair end to end congestion control scheme is developed with the help of internal node or router. Each user calculates congestion at the resources appearing in its route without using any explicit signal from the network router. It is hard to get prior information of network's feedback as networks are evolving over time. In this paper, congestion control formulation is considered as fair allocation which is a natural extension of the models proposed by Mo et al. [1]} and La et al. [2]} and a comparative study of these models are also provided. Mo et al. [1]} updated window size by considering propagation delay, queuing delay and using the difference between the actual and the target backlog. La et al. [2]} updated window size such that it converges to the unique stable point, where the resulting rates solve the system utility, \( SYSTEM (U, A, C) \) . As networks keep changing with time and evolving in nature so it is required to consider dynamic parameters in the window updating rules. The propagation delay is a function of the distance between two nodes and remains constant throughout the life of the networks. Hence, in place of propagation delays, we have considered transmission delay of the resources. The transmission delay is the amount of time required for the node to push out the packet and it is dependent on the transmission rate of the connecting link and the length of the packet. Once user's connection is established, packets are transferred to the receiver and number of packets is decreased at any resource with some rates. Hence, the transmission delay also decreases accordingly.
