Article thumbnail
Location of Repository

Efficiency/friendliness tradeoffs in tcp westwood

By Ren Wang, Massimo Valla, M. Y. Sanadidi, Bryan Kwok, Fai Ng and Mario Gerla


In this paper, we propose a refinement of TCP Westwood allowing the 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. In this paper 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 best 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. 1

Year: 2002
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.