A new approach to ensure fairness over the Internet

Congestion signaling is an essential issue for ensuring a high network performance. Explicit congestion notification (ECN) has been proved to provide a faster indication of congestion and thus improve the QoS of a TCP/IP network. In this paper, we present a new scheme for ECN named fair in-time marking (FIM), which employs a mechanism that as well as providing an indication of incipient congestion, assures a fair service to all the connections. To facilitate such services using FIM, we propose inclusion of some simple yet effective functionalities in the routers. This is important as the client base of the Internet is increasing rapidly and the demand for a reasonably fair service is getting stronger. Experiments show that FIM offers the best fairness, sometimes better by around 20% or more without affecting efficiency, compared with other proposed schemes for ECN.

[1]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[2]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[3]  W. Richard Stevens,et al.  TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms , 1997, RFC.

[4]  Geoff Huston.  Internet Performance Survival Guide: Qo S strategies for Multiservice networks , 2000 .

[5]  Norio Shiratori,et al.  An efficient approach to performance improvement of different TCP enhancements using ECN , 2002 .

[6]  Wei Sun,et al.  Quality of service using traffic engineering over MPLS: an analysis , 2000, Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000.

[7]  Mark Handley,et al.  Equation-based congestion control for unicast applications , 2000, SIGCOMM 2000.

[8]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[9]  John B. Nagle,et al.  On Packet Switches with Infinite Storage , 1987, IEEE Trans. Commun..

[10]  Raj Jain,et al.  Improving explicit congestion notification with the mark-front strategy , 2001, Comput. Networks.

[11]  Shivkumar Kalyanaraman,et al.  TCP rate control , 2000, CCRV.

[12]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[13]  Masayuki Murata,et al.  Fairness Comparisons between TCP Reno and TCP Vegas for Future Deployment of TCP Vegas , 2001 .

[14]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[15]  Ioannis Lambadaris,et al.  Performance Evaluation of Explicit Congestion Notification (ECN) in IP networks , 2000, Multimedia Information Systems.

[16]  Masayuki Murata,et al.  Comparisons of packet scheduling algorithms for fair service among connections on the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[18]  Salahuddin Muhammad Salim Zabir.  Providing Fair Service over the Internet : An Approach Based on Packet Marking , 2001 .

[19]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.