Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm

ABSTRACT

The congestion control algorithm embedded in the 4.3-Tahoe BSD TCP implementation has dramatically improved congestion control over the Internet. However, several recent simulation studies on the dynamics of this algorithm has revealed that the algorithm exhibits clear oscillatory patterns in sending window size, round trip delay and bottleneck queue length. In this paper, we present a new congestion signal scheme and a dual traffic adjustment strategy. Simulation results show that our modifications can eliminate the periodic packet losses and substantially reduce the traffic oscillation.

REFERENCES

• 1: [1] R. Jain, "A Timeout-Based Congestion Control Scheme for Window Flow-Controlled Networks," IEEE Journal on Selected Areas of Communications, Vol. SAC-4, No. 7, pp. 1162-1167, Oct. 1986.
• 2: R. Jain, A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks, ACM SIGCOMM Computer Communication Review, v.19 n.5, p.56-71, Oct. 1989 [doi>10.1145/74681.74686]
• 3: Lixia Zhang , Scott Shenker , Daivd D. Clark, Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic, Proceedings of the conference on Communications architecture & protocols, p.133-147, September 03-06, 1991, Zurich, Switzerland
• 4: Scott Schenker , Lixia Zhang , David D. Clark, Some observations on the dynamics of a congestion control algorithm, ACM SIGCOMM Computer Communication Review, v.20 n.5, p.30-39, Oct 1 1990 [doi>10.1145/381906.381931]
• 5: [5] D. Sanghi, et al, "A TCP Instrumentation and its use in Evaluating Roundtrip-Time Estimators," Internetworking: Research and Experience, Vol. 1, pp. 77-99, 1990.
• 6: Zheng Wang , Jon Crowcroft, A new congestion control scheme: slow start and search (Tri-S), ACM SIGCOMM Computer Communication Review, v.21 n.1, p.32-43, Jan. 1991 [doi>10.1145/116030.116033]
• 7: Jean-Chrysostome Bolot , A. Udaya Shankar, Dynamical behavior of rate-based flow control mechanisms, ACM SIGCOMM Computer Communication Review, v.20 n.2, p.35-49, April, 1990 [doi>10.1145/378570.378633]
• 8: R. Braden, Requirements for Internet Hosts - Communication Layers, RFC Editor, 1989
• 9: K. K. Ramakrishnan , R. Jain, A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer, ACM SIGCOMM Computer Communication Review, v.18 n.4, p.303-313, August 1988
• 10: V. Jacobson, Congestion avoidance and control, Symposium proceedings on Communications architectures and protocols, p.314-329, August 16-18, 1988, Stanford, California, United States
• 11: W. Prue , J. Postel, Something a host could do with source quench: The Source Quench Introduced Delay (SQuID), RFC Editor, 1987
• 12: A. Demers , S. Keshav , S. Shenker, Analysis and simulation of a fair queueing algorithm, Symposium proceedings on Communications architectures & protocols, p.1-12, September 25-27, 1989, Austin, Texas, United States
• 13: [13] L. Zhang, "A New Architecture for Packet Switching Network Protocols," PhD Thesis, MIT, 1989.
• 14: D.-M. Chiu , R. Jain, Analysis of the increase and decrease algorithms for congestion avoidance in computer networks, Computer Networks and ISDN Systems, v.17 n.1, p.1-14, June 10, 1989 [doi>10.1016/0169-7552(89)90019-6]
• 15: V. Jacobson , R. T. Braden , L. Zhang, TCP Extension for High-Speed Paths, RFC Editor, 1990
• 16: Srinivasan Keshav, Congestion control in computer networks, University of California at Berkeley, Berkeley, CA, 1992

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design

          Nouns: Internet

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.3 Network Operations
          Subjects: Network management

General Terms:
Algorithms, Design, Management, Measurement, Performance, Theory