skip to main content
article
Free Access

A new congestion control scheme: slow start and search (Tri-S)

Published:02 January 1991Publication History
Skip Abstract Section

Abstract

Recently there have been many measures proposed to tackle the problem of congestion in computer networks. In this paper, we first analyze some of the measures and then present a new scheme in which the optimal operating point is obtained by evaluation of throughput gradient and resource sharing is adjusted only at the beginning and the end of a connection. Simulation results show that the scheme converges to an optimal operating point quickly and fairly.

References

  1. [1] R. Jain, "A Timeout-Based Congestion Control Scheme for Window Flow-Controlled Networks," IEEE Jour. on Selected Areas of Communications, Vol. SAC-4, No. 7, pp. 1162-1167, Oct. 1986.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. [2] R. Jain, "A Delay-Based Approach for Congestion Avoidance in Interconnected Heterogeneous Computer Networks," Comp. Commun. Rev., Vol. 19, no. 5, pp. 56-71, Oct. 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [3] K. K. Ramakrishnan and R. Jain, "An Explicit Binary Feedback Scheme for Congestion Avoidance in Computer Networks with a Connectionless Network Layer," Proc. of ACM SIGCOMM'88, Stanford, CA, pp. 303-313, Aug. 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [4] V. Jacobson, "Congestion Avoidance and Control," Proc. of ACM SIGCOMM'88, Stanford, CA, pp. 314- 329, Aug. 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. [5] W. Prue, J. Postel, "Something a Host Could Do with Source Quench: The Source Quench Introduced Delay (SQuID)," RFC-1016, SRI International, Menlo Park, CA, July 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queuing Algorithm," Proc. of ACM SIGCOMM'89, Austin, TX, pp. 1-12, Sept. 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. [7] L. Zhang, "A New Architecture for Packet Switching Network Protocols," PhD Thesis, MIT, 1989.Google ScholarGoogle Scholar
  8. [8] D. M. Chiu and R. Jain, "Analysis of Increase and Decrease Algorithms for Congestion Avoidance in Computer networks," Comp. Networks and ISDN Syst., Vol. 17, pp. 1-14, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. [9] K. K. Ramakrishnan, R. Jain and D. M. Chiu, "Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part IV: A Selective Binary Feedback Scheme for General Topologies" DEC Technical Report, TR-510, 1987.Google ScholarGoogle Scholar

Index Terms

  1. A new congestion control scheme: slow start and search (Tri-S)

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image ACM SIGCOMM Computer Communication Review
              ACM SIGCOMM Computer Communication Review  Volume 21, Issue 1
              Jan. 1991
              134 pages
              ISSN:0146-4833
              DOI:10.1145/116030
              • Editor:
              • Vinton G. Cerf
              Issue’s Table of Contents

              Copyright © 1991 Authors

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 2 January 1991

              Check for updates

              Qualifiers

              • article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader