Authors: Liansheng Tan, Peng Yang
Addresses: 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 ACT 0200, Australia. ' Department of Computer Science and Engineering, University of Nebraska Lincoln, Lincoln, NE, 68588, USA
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.
Keywords: TCP Reno flows; fairness index; utility; differential dropping; bandwidth allocation; simulation; transmission control protocols.
International Journal of Communication Networks and Distributed Systems, 2009 Vol.2 No.1, pp.40 - 62
Published online: 30 Nov 2008 *Full-text access for editors Access for subscribers Purchase this article Comment on this article