A New Algorithm to Promote Fairness and Congestion Control in the Internet

A. Foronda, L.C. Pykosz, and W. Godoy Jr. (Brazil)


QoS, RED, Token Bucket, Congestion Control, and Fairness


This paper describes and evaluates a new algorithm to reduce the network congestion and the unfair bandwidth allocation for competing flows. These two problems can be caused by unresponsive flows or not TCP-friendly flows. Unresponsive flows don’t have their rate transmission regulated by the network congestion, like an UDP flow. A not TCP-friendly flow is, for example, a TCP flow with small roundtrip time (RTT). These flows can consume a large part of the network bandwidth, resulting in a degradation of the network performance. This new algorithm uses the TCP behavior to estimate the packet drop probability of each flow to decrease the problem of unfair share of network bandwidth among TCP flows with different RTTs. As for UDP flows, that consume a large bandwidth, the algorithm will drop packets before they enter the network. One of the advantages of this new algorithm is to decrease the number of drop packets inside the network. Another advantage is to regulate fairly the bandwidth share among the flows. And the last advantage is to improve the link utilization. The results here will be compared with other algorithms to prove its effectiveness.

Important Links:

Go Back