Publications

Abstract : The key idea proposed in this paper is to determine the optimal congestion window for a TCP sender in a particular network scenario (that corresponds to the fair share of that connection) and keep this congestion window a constant to a point where the fair share in the network has changed considerably from the instance of the calculation of the size of the last window. At this point, the TCP congestion window is recalculated according to the nature of new scenario. The proposed mechanism is particularly effective over wireless links, which have an inherently loss-prone nature, as modified TCP’s congestion window being independent of packet losses (be it corruption losses or it congestion losses), keeps transmitting at the same rate at before. We test this scheme under a simulation setup and show that it is performing better than TCP Reno under wireless loss condition and at least at par under wired condition.