A new algorithm to promote fairness and congestion control in the internet

Authors:
Augusto Foronda;Leandro C. Pykosz;Walter G. Júnior
Affiliations:
CPGEI/CEFET-PR-Federal Center of Technological Education of Paraná, Curitiba-PR, BRAZIL;CPGEI/CEFET-PR-Federal Center of Technological Education of Paraná, Curitiba-PR, BRAZIL;CPGEI/CEFET-PR-Federal Center of Technological Education of Paraná, Curitiba-PR, BRAZIL
Venue:
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Year:
2006

Citing 9
Cited 0

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
The macroscopic behavior of the TCP congestion avoidance algorithm

ACM SIGCOMM Computer Communication Review
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Modeling TCP throughput: a simple model and its empirical validation

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet

IEEE/ACM Transactions on Networking (TON)
Counting the number of active flows on a high speed link

ACM SIGCOMM Computer Communication Review
ERUF: Early Regulation of Unresponsive Best-Effort Traffic

ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Network border patrol: preventing congestion collapse and promoting fairness in the internet

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.