A novel proposal to improve fairness in TCP Reno

Authors:
Liansheng Tan;Peng Yang
Affiliations:
Department of Computer Science, Central China Normal University, Wuhan 430079, P.R. China/ The Research School of Information Sciences and Engineering, The Australian National University, Canberra ...;Department of Computer Science and Engineering, University of Nebraska Lincoln, Lincoln, NE, 68588, USA
Venue:
International Journal of Communication Networks and Distributed Systems
Year:
2009

Citing 14
Cited 2

Data networks

Data networks
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
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
Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking (TON)
Impact of fairness on Internet performance

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bandwidth sharing: objectives and algorithms

IEEE/ACM Transactions on Networking (TON)
A duality model of TCP and queue management algorithms

IEEE/ACM Transactions on Networking (TON)
End-to-end congestion control schemes: utility functions, random losses and ECN marks

IEEE/ACM Transactions on Networking (TON)
Approximate fairness through differential dropping

ACM SIGCOMM Computer Communication Review
FAST TCP: motivation, architecture, algorithms, performance

IEEE/ACM Transactions on Networking (TON)
To be fair or efficient or a bit of both

Computers and Operations Research
General weighted fairness and its support in explicit rate switch algorithms

Computer Communications
REM: active queue management

IEEE Network: The Magazine of Global Internetworking

Evaluation approach for efficiency: fairness tradeoff on the internet

SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
A framework for evaluating efficiency-fairness tradeoff in IP networks in context of development

ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

The fairness in TCP Reno has been long known as unsatisfactory as it gives more bandwidth shares to short flows while starves the long flows. In this paper, a new proposal to improve fairness in TCP Reno is presented. We describe the bandwidth allocation among TCP Reno flows into a new utility optimised problem, in which the requirement of fairness among flows is taken into account in the constrain conditions. This problem is then solved by the Karush-Kuhn-Tucker (KKT) condition to achieve a new distributed algorithm to allocate bandwidth among flows with fairness being enhanced. On this basis, we discuss the implementation of this algorithm in the packet level for real networks using the technique of differential dropping in routers. Simulation results show that the new proposal regulates the bandwidth share effectively and improves the fairness performance of TCP Reno.