skip to main content
10.1145/99508.99521acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

Random drop congestion control

Published:01 August 1990Publication History

ABSTRACT

Gateways in very high speed internets will need to have low processing requirements and rapid responses to congestion. This has prompted a study of the performance of the Random Drop algorithm for congestion recovery. It was measured in experiments involving local and long distance traffic using multiple gateways. For the most part, Random Drop did not improve the congestion recovery behavior of the gateways A surprising result was that its performance was worse in a topology with a single gateway bottleneck than in those with multiple bottlenecks. The experiments also showed that local traffic is affected by events at distant gateways.

References

  1. 1.Jacobson, V. (April, 1989), reported in "Minutes of the Performance Working Group' ', Proceedings of tile Cocoa Beach internet Engineering Task Force, Reston, VA: Corporation for National Research initiatives.Google ScholarGoogle Scholar
  2. 2.Parulkar, G. (January, 1990), "The Next Generation of Intemetworking", A CM Computer Communications Review, Vol. 20, Number 1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Jacobson, V. (1988), "Congestion Control and Avoidance' ', SIGCOMM "88, ACM Computer Communications Review, Vol. 18, Number 4. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Maakin, A. and K. Thompson (February, 1989), "Limiting Factors in the Performance of Slow-start TCP", Conference Proceedings of the Winter 1989 USENIX in San Diego.Google ScholarGoogle Scholar
  5. 5.Zhang, L. (1989), A New Architecture for Packet Switching Network Protocols, Ph.D Thesis, Massachusetts Institute of Technology, Department of Computer Science.Google ScholarGoogle Scholar
  6. 6.Ramak#hnaa, K.K., D.M. Chiu and R. Jain (1987), A Selective Binary Feedback Scheme for Congestion Avoidance in Computer Networks with a Connectionless Network Layer, DEC TR-510, Littleton, MA: Digital Equipment Corporation.Google ScholarGoogle Scholar
  7. 7.Jain, R. and S. Routhier (September, 1986), "Packet Trains--Measurements and a New Model for Computer Network Traffic", IEEE Journal on Selected Areas in Communications, Vol. SAC-4, No. 6.Google ScholarGoogle Scholar
  8. 8.Feldmeier, D. (1988), Estimated Performance of a Gateway Routing-Table Cache, MIT Lab. for Comp. Sci. Technical Memorandum MIT/LCS/TM-352.Google ScholarGoogle Scholar
  9. 9.Hashem, E. (1990), Random Drop Congestion Control, M.S. Thesis, Massachusetts Institute of Technology, Department of Computer Science.Google ScholarGoogle Scholar
  10. 10.Finn, G. (October, 1989), "A Connectionless Congestion Control Algorithm", ACM Computer Communications Review, Vol. 19, Number 5. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.Knuth, D. (1983), TheArt of Computer Programming 1Iol. 2---Seminumerical Algorithms, Reading, MA: Addison-Wesley, pp. 171-172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.Abrahams, P. (August, 1989), "Technical Correspondence---Random Number Generators and the Minimal Standard", Communications of the ACM, Vol. 32, No. 8, pp. 1021-1022.Google ScholarGoogle Scholar
  13. 13.Mankin, A. (1989), Design and Implementation of An Instrumented Gateway. MTR-88W00238, McLean, VA: The MITRE Corporation.Google ScholarGoogle Scholar
  14. 14.Jain, R., D.M. Chiu and W. Hawe (1984), A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Systems. DEC TR- 301, Littleton, MA: Digital Equipment Corporation.Google ScholarGoogle Scholar
  15. 15.Demers, A., S. Keshav and S. Shenker (1989), "Simulation and Analysis of a Fair Queu~ing Algorithm", SIGCOMM '89, ACM Computer Communications Review, Vol. 19, Number 4. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.McKetmey, P. (1990), "Stochastic Fairness Queueing", To appear in Proceedings of INFOCOM '90.Google ScholarGoogle Scholar

Index Terms

  1. Random drop congestion control

            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
            • Published in

              cover image ACM Conferences
              SIGCOMM '90: Proceedings of the ACM symposium on Communications architectures & protocols
              August 1990
              318 pages
              ISBN:0897914058
              DOI:10.1145/99508

              Copyright © 1990 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 August 1990

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate554of3,547submissions,16%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader