Efficiency/friendliness tradeoffs in TCP Westwood

Abstract

We propose a refinement of TCP Westwood which allows management of the efficiency/friendliness-to-NewReno tradeoff. We show that the refined TCP Westwood is able to achieve higher efficiency yet at the same time maintain friendliness. TCP Westwood (TCPW) implements a novel window congestion control algorithm based on available bandwidth estimation. The performance of TCPW has been promising, exceeding that of TCP NewReno in high speed and/or wired/wireless networks. However, under certain circumstances, TCP NewReno may experience some performance degradation because TCPW possesses more information and thus can take better advantage of available bandwidth. We propose combining the original TCPW sampling strategy that produces available bandwidth estimates (BE), with a new strategy that produces rate estimates (RE). Our studies show that RE works when packet losses are mostly due to congestion. If on the other hand, the packet losses are mostly due to link errors, BE gives better performance. To achieve the best of all worlds, we introduce a method we call combined rate and bandwidth estimation (CRB). A connection first infers the predominant cause of packet losses, and then uses the most appropriate estimation method. We also introduce the efficiency/friendliness tradeoff graph that provides better tradeoff visualization. In our experiments, we found that CRB provides a better compromise between efficiency and friendliness, and the means to manage such a tradeoff.