TCP congestion control [9] is designed for network stability, robustness and opportunistic use of network bu er and bandwidth resources on an end-to-end per-connection basis. Upon detecting packet loss, TCP infers congestion and trades o per-user goodput for network stability. Speci cally, TCP throughput can be approximated by a function which isinversely proportional to the round trip time, the timeout delays and the square root of loss probability [16]. While the use of packet loss as an indicator of congestion is a robust technique, packet loss itself has a profound e ect on performance { especially in terms of the variance in goodput seen by individual connections. This \fairness " problem also results in what is commonly known as the \World Wide Wait " experienced by a majority ofinteractive Internet applications such as WWW or ftp. Another auxiliary problem in TCP congestion control is the lack of control over bottleneck queueing delay due to the end-to-end nature of control. In this paper, we evaluate three proposed solutions for these problems- an improved drop scheme (RED), a bit-based explicit congestion noti cation scheme (ECN) and a scheme which explicitly and transparently controls TCP rate (Packeteer TCP rate control). Our studies indicate marked improvements in fairness as we move from RED through ECN to TCP rate control. All schemes control bottleneck queueing delay, but trade o other measures such asdrop rate, utilization and fairness, with TCP rate control exhibiting the best performance in terms of all metrics. In terms of deployment exibility, TCP rate control and RED allow widespread and immediate deployment because they are transparent to hosts (ECN is not because it requires TCP protocol modi cations). The minimal state requirements and protocol transparency of RED allows it a large deployment space. 1