Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Improving TCP/IP performance over wireless networks
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
WTCP: a reliable transport protocol for wireless wide-area networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Improving TCP performance over wireless networks at the link layer
Mobile Networks and Applications
TCP westwood: end-to-end congestion control for wired/wireless networks
Wireless Networks
Efficiency/Friendliness Tradeoffs in TCP Westwood
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
WTCP: An Efficient Mechanism for Improving TCP Performance over Wireless Links
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
I-TCP: indirect TCP for mobile hosts
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Sender-Based Heuristics for Distinguishing Congestion Losses from Wireless Transmission Losses
Sender-Based Heuristics for Distinguishing Congestion Losses from Wireless Transmission Losses
Hi-index | 0.24 |
This paper presents a new TCP (Transmission Control Protocol) variant called TCP Prairie which is a sender-only TCP modification based on dynamic bandwidth estimation in wired-cum-wireless networks. The key idea here is to continuously measure the bandwidth used by a TCP flow via monitoring the rate of returning acknowledgements (ACKs) and the round-trip time (RTT) values. The estimated bandwidth is then used to set the congestion window (cwnd) and the slow-start threshold (ssthresh) after a slowdown event (i.e. after three duplicate ACKs or after a timeout). The distinguishing feature of TCP Prairie (compared to other TCP variants such as TCP Westwood which also uses bandwidth estimation-based congestion control) is that it exploits the burstiness pattern of ACK arrivals and estimates the available bandwidth more accurately. For the proposed bandwidth estimation mechanism, the bandwidth sample is calculated by distributing a burst of ACKs over an off period based on degree of congestion and burstiness in the network. The estimation technique is robust against burstiness of ACK arrival and type of loss (e.g. wireless loss, congestion loss). Due to a more accurate bandwidth estimation, during congestion control the TCP Prairie sender sets the slow-start threshold to a value which is consistent with the available bandwidth for the corresponding TCP flow. Simulation results obtained using ns-2 reveal that TCP Prairie provides significant throughput performance improvement over TCP New-Reno and TCP Westwood under congestion and/or wireless loss scenarios. Also, compared to TCP Westwood, TCP Prairie is observed to be more friendly towards TCP New-Reno.