Finding an appropriate end-to-end congestion control scheme for each type of flow, such as
real-time or multicast flows, may be difficult. But it becomes even more complex to have …

In this paper, we survey the fairness issues in the congestion control mechanisms of TCP,
which is one of most important service aspects in the current and future Internet. We first …

Bandwidth sharing between multiple TCP connections has been studied under the
assumption that the windows of the different connections vary in a synchronized manner …

Router-based algorithms to address the TCP-friendliness problem have focused on
providing fairness to TCP connections by penalizing UDP unresponsive flows. As a result …

In this paper, we first investigate the fairness between TCP Reno and TCP Vegas by
focusing on the situation where Reno and Vegas connections share the bottleneck link …

The packet losses imposed by IP networks can cause long and erratic recovery delays,
since senders must often use conservative loss detection and retransmission mechanisms …

The existing congestion control algorithms perform badly in wide-bandwidth networks
because of their slow response with large congestion windows. Furthermore, they suffer …

We describe in this paper a new TCP rate control scheme based on a simple recursive
algorithm. The idea behind the algorithm is to match the offered network load to the …

We propose a new policy for TCP congestion avoidance and we compare, by a queueing-
simulation study, its performance to those of standard policy. This leads to unfair sharing of …

Router mechanisms designed to achieve fair bandwidth allocations, like fair queuing, have
many desirable properties for congestion control in the Internet. However, such mechanisms …