On the public citation graph
H‐SOFT: a heuristic storage space optimisation algorithm for flow table of OpenFlow
0 signed · 44 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.1016/j.comnet.2012.04.014openalex-snapshot
A new hierarchical packet classification algorithm
inferredcites →https://doi.org/10.1109/aina.2011.70openalex-snapshot
Layered Cutting Scheme for Packet Classification
inferredcites →https://doi.org/10.1109/glocom.2009.5426226openalex-snapshot
Energy-Efficient Multi-Pipeline Architecture for Terabit Packet Classification
inferredcites →https://doi.org/10.1109/hpsr.2012.6260831openalex-snapshot
LightFlow: Speeding up GPU-based flow switching and facilitating maintenance of flow table
inferredcites →https://doi.org/10.1109/infcom.1999.752164openalex-snapshot
Optimal routing table design for IP address lookups under memory constraints
inferredcites →https://doi.org/10.1109/infcom.2013.6567005openalex-snapshot
A difference resolution approach to compressing Access Control Lists
inferredcites →https://doi.org/10.1109/iwqos.2012.6245978openalex-snapshot
Approaching optimal compression with fast update for large scale routing tables
inferredcites →https://doi.org/10.1109/lcomm.2010.100810.100572openalex-snapshot
FRFC: Fast Table Building Algorithm for Recursive Flow Classification
inferredcites →https://doi.org/10.1109/mc.2011.250openalex-snapshot
OpenFlow: The Next Generation of the Network?
inferredcites →https://doi.org/10.1109/tnet.2015.2397393openalex-snapshot
A Difference Resolution Approach to Compressing Access Control Lists
inferredcites →https://doi.org/10.1109/tnsm.2012.081012.120246openalex-snapshot
Practical Network-Wide Compression of IP Routing Tables
inferredcites →https://doi.org/10.1109/tpds.2011.114openalex-snapshot
Compressing Network Access Control Lists
inferredcites →https://doi.org/10.1145/1851182.1851224openalex-snapshot
Scalable flow-based networking with DIFANE
inferredcites →https://doi.org/10.1145/1851275.1851224openalex-snapshot
Scalable flow-based networking with DIFANE
inferredcites →https://doi.org/10.1360/jos180978openalex-snapshot
Towards the Optimization of Access Control List
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.3547openalex-snapshot
Advances in Parallel and Distributed Computing and Communications
inferred← citeshttps://doi.org/10.1002/cpe.6362openalex-snapshot
QoS‐aware big service composition using distributed co‐evolutionary algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-19153-5_6openalex-snapshot
Intelligent Dynamic Timeout for Efficient Flow Table Management in Software Defined Satellite Network
inferred← citeshttps://doi.org/10.1007/978-3-030-34139-8_25openalex-snapshot
Resolving the Loop in High-Level SDN Program for Multi-table Pipeline Compilation
inferred← citeshttps://doi.org/10.1007/978-3-032-13094-5_5openalex-snapshot
Wireless Networking Architectures and Intelligent Connectivity
inferred← citeshttps://doi.org/10.1007/s00521-018-3427-zopenalex-snapshot
NNIRSS: neural network-based intelligent routing scheme for SDN
inferred← citeshttps://doi.org/10.1016/j.future.2017.10.015openalex-snapshot
Distributed parallel cooperative coevolutionary multi-objective large-scale immune algorithm for deployment of wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.jnca.2020.102806openalex-snapshot
An efficient pipeline processing scheme for programming Protocol-independent Packet Processors
inferred← citeshttps://doi.org/10.1109/access.2019.2932422openalex-snapshot
Toward Adaptive and Scalable OpenFlow-SDN Flow Control: A Survey
inferred← citeshttps://doi.org/10.1109/access.2019.2942208openalex-snapshot
Efficient Differentiated Storage Architecture for Large-Scale Flow Tables in Software-Defined Wide-Area Networks
inferred← citeshttps://doi.org/10.1109/access.2021.3138399openalex-snapshot
EFS: Efficient Storage Optimization for Multistage Flow-Table in Software-Defined Satellite Network
inferred← citeshttps://doi.org/10.1109/cit.2014.108openalex-snapshot
A New Lookup Model for Multiple Flow Tables of Open Flow with Implementation and Optimization Considerations
inferred← citeshttps://doi.org/10.1109/cits.2018.8440152openalex-snapshot
The High Speed Packet Classification Supporting Multi - Field for Flow Tables in OpenFlow
inferred← citeshttps://doi.org/10.1109/comst.2022.3158270openalex-snapshot
A Survey of Intelligent Network Slicing Management for Industrial IoT: Integrated Approaches for Smart Transportation, Smart Energy, and Smart Factory
inferred← citeshttps://doi.org/10.1109/glocom.2017.8254507openalex-snapshot
A Hash-Based Distributed Storage Strategy of FlowTables in SDN-IoT Networks
inferred← citeshttps://doi.org/10.1109/hpcc-smartcity-dss50907.2020.00049openalex-snapshot
An Enhanced Data Plane for Network Event Processing in Software Defined Networking
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2018.00071openalex-snapshot
A New Human Eye Tracking Method Based on Tracking Module Feedback TLD Algorithm
inferred← citeshttps://doi.org/10.1109/icccn.2018.8487378openalex-snapshot
The Research on Designs of Multiple Flow Tables in the OpenFlow Protocol
inferred← citeshttps://doi.org/10.1109/iccnc.2018.8390421openalex-snapshot
Heterogeneous Flow Table Integration for Capacity Enhancement in Software-Defined Networks
inferred← citeshttps://doi.org/10.1109/icnidc.2018.8525565openalex-snapshot
A Cost-Effective Lookup Scheme Combining Hash Table With TCAM for OpenFlow
inferred← citeshttps://doi.org/10.1109/icpads60453.2023.00020openalex-snapshot
An Efficient Network Flow Rules Compression Method Based On In-Network Computation On Cloud Computing
inferred← citeshttps://doi.org/10.1109/pimrc.2017.8292507openalex-snapshot
High-efficiency matching mechanism for off-chip tables in OpenFlow-enabled legacy switch
inferred← citeshttps://doi.org/10.1109/smc.2016.7844645openalex-snapshot
TF-IdleTimeout: Improving efficiency of TCAM in SDN by dynamically adjusting flow entry lifecycle
inferred← citeshttps://doi.org/10.23919/jcn.2020.000033openalex-snapshot
RETCAM: An efficient TCAM compression model for flow table of OpenFlow
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.