On the public citation graph

Layered interval codes for TCAM-based classification

0 signed · 55 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1997.2677openalex-snapshot
On Chromatic Sums and Distributed Resource Allocation
inferredcites →https://doi.org/10.1007/pl00009252openalex-snapshot
On the Sum Coloring Problem on Interval Graphs
inferredcites →https://doi.org/10.1007/s00453-002-1000-7openalex-snapshot
Compressing Two-Dimensional Routing Tables
inferredcites →https://doi.org/10.1016/0166-218x(93)e0174-wopenalex-snapshot
On the k-coloring of intervals
inferredcites →https://doi.org/10.1016/0166-218x(95)80003-mopenalex-snapshot
On the k-coloring of intervals
inferredcites →https://doi.org/10.1016/j.comnet.2006.01.009openalex-snapshot
Efficient packet classification using TCAMs
inferredcites →https://doi.org/10.1016/j.orl.2004.07.006openalex-snapshot
A short proof of the NP-completeness of minimum sum interval coloring
inferredcites →https://doi.org/10.1049/iet-cdt:20060226openalex-snapshot
Enhanced prefix inclusion coding filter-encoding algorithm for packet classification with ternary content addressable memory
inferredcites →https://doi.org/10.1109/40.903060openalex-snapshot
Fast updating algorithms for TCAM
inferredcites →https://doi.org/10.1109/conect.2002.1039263openalex-snapshot
Efficient mapping of range classifier into ternary-CAM
inferredcites →https://doi.org/10.1109/conect.2004.1375197openalex-snapshot
Efficient multi-match packet classification with TCAM
inferredcites →https://doi.org/10.1109/glocom.2007.353openalex-snapshot
Efficient TCAM Encoding Schemes for Packet Classification Using Gray Code
inferredcites →https://doi.org/10.1109/icnp.2003.1249762openalex-snapshot
Packet classification using extended TCAMs
inferredcites →https://doi.org/10.1109/icnp.2007.4375857openalex-snapshot
TCAM Razor: A Systematic Approach Towards Minimizing Packet Classifiers in TCAMs
inferredcites →https://doi.org/10.1109/infcom.1999.749256openalex-snapshot
Constructing optimal IP routing tables
inferredcites →https://doi.org/10.1109/infcom.2007.164openalex-snapshot
Space-Efficient TCAM-Based Classification Using Gray Coding
inferredcites →https://doi.org/10.1109/infcom.2010.5462191openalex-snapshot
Worst-Case TCAM Rule Expansion
inferredcites →https://doi.org/10.1109/infcom.2010.5462192openalex-snapshot
Simple Efficient TCAM Based Range Classification
inferredcites →https://doi.org/10.1109/jsac.2003.810527openalex-snapshot
Fast and scalable packet classification
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.2007.70838openalex-snapshot
DRES: Dynamic Range Encoding Scheme for TCAM Coprocessors
inferredcites →https://doi.org/10.1109/tcad.1987.1270250openalex-snapshot
Finding a Maximum Planar Subset of a Set of Nets in a Channel
inferredcites →https://doi.org/10.1137/0601025openalex-snapshot
The Complexity of Coloring Circular Arcs and Chords
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/1080091.1080115openalex-snapshot
Algorithms for advanced packet classification with ternary CAMs
inferredcites →https://doi.org/10.1145/1108956.1108958openalex-snapshot
Survey and taxonomy of packet classification techniques
inferredcites →https://doi.org/10.1145/1140103.1140313openalex-snapshot
Packet classifiers in ternary CAMs can be smaller
inferredcites →https://doi.org/10.1145/1555349.1555359openalex-snapshot
Topological transformation approaches to optimizing TCAM-based packet classification systems
inferredcites →https://doi.org/10.1145/285237.285282openalex-snapshot
Fast and scalable layer four switching
inferredcites →https://doi.org/10.1145/285243.285282openalex-snapshot
Fast and scalable layer four switching

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-022-04377-8openalex-snapshot
Hardware-based multi-match packet classification in NIDS: an overview and novel extensions for improving the energy efficiency of TCAM-based classifiers
inferred← citeshttps://doi.org/10.1007/s42835-026-02828-3openalex-snapshot
A Novel Packet Classifier Duo for Intrusion and Detection Systems Using Reconfigurable Hardware
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.07.004openalex-snapshot
Special issue on “Challenges in high-performance switching and routing in the Future Internet”
inferred← citeshttps://doi.org/10.1109/ancs.2013.6665179openalex-snapshot
A Ternary Unification Framework for optimizing TCAM-based packet classification systems
inferred← citeshttps://doi.org/10.1109/ancs.2015.7110119openalex-snapshot
Lossy compression of packet classifiers
inferred← citeshttps://doi.org/10.1109/ancs.2019.8901884openalex-snapshot
TabTree: A TSS-assisted Bit-selecting Tree Scheme for Packet Classification with Balanced Rule Mapping
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195653openalex-snapshot
Block permutations in Boolean Space to minimize TCAM for packet classification
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218645openalex-snapshot
TimeFlip: Scheduling network updates with timestamp-based TCAM ranges
inferred← citeshttps://doi.org/10.1109/iraniancee.2015.7146290openalex-snapshot
Increasing the efficiency of TCAM-based packet classifiers using intelligent cut technique in geometric space
inferred← citeshttps://doi.org/10.1109/iscc.2012.6249316openalex-snapshot
PC-TRIO: An indexed TCAM architecture for packet classifiers
inferred← citeshttps://doi.org/10.1109/jsait.2023.3279333openalex-snapshot
On the Implementation of Boolean Functions on Content-Addressable Memories
inferred← citeshttps://doi.org/10.1109/tc.2014.2315645openalex-snapshot
PC-TRIO: A Power Efficient TCAM Architecture for Packet Classifiers
inferred← citeshttps://doi.org/10.1109/tc.2015.2470242openalex-snapshot
Scalable Multi-Match Packet Classification Using TCAM and SRAM
inferred← citeshttps://doi.org/10.1109/tnet.2010.2061864openalex-snapshot
Topological Transformation Approaches to TCAM-Based Packet Classification
inferred← citeshttps://doi.org/10.1109/tnet.2011.2165323openalex-snapshot
Bit Weaving: A Non-Prefix Approach to Compressing Packet Classifiers in TCAMs
inferred← citeshttps://doi.org/10.1109/tnet.2012.2220566openalex-snapshot
Efficient Gray-Code-Based Range Encoding Schemes for Packet Classification in TCAM
inferred← citeshttps://doi.org/10.1109/tnet.2013.2270441openalex-snapshot
High-Throughput and Memory-Efficient Multimatch Packet Classification Based on Distributed and Pipelined Hash Tables
inferred← citeshttps://doi.org/10.1109/tnet.2016.2608441openalex-snapshot
TimeFlip: Using Timestamp-Based TCAM Ranges to Accurately Schedule Network Updates
inferred← citeshttps://doi.org/10.1109/tnet.2018.2797690openalex-snapshot
Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications
inferred← citeshttps://doi.org/10.1145/2935764.2935769openalex-snapshot
Encoding Short Ranges in TCAM Without Expansion
inferred← citeshttps://doi.org/10.1145/3314148.3314346openalex-snapshot
How to deal with range-based packet classifiers
inferred← citeshttps://doi.org/10.1186/s13638-019-1617-8openalex-snapshot
Ingredients to enhance the performance of two-stage TCAM-based packet classifiers in internet of things: greedy layering, bit auctioning and range encoding
inferred← citeshttps://doi.org/10.23919/jcn.2020.000033openalex-snapshot
RETCAM: An efficient TCAM compression model for flow table of OpenFlow
inferred← citeshttps://doi.org/10.3390/electronics8101159openalex-snapshot
Memory Optimization for Bit-Vector-Based Packet Classification on FPGA
inferred← citeshttps://doi.org/10.3390/su12083068openalex-snapshot
Enabling Packet Classification with Low Update Latency for SDN Switch on FPGA
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.