The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation
Abstract
We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets per second than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy. Since it is stateless and easy to implement, CHOKe controls unresponsive or misbehaving flows with a minimum overhead.
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
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,614
Reversibility and Stochastic Networks
Cohen, J. E., & Kelly, F. P. (1981) · Technometrics · doi:10.1080/00401706.1981.10486278 · Cited by 2,212
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · Symposium proceedings on Communications architectures & protocols · doi:10.1145/75246.75248 · Cited by 1,729
Promoting the use of end-to-end congestion control in the Internet
Floyd, S., & Fall, K. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793002 · Cited by 1,646
Stochastic Modeling and the Theory of Queues
Wolff, R. W. (1989) · Cited by 1,593
Reversibility and Stochastic Networks
Unwin, A. (1980) · Journal of the Operational Research Society · doi:10.1057/jors.1980.173 · Cited by 1,529
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
Link-sharing and resource management models for packet networks
Floyd, S., & Jacobson, V. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.413212 · Cited by 977
Cited by
Controlling high bandwidth aggregates in the network
Mahajan, R., Bellovin, S. M., Floyd, S., Ioannidis, J., Paxson, V., & Shenker, S. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/571697.571724 · Cited by 742
Low-rate TCP-targeted denial of service attacks: the shrew vs. the mice and elephants
Kuzmanovic, A., & Knightly, E. W. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863966 · Cited by 489
Controlling high-bandwidth flows at the congested router
Mahajan, R., Floyd, S., & Wetherall, D. (2005) · Proceedings Ninth International Conference on Network Protocols. ICNP 2001 · doi:10.1109/icnp.2001.992899 · Cited by 335
TCP ex machina: computer-generated congestion control
Winstein, K., & Balakrishnan, H. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486020 · Cited by 332
Active Queue Management: A Survey
Adams, R. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.082212.00018 · Cited by 283
Metadata
- Authors
- Pan, R., Prabhakar, B., & Psounis, K.
- Venue
- Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
- Publisher
- IEEE
- Published
- 2002-11-07
- Volume
- 2
- Pages
- 942-951
- OpenAlex
- W2124945508
- Cited by
- 416
- References
- 18
- FWCI
- 23.54
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation. https://app.cochat.ai/papers/10.1109/infcom.2000.832269
- The paper
- Pan, R., Prabhakar, B., & Psounis, K. (2002). CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation. Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064). https://doi.org/10.1109/infcom.2000.832269
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.