Utilizing 2-D leaf-pushing for packet classification
Research article (Computer Communications, 2017) · cited 13× · AI/ML
Press Enter · cited answer in seconds
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Direct Wikidata claims
- [2] ↑ Utilizing 2-D leaf-pushing for packet classification — instance of (P31): scholarly article. wikidata.org.
Class ancestry
📑 Cite this page
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA
4ort.xyz Knowledge Graph. (2026). Utilizing 2-D leaf-pushing for packet classification. Retrieved May 24, 2026, from https://4ort.xyz/entity/utilizing-2-d-leaf-pushing-for-packet-classification
MLA
“Utilizing 2-D leaf-pushing for packet classification.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/utilizing-2-d-leaf-pushing-for-packet-classification.
BibTeX
@misc{4ortxyz_utilizing-2-d-leaf-pushing-for-packet-classification_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Utilizing 2-D leaf-pushing for packet classification}}, year = {2026}, url = {https://4ort.xyz/entity/utilizing-2-d-leaf-pushing-for-packet-classification}, note = {Accessed: 2026-05-24}}
LLM prompt
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Utilizing 2-D leaf-pushing for packet classification — https://4ort.xyz/entity/utilizing-2-d-leaf-pushing-for-packet-classification (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/utilizing-2-d-leaf-pushing-for-packet-classification · Last refreshed: