The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
REM: active queue management
Abstract
We describe a new active queue management scheme, random exponential marking (REM), that aims to achieve both high utilization and negligible loss and delay in a simple and scalable manner. The key idea is to decouple the congestion measure from the performance measure such as loss, queue length, or delay. While the congestion measure indicates excess demand for bandwidth and must track the number of users, the performance measure should be stabilized around their targets independent of the number of users. We explain the design rationale behind REM and present simulation results of its performance in wireline and wireless networks.
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
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Charging and rate control for elastic traffic
Kelly, F. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080106 · Cited by 2,936
Optimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Self-citationA comparison of mechanisms for improving TCP performance over wireless links
Balakrishnan, H., Padmanabhan, V. N., Seshan, S., & Katz, R. H. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650137 · Cited by 1,395
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
A control theoretic analysis of RED
Hollot, C. V., Misra, V., Towsley, D., & Gong, W. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2001.916647 · Cited by 956
A Proposal to add Explicit Congestion Notification (ECN) to IP
Ramakrishnan, K., & Floyd, S. (1999) · doi:10.17487/rfc2481 · Cited by 735
Ott, T. J., Lakshman, T. V., & Wong, L. H. (1999) · 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) · doi:10.1109/infcom.1999.752153 · Cited by 678
A self-configuring RED gateway
Feng, W.-C., Kandlur, D. D., Saha, D., & Shin, K. G. (1999) · 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) · doi:10.1109/infcom.1999.752150 · Cited by 510
Cited by
Congestion control for high bandwidth-delay product networks
Katabi, D., Handley, M., & Rohrs, C. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633035 · Cited by 1,096
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
(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796
A duality model of TCP and queue management algorithms
Low, S. H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.815297 · Cited by 653
Self-citationThe 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
Active Queue Management: A Survey
Adams, R. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.082212.00018 · Cited by 283
Li, F., Sun, J., Zukerman, M., Liu, Z., Xu, Q., Chan, S., Chen, G., & Ko, K.-T. (2014) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2014.01.005 · Cited by 33
An Adaptive Neuron AQM for a Stable Internet
Sun, J., & Zukerman, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72606-7_72 · Cited by 30
IAPI: An intelligent adaptive PI active queue management scheme
Sun, J., Chan, S., & Zukerman, M. (2012) · Computer Communications · doi:10.1016/j.comcom.2012.07.013 · Cited by 19
An adaptive AQM algorithm based on neuron reinforcement learning
Zhou, C., Di, D., Chen, Q., & Guo, J. (2009) · 2009 IEEE International Conference on Control and Automation · doi:10.1109/icca.2009.5410198 · Cited by 17
α_ SNFAQM: an active queue management mechanism using neurofuzzy prediction
Zhani, M. F., Elbiaze, H., & Kamoun, F. (2007) · 2007 12th IEEE Symposium on Computers and Communications · doi:10.1109/iscc.2007.4381596 · Cited by 11
Metadata
- Authors
- Athuraliya, S., Low, S. H., Li, V. H., & Yin, Q.
- Venue
- IEEE Network
- Published
- 2001
- Volume
- 15
- Issue
- 3
- Pages
- 48-53
- ISSN
- 0890-8044 (ISSN-L)
- OpenAlex
- W2157460365
- Cited by
- 1,011
- References
- 12
- FWCI
- 82.44
- Type
- journal article
- 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.