<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e3162" altimg="si21.svg"><mml:mrow><mml:mi>K</mml:mi><mml:mi>e</mml:mi><mml:mi>y</mml:mi><mml:mi>C</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:math>: Efficient keyword matching for network traffic classification

Research article (Computer Communications, 2021) · cited 12× · AI/ML
Press Enter · cited answer in seconds

KeyClass: Efficient keyword matching for network traffic classification

Summary

KeyClass: Efficient keyword matching for network traffic classification is a scholarly article<sup id="cite-A2" class="cite-ref" title="KeyCl[1].

Key Facts

  • KeyClass: Efficient keyword matching for network traffic classification's instance of is recorded as scholarly article<sup id="cite-C1" class="cite-ref" title="KeyCl[2].

📑 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). <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e3162" altimg="si21.svg"><mml:mrow><mml:mi>K</mml:mi><mml:mi>e</mml:mi><mml:mi>y</mml:mi><mml:mi>C</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:math>: Efficient keyword matching for network traffic classification. Retrieved May 24, 2026, from https://4ort.xyz/entity/mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-display-inline-id-d1e3162-altimg-si21-svg-mml-mrow-mml-mi-k-mml-mi-m
MLA “<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e3162" altimg="si21.svg"><mml:mrow><mml:mi>K</mml:mi><mml:mi>e</mml:mi><mml:mi>y</mml:mi><mml:mi>C</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:math>: Efficient keyword matching for network traffic classification.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-display-inline-id-d1e3162-altimg-si21-svg-mml-mrow-mml-mi-k-mml-mi-m.
BibTeX @misc{4ortxyz_mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-display-inline-id-d1e3162-altimg-si21-svg-mml-mrow-mml-mi-k-mml-mi-m_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e3162" altimg="si21.svg"><mml:mrow><mml:mi>K</mml:mi><mml:mi>e</mml:mi><mml:mi>y</mml:mi><mml:mi>C</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:math>: Efficient keyword matching for network traffic classification}}, year = {2026}, url = {https://4ort.xyz/entity/mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-display-inline-id-d1e3162-altimg-si21-svg-mml-mrow-mml-mi-k-mml-mi-m}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e3162" altimg="si21.svg"><mml:mrow><mml:mi>K</mml:mi><mml:mi>e</mml:mi><mml:mi>y</mml:mi><mml:mi>C</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:math>: Efficient keyword matching for network traffic classification — https://4ort.xyz/entity/mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-display-inline-id-d1e3162-altimg-si21-svg-mml-mrow-mml-mi-k-mml-mi-m (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-display-inline-id-d1e3162-altimg-si21-svg-mml-mrow-mml-mi-k-mml-mi-m · Last refreshed: