Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing

There has been much interest in using active queue management in routers in order to protect users from connections that are not very responsive to congestion notification. An Internet draft recommends schemes based on random early detection for achieving these goals, to the extent that it is possible, in a system without "per-flow" state. However, a "stateless" system with first-in/first-out (FIFO) queueing is very much handicapped in the degree to which flow isolation and fairness can be achieved. Starting with the observation that a "stateless" system is but one extreme in a spectrum of design choices and that per-flow queueing for a large number of flows is possible, we present active queue management mechanisms that are tailored to provide a high degree of isolation and fairness for TCP connections in a gigabit IP router using per-flow queueing. We show that IP flow state in a router can be bounded if the scheduling discipline used has finite memory, and we investigate the performance implications of different buffer management strategies in such a system. We show that merely using per-flow scheduling is not sufficient to achieve effective isolation and fairness, and it must be combined with appropriate buffer management strategies.

[1]  Scott Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM 1991.

[2]  Roch Guérin,et al.  Optimal Buffer Sharing , 1995, IEEE J. Sel. Areas Commun..

[3]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[4]  D. Stiliadis,et al.  Rate-proportional servers: a design methodology for fair queueing algorithms , 1998, TNET.

[5]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[6]  Edward J. Coyle,et al.  An optimal buffer management policy for high-performance packet switching , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[7]  E. L. Hahne,et al.  Dynamic queue length thresholds in a shared memory ATM switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[8]  T. V. Lakshman,et al.  Beyond best effort: router architectures for the differentiated services of tomorrow's Internet , 1998, IEEE Commun. Mag..

[9]  Kimberly Claffy,et al.  Internet traffic characterization , 1994 .

[10]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.

[11]  kc claffy,et al.  Application of sampling methodologies to network traffic characterization , 1993, SIGCOMM 1993.

[12]  P. Newman,et al.  Traffic management for ATM local area networks , 1994, IEEE Communications Magazine.

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

[14]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[15]  B. Barden Recommendations on queue management and congestion avoidance in the Internet , 1998 .

[16]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[17]  Scott Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM '91.

[18]  T. V. Lakshman,et al.  The performance of TCP/IP for networks with high bandwidth-delay products and random loss , 1997, TNET.

[19]  T. V. Lakshman,et al.  Window-based error recovery and flow control with a slow acknowledgement channel: a study of TCP/IP performance , 1997, Proceedings of INFOCOM '97.

[20]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[21]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[22]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[23]  T. V. Lakshman,et al.  Performance Analysis of Window-based Flow Control Using TCP/IP: Effect of High Bandwidth-Delay Products and Random Loss , 1994, High Performance Networking.

[24]  Mei Yong A new LPC interpolation technique for CELP coders , 1994, IEEE Trans. Commun..

[25]  T. V. Lakshman,et al.  The drop from front strategy in TCP and in TCP over ATM , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.