The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Classifying packets with hierarchical intelligent cuttings
Abstract
Increasing demands on Internet router performance and functionality create a need for algorithms that classify packets quickly with minimal storage requirements and allow frequent updates. Unlike previous algorithms, the algorithm proposed here meets this need well by using heuristics that exploit structure present in classifiers. Our approach, which we call HiCuts (hierarchical intelligent cuttings), attempts to partition the search space in each dimension, guided by simple heuristics that exploit the classifier's structure. We discover this structure by preprocessing the classifier. We can tune the algorithm's parameters to trade off query time against storage requirements. In classifying packets based on four header fields, HiCuts performs quickly and requires relatively little storage compared with previously described algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Packet classification using tuple space search
Srinivasan, V., Suri, S., & Varghese, G. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316216 · Cited by 495
Cited by
Algorithms for packet classification
Gupta, P., & McKeown, N. (2001) · IEEE Network · doi:10.1109/65.912717 · Cited by 655
Self-citationChen, T.-S., Lee, D.-Y., Liu, T.-T., & Wu, A.-Y. (2016) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2016.2584658 · Cited by 30
Metadata
- Authors
- Gupta, P., & McKeown, N.
- Venue
- IEEE Micro
- Published
- 2000
- Volume
- 20
- Issue
- 1
- Pages
- 34-41
- ISSN
- 0272-1732 (ISSN-L)
- OpenAlex
- W2063773589
- Cited by
- 324
- References
- 1
- FWCI
- 7.03
- 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.