On the public citation graph
Utilizing 2-D leaf-pushing for packet classification
0 signed · 57 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-0-387-35580-1_4openalex-snapshot
Space Decomposition Techniques for Fast Layer-4 Switching
inferredcites →https://doi.org/10.1016/j.comcom.2007.01.004openalex-snapshot
Two-dimensional packet classification algorithm using a quad-tree
inferredcites →https://doi.org/10.1016/j.comcom.2010.03.009openalex-snapshot
Hierarchical packet classification using a Bloom filter and rule-priority tries
inferredcites →https://doi.org/10.1016/j.comcom.2014.03.026openalex-snapshot
Towards self adaptive network traffic classification
inferredcites →https://doi.org/10.1016/j.comcom.2014.08.004openalex-snapshot
A multi-pipeline architecture for high-speed packet classification
inferredcites →https://doi.org/10.1016/j.comcom.2015.05.017openalex-snapshot
Multi-pipelined and memory-efficient packet classification engines on FPGAs
inferredcites →https://doi.org/10.1109/65.912717openalex-snapshot
Algorithms for packet classification
inferredcites →https://doi.org/10.1109/icnp.2014.53openalex-snapshot
Meta-algorithms for Software-Based Packet Classification
inferredcites →https://doi.org/10.1109/icpads.2009.53openalex-snapshot
DBS: A Bit-level Heuristic Packet Classification Algorithm for High Speed Network
inferredcites →https://doi.org/10.1109/infcom.2003.1208658openalex-snapshot
Packet classification for core routers: is there an alternative to CAMs?
inferredcites →https://doi.org/10.1109/infcom.2009.5061972openalex-snapshot
Packet Classification Algorithms: From Theory to Practice
inferredcites →https://doi.org/10.1109/lcomm.2007.070389openalex-snapshot
Hierarchical Binary Search Tree for Packet Classification
inferredcites →https://doi.org/10.1109/lcomm.2014.013114.132384openalex-snapshot
A Quad-Trie Conditionally Merged with a Decision Tree for Packet Classification
inferredcites →https://doi.org/10.1109/mm.2010.44openalex-snapshot
Tuple Pruning Using Bloom Filters for Packet Classification
inferredcites →https://doi.org/10.1109/surv.2011.031611.00024openalex-snapshot
Theory and Practice of Bloom Filters for Distributed Systems
inferredcites →https://doi.org/10.1109/surv.2011.061411.00095openalex-snapshot
Survey and Proposal on Binary Search Algorithms for Longest Prefix Match
inferredcites →https://doi.org/10.1109/tc.2006.123openalex-snapshot
DPPC-RE: TCAM-based distributed parallel packet classification with range encoding
inferredcites →https://doi.org/10.1109/tc.2012.191openalex-snapshot
Practical Multituple Packet Classification Using Dynamic Discrete Bit Selection
inferredcites →https://doi.org/10.1109/tc.2012.193openalex-snapshot
On Adding Bloom Filters to Longest Prefix Matching Algorithms
inferredcites →https://doi.org/10.1109/tc.2015.2444850openalex-snapshot
New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms
inferredcites →https://doi.org/10.1109/tmm.2006.884610openalex-snapshot
Scalable Packet Classification for Enabling Internet Differentiated Services
inferredcites →https://doi.org/10.1109/tnet.2004.842232openalex-snapshot
Scalable packet classification
inferredcites →https://doi.org/10.1109/tnet.2005.857070openalex-snapshot
Packet classification consuming small amount of memory
inferredcites →https://doi.org/10.1109/tnet.2007.892845openalex-snapshot
$O(\log W)$ Multidimensional Packet Classification
inferredcites →https://doi.org/10.1109/tnet.2007.893156openalex-snapshot
ClassBench: A Packet Classification Benchmark
inferredcites →https://doi.org/10.1109/tnet.2007.893872openalex-snapshot
Performance Improvement of Two-Dimensional Packet Classification by Filter Rephrasing
inferredcites →https://doi.org/10.1109/tnet.2008.2010594openalex-snapshot
Succinct Representation of Static Packet Classifiers
inferredcites →https://doi.org/10.1109/tnet.2009.2018618openalex-snapshot
Scalable Packet Classification Through Rulebase Partitioning Using the Maximum Entropy Hashing
inferredcites →https://doi.org/10.1109/tnet.2013.2254124openalex-snapshot
Boundary Cutting for Packet Classification
inferredcites →https://doi.org/10.1109/tnet.2014.2382031openalex-snapshot
Optimal In/Out TCAM Encodings of Ranges
inferredcites →https://doi.org/10.1109/tnet.2015.2407831openalex-snapshot
Exploiting Order Independence for Scalable and Expressive Packet Classification
inferredcites →https://doi.org/10.1145/1046192.1046223openalex-snapshot
Efficient packet classification for network intrusion detection using FPGA
inferredcites →https://doi.org/10.1145/1108956.1108958openalex-snapshot
Survey and taxonomy of packet classification techniques
inferredcites →https://doi.org/10.1145/1185347.1185354openalex-snapshot
Packet classification using coarse-grained tuple spaces
inferredcites →https://doi.org/10.1145/1185347.1185356openalex-snapshot
Fast packet classification using bloom filters
inferredcites →https://doi.org/10.1145/1323548.1323572openalex-snapshot
High-speed packet classification using binary search on length
inferredcites →https://doi.org/10.1145/2619239.2626294openalex-snapshot
SAX-PAC (Scalable And eXpressive PAcket Classification)
inferredcites →https://doi.org/10.1145/285237.285282openalex-snapshot
Fast and scalable layer four switching
inferredcites →https://doi.org/10.1145/285237.285283openalex-snapshot
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
inferredcites →https://doi.org/10.1145/296502.296503openalex-snapshot
Fast address lookups using controlled prefix expansion
inferredcites →https://doi.org/10.1145/863955.863980openalex-snapshot
Packet classification using multidimensional cutting
inferredcites →https://doi.org/10.5555/2772722.2772731openalex-snapshot
Lossy Compression of Packet Classifiers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11227-019-03090-3openalex-snapshot
MBitCuts: optimal bit-level cutting in geometric space packet classification
inferred← citeshttps://doi.org/10.1007/s42452-019-1592-zopenalex-snapshot
Pruned Kd-tree: a memory-efficient algorithm for multi-field packet classification
inferred← citeshttps://doi.org/10.1016/j.comcom.2018.09.001openalex-snapshot
Bitmap-based priority-NPT for packet forwarding at named data network
inferred← citeshttps://doi.org/10.1016/j.comcom.2019.12.029openalex-snapshot
Dual-load Bloom filter: Application for name lookup
inferred← citeshttps://doi.org/10.1093/comjnl/bxad132openalex-snapshot
Partitioned 2D Set-Pruning Segment Trees with Compressed Buckets for Multi-Dimensional Packet Classification
inferred← citeshttps://doi.org/10.1093/comjnl/bxy052openalex-snapshot
Fast Packet Classification using Recursive Endpoint-Cutting and Bucket Compression on FPGA
inferred← citeshttps://doi.org/10.1109/access.2025.3540411openalex-snapshot
Efficient Hierarchical Hash-Based Multi-Field Packet Classification With Fast Update for Software Switches
inferred← citeshttps://doi.org/10.1109/icc42927.2021.9500898openalex-snapshot
Efficient Packet Classification with Learned Bloom Filter in Software-Defined Networking
inferred← citeshttps://doi.org/10.1109/tits.2020.3014044openalex-snapshot
Enhancing the Performance of Flow Classification in SDN-Based Intelligent Vehicular Networks
inferred← citeshttps://doi.org/10.1109/tnsm.2022.3181063openalex-snapshot
A Learned Bloom Filter-Assisted Scheme for Packet Classification in Software-Defined Networking
inferred← citeshttps://doi.org/10.3390/app10155218openalex-snapshot
Comparison on Search Failure between Hash Tables and a Functional Bloom Filter
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.