TCP-WBQ: a backlog-queue-based congestion control mechanism for heterogeneous wireless networks

Abstract

AbstractIn heterogeneous wireless networks, random packet loss and high latency lead to conventional TCP variants performing unsatisfactorily in the case of competing communications. Especially on high-latency wireless links, conventional TCP variants are unable to estimate congestion degrees accurately for fine-grained congestion control because of the effects of random packet loss and delay oscillations. This paper proposes a TCP variant at the sender side to identify congestion degrees, namely TCP-WBQ, which quickly responses to the real congestion and effectively shields against random packet loss and oscillations of latency time. The proposed algorithm of congestion control firstly constructs a backlog-queue model based on the dynamics of the congestion window, and deduces the two bounds of the model which delimit oscillations of the backlog queue for non-congestion and random packet loss respectively. TCP-WBQ detects congestion degrees more accurately and thus implements the corresponding schemes of adjusting the congestion window, maintaining a tradeoff between high throughputs and congestion avoidance. The comprehensive simulations show that TCP-WBQ works efficiently in bandwidth utilization with single and multiple bottleneck scenarios, and achieves high performance and competitive fairness in heterogeneous wireless networks.