The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
A self-configuring RED gateway
Abstract
The congestion control mechanisms used in TCP have been the focus of numerous studies and have undergone a number of enhancements. However, even with these enhancements, TCP connections still experience alarmingly high loss rates, especially during times of congestion. To alleviate this problem, the IETF is considering active queue management mechanisms, such as random early detection (RED), for deployment in the network. In this paper, we first show that the effectiveness of RED depends, to a large extent, on the appropriate parameterization of the RED queue. We then show that there is no single set of RED parameters that work well under different congestion scenarios. In light of this observation, we propose and experiment with more adaptive RED gateways which self-parameterize themselves based on the traffic mix. The results show that traffic cognizant parameterization of RED gateways can effectively reduce packet loss, while maintaining high link utilizations under a range of network loads.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
The macroscopic behavior of the TCP congestion avoidance algorithm
Mathis, M., Semke, J., Mahdavi, J., & Ott, T. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263932.264023 · Cited by 1,495
Recommendations on Queue Management and Congestion Avoidance in the Internet
Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., et al. (1998) · doi:10.17487/rfc2309 · Cited by 1,318
TCP and explicit congestion notification
Floyd, S. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205512 · Cited by 1,016
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
Lakshman, T. V., & Madhow, U. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.611099 · Cited by 928
Dynamics of random early detection
Lin, D., & Morris, R. (1997) · Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/263105.263154 · Cited by 793
A Proposal to add Explicit Congestion Notification (ECN) to IP
Ramakrishnan, K., & Floyd, S. (1999) · doi:10.17487/rfc2481 · Cited by 735
End-to-end Internet packet dynamics
Paxson, V. (1997) · Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/263105.263155 · Cited by 542
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
Floyd, S. (1991) · ACM SIGCOMM Computer Communication Review · doi:10.1145/122431.122434 · Cited by 382
A binary feedback scheme for congestion avoidance in computer networks
Ramakrishnan, K. K., & Jain, R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/78952.78955 · Cited by 365
High performance TCP in ANSNET
Villamizar, C., & Song, C. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205520 · Cited by 362
End-to-end Internet packet dynamics
Paxson, V. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263109.263155 · Cited by 162
Analysis of Random Drop for Gateway Congestion Control
Hashem, E. S. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 146
Design considerations for supporting TCP with per-flow queueing
Suter, B., Lakshman, T. V., Stiliadis, D., & Choudhury, A. K. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1998.659666 · Cited by 130
A framework for alternate queueing: towards traffic management by PC-UNIX based routers
Cho, K. (1998) · USENIX Annual Technical Conference · Cited by 123
Random drop congestion control
Mankin, A. (1990) · ACM SIGCOMM Symposium on Communications Architectures and Protocols (SIGCOMM) · doi:10.1145/99508.99521 · Cited by 79
Gateway Congestion Control Survey
Mankin, A., & Ramakrishnan, K. (1991) · doi:10.17487/rfc1254 · Cited by 76
Cited by
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Misra, V., Gong, W.-B., & Towsley, D. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347421 · Cited by 1,274
Athuraliya, S., Low, S. H., Li, V. H., & Yin, Q. (2001) · IEEE Network · doi:10.1109/65.923940 · Cited by 1,011
On designing improved controllers for AQM routers supporting TCP flows
Hollot, C. V., Misra, V., Towsley, D., & Gong, W.-B. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916670 · Cited by 958
Analysis and design of controllers for AQM routers supporting TCP flows
Hollot, C. V., Misra, V., Towsley, D., & Gong, W. (2002) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2002.1008360 · Cited by 859
The BLUE active queue management algorithms
Feng, W.-C., Shin, K. G., Kandlur, D. D., & Saha, D. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801399 · Cited by 576
“Unfortunately, when a large number of TCP sources are active, the aggregate traffic generated is extremely bursty [8], [9].”
BackgroundMethodInfluentialSelf-citation
Metadata
- Authors
- Feng, W.-C., Kandlur, D. D., Saha, D., & Shin, K. G.
- Venue
- IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)
- Publisher
- IEEE
- Published
- 1999
- Pages
- 1320-1328 vol.3
- OpenAlex
- W2125134431
- Cited by
- 510
- References
- 19
- FWCI
- 18.72
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.