Explicit window adaptation: a method to enhance TCP performance

We study the performance of the TCP in an internetwork consisting of both rate-controlled and non-rate-controlled segments. A common example of such an environment occurs when the end systems are part of IP datagram networks interconnected by a rate-controlled segment, such as an ATM network using the ABR service. In the absence of congestive losses in either segment, the TCP keeps increasing its window to its maximum size. Mismatch between the TCP window and the bandwidth-delay product of the network will result in an accumulation of large queues and possibly buffer overflows in the devices at the edges of the rate-controlled segment, causing degraded throughput and unfairness. We develop an explicit feedback scheme, called explicit window adaptation based on modifying the receiver's advertised window in the TCP acknowledgments returning to the source. The window size indicated to the TCP is a function of the free buffer in the edge device. Results from simulations with a wide range of traffic scenarios show that this explicit window adaptation scheme can control the buffer occupancy efficiently at the edge device, and results in significant improvements in packet loss rate, fairness, and throughput over a packet discard policy such as drop-from-front or random early detection.

[1]  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.

[2]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[3]  Joseph B. Evans,et al.  TCP/ATM experiences in the MAGIC testbed , 1995, Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing.

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

[5]  Sally Floyd,et al.  Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.

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

[7]  Sally Floyd,et al.  Dynamics of TCP traffic over ATM networks , 1994 .

[8]  A. Varma,et al.  Performance of TCP over multi-hop ATM networks: a comparative study of ATM-layer congestion control schemes , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[9]  Trevor Blackwell,et al.  Credit-based flow control for ATM networks: credit update protocol, adaptive credit allocation and statistical multiplexing , 1994, SIGCOMM 1994.

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

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

[12]  Sally Floyd,et al.  Dynamics of TCP Traffic over ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[13]  Debasis Mitra Asymptotically optimal design of congestion control for high speed data networks , 1992, IEEE Trans. Commun..

[14]  David H. Shur,et al.  IP over ATM: A Framework Document , 1996, RFC.

[15]  Kadangode K. Ramakrishnan,et al.  Dynamics of an explicit rate allocation algorithm for ATM networks , 1996 .

[16]  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.

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