A New Schema Congestion Control to Promote Fairness in the Internet Traffic

This paper describes and evaluates a new schema 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 schema uses the TCP behavior to estimate the packet drop probability of each flow, decreasing the problem of unfair share of network bandwidth among TCP flows with different RTTs. As for UDP flows, which consume a large bandwidth, the algorithm will drop packets before entering to the network. One of the advantages of this new schema is to decrease the number of drop packets inside the network. Another advantage is to fairly regulate the bandwidth share among the flows. And the last advantage is to improve the link utilization.