Article

Free access

Random drop congestion control

Author:

A. MankinAuthors Info & Claims

SIGCOMM '90: Proceedings of the ACM symposium on Communications architectures & protocols

Pages 1 - 7

https://doi.org/10.1145/99508.99521

Published: 01 August 1990 Publication 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]

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.

[2]

Parulkar, G. (January, 1990), "The Next Generation of Intemetworking", A CM Computer Communications Review, Vol. 20, Number 1.

Digital Library

[3]

Jacobson, V. (1988), "Congestion Control and Avoidance' ', SIGCOMM "88, ACM Computer Communications Review, Vol. 18, Number 4.

Digital Library

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

[5]

Zhang, L. (1989), A New Architecture for Packet Switching Network Protocols, Ph.D Thesis, Massachusetts Institute of Technology, Department of Computer Science.

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

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

[8]

Feldmeier, D. (1988), Estimated Performance of a Gateway Routing-Table Cache, MIT Lab. for Comp. Sci. Technical Memorandum MIT/LCS/TM-352.

[9]

Hashem, E. (1990), Random Drop Congestion Control, M.S. Thesis, Massachusetts Institute of Technology, Department of Computer Science.

[10]

Finn, G. (October, 1989), "A Connectionless Congestion Control Algorithm", ACM Computer Communications Review, Vol. 19, Number 5.

Digital Library

[11]

Knuth, D. (1983), TheArt of Computer Programming 1Iol. 2---Seminumerical Algorithms, Reading, MA: Addison-Wesley, pp. 171-172.

Digital Library

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

[13]

Mankin, A. (1989), Design and Implementation of An Instrumented Gateway. MTR-88W00238, McLean, VA: The MITRE Corporation.

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

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

Digital Library

[16]

McKetmey, P. (1990), "Stochastic Fairness Queueing", To appear in Proceedings of INFOCOM '90.

Cited By

Ayub QNgadi ARashid SHabib H(2018)Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based EnvironmentsPLOS ONE10.1371/journal.pone.019158013:2(e0191580)Online publication date: 13-Feb-2018
https://doi.org/10.1371/journal.pone.0191580
Salmasi FKhoshnevisan L(2015)Adaptive rate-based congestion control with weighted fairness through multi-loop gradient projection internal model controllerIET Control Theory & Applications10.1049/iet-cta.2015.00579:18(2641-2647)Online publication date: 10-Dec-2015
https://doi.org/10.1049/iet-cta.2015.0057
Cheng PRen FShu RLin CMahajan RStoica I(2014)Catch the whole lot in an actionProceedings of the 11th USENIX Conference on Networked Systems Design and Implementation10.5555/2616448.2616451(17-28)Online publication date: 2-Apr-2014
https://dl.acm.org/doi/10.5555/2616448.2616451
Show More Cited By

Index Terms

Random drop congestion control

Recommendations

Configurable active multicast congestion control

A multicast congestion control and avoidance scheme is indispensable for group-based applications to fairly share and efficiently use network resources with unicast applications and maintain the stability of the Internet. It is difficult for the ...
Performance evaluation of Westwood+ TCP congestion control
Internet performance symposium (IPS 2002)

Westwood+ TCP is a sender-side only modification of the classic Tahoe/Reno TCP that has been recently proposed to improve fairness and efficiency of TCP. The key idea of Westwood+ TCP is to perform an end-to-end estimate of the bandwidth available for a ...
TCP-friendly Congestion Control for HighSpeed Network
SAINT '07: Proceedings of the 2007 International Symposium on Applications and the Internet

The currently used TCP congestion control, TCP Reno, has two weaknesses. To solve this TCP Reno drawback, HighSpeed TCP and Scalable TCP were proposed. However, the fairness between these proposed TCP and TCP Reno is not considered, when both ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

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

Chairman:
Phil Karn

ACM SIGCOMM Computer Communication Review Volume 20, Issue 4
Sep. 1990
316 pages
ISSN:0146-4833
DOI:10.1145/99517
Editor:
Phil Karn
Issue’s Table of Contents

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]

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCOMM90

Sponsor:

SIGCOMM

SIGCOMM90: Communications Architectures & Protocols

September 26 - 28, 1990

Pennsylvania, Philadelphia, USA

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

51
Total Citations
View Citations
832
Total Downloads

Downloads (Last 12 months)93
Downloads (Last 6 weeks)17

Reflects downloads up to 19 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ayub QNgadi ARashid SHabib H(2018)Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based EnvironmentsPLOS ONE10.1371/journal.pone.019158013:2(e0191580)Online publication date: 13-Feb-2018
https://doi.org/10.1371/journal.pone.0191580
Salmasi FKhoshnevisan L(2015)Adaptive rate-based congestion control with weighted fairness through multi-loop gradient projection internal model controllerIET Control Theory & Applications10.1049/iet-cta.2015.00579:18(2641-2647)Online publication date: 10-Dec-2015
https://doi.org/10.1049/iet-cta.2015.0057
Cheng PRen FShu RLin CMahajan RStoica I(2014)Catch the whole lot in an actionProceedings of the 11th USENIX Conference on Networked Systems Design and Implementation10.5555/2616448.2616451(17-28)Online publication date: 2-Apr-2014
https://dl.acm.org/doi/10.5555/2616448.2616451
Deshpande TKatsaros PSmolka SStoller S(2014)Stochastic Game-Based Analysis of the DNS Bandwidth Amplification Attack Using Probabilistic Model CheckingProceedings of the 2014 Tenth European Dependable Computing Conference10.1109/EDCC.2014.37(226-237)Online publication date: 13-May-2014
https://dl.acm.org/doi/10.1109/EDCC.2014.37
Nichols KJacobson V(2012)Controlling queue delayCommunications of the ACM10.1145/2209249.220926455:7(42-50)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1145/2209249.2209264
Nichols KJacobson V(2012)Controlling Queue DelayQueue10.1145/2208917.220933610:5(20-34)Online publication date: 6-May-2012
https://dl.acm.org/doi/10.1145/2208917.2209336
Deshpande TKatsaros PBasagiannis SSmolka S(2011)Formal Analysis of the DNS Bandwidth Amplification Attack and Its Countermeasures Using Probabilistic Model Checking2011 IEEE 13th International Symposium on High-Assurance Systems Engineering10.1109/HASE.2011.57(360-367)Online publication date: Nov-2011
https://doi.org/10.1109/HASE.2011.57
Osipova NBlanc AAvrachenkov K(2008)Improving TCP fairness with the MarkMax policy2008 International Conference on Telecommunications10.1109/ICTEL.2008.4652651(1-7)Online publication date: Jun-2008
https://doi.org/10.1109/ICTEL.2008.4652651
Huang XLin CRen F(2007)A novel high speed transport protocol based on explicit virtual load feedbackComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2006.11.00351:7(1800-1814)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1016/j.comnet.2006.11.003
Feng WVanichpun S(2003)Enabling compatibility between TCP Reno and TCP Vegas2003 Symposium on Applications and the Internet, 2003. Proceedings.10.1109/SAINT.2003.1183063(301-308)Online publication date: 2003
https://doi.org/10.1109/SAINT.2003.1183063
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents