Analysis and improvement of transport protocol fairness

Fundamental congestion control methods of Internet are based on reactive methods. The principle of these algorithms is the closed loop control of control theory, namely they measure parameters of the network and feed some information back to the sender. This feedback determinates the sending rate of competing flows. Currently most methods make use of per-flow feedback. This type of feedback cannot give strict guarantees on fair allocation of network resources inherently. One of the most important design and operational objective of transport protocols is the fair and efficient utilization of network resources. This is the main motivation for performance analysis of transport protocols. This paper presents the newly developed control method called Balancer that is designed to provide fair bandwidth allocation for transport layer data flows. The mechanism is implemented in the SimCast simulation environment. The method is based on the global knowledge of outgoing sending rate of controlled flows. The paper demonstrates the basics of this endpoint based congestion control. We prove the efficiency of the developed method through simulation results.

[1]  Balázs Sonkoly,et al.  Understanding highspeed TCP: A control-theoretic perspective , 2005, Communications and Computer Networks.

[2]  Gábor Hosszú.  Simulation-Based Comparison of TCP and TCP-Friendly Protocols , 2009 .

[3]  R. Jain.  Throughput fairness index : An explanation , 1999 .

[4]  Xudong Wu,et al.  On the advantages of lifetime and RTT classification schemes for TCP flows , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[5]  Gábor Hosszú,et al.  Analysis of TCP-Friendly Protocols for Media Streaming , 2008 .

[6]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

[7]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[8]  Margherita Pagani,et al.  Encyclopedia of Multimedia Technology and Networking (second edition) , 2009 .

[9]  Jean-Yves Le Boudec,et al.  Rate adaptation, Congestion Control and Fairness: A Tutorial , 2000 .

[10]  Min Sik Kim,et al.  Transient behaviors of TCP-friendly congestion control protocols , 2003, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Sally Floyd,et al.  Adaptive RED: An Algorithm for Increasing the Robustness of RED's Active Queue Management , 2001 .

[12]  Deborah Estrin,et al.  Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.

[13]  Pamela C. Cosman,et al.  End-to-end differentiation of congestion and wireless losses , 2003, TNET.

[14]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[15]  Raj Jain,et al.  A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks , 1989, CCRV.

[16]  Martina Zitterbart,et al.  Traffic Phase Effects with RED and Constant Bit Rate UDP-Based Traffic , 2000, QofIS.

[17]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[18]  Guru M. Parulkar,et al.  A state management protocol for IntServ, DiffServ and label switching , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).