On the public citation graph

IP lookups using multiway and multicolumn search

0 signed · 243 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.1007/978-0-387-35378-4_2openalex-snapshot
Fast address lookup for Internet routers
inferredcites →https://doi.org/10.1016/c2013-0-06783-7openalex-snapshot
Alpha AXP Architecture Reference Manual
inferredcites →https://doi.org/10.1109/35.526895openalex-snapshot
IPv6: the new Internet protocol
inferredcites →https://doi.org/10.1109/35.568212openalex-snapshot
IP switching and gigabit routers
inferredcites →https://doi.org/10.1109/40.566194openalex-snapshot
Tiny Tera: a packet switch core
inferredcites →https://doi.org/10.1109/65.120723openalex-snapshot
Putting routing tables in silicon
inferredcites →https://doi.org/10.1109/90.490742openalex-snapshot
Trading packet headers for packet processing
inferredcites →https://doi.org/10.1109/90.700888openalex-snapshot
A 50-Gb/s IP router
inferredcites →https://doi.org/10.1109/infcom.1997.635108openalex-snapshot
Design of a gigabit ATM switch
inferredcites →https://doi.org/10.1109/infcom.1998.662938openalex-snapshot
Routing lookups in hardware at memory access speeds
inferredcites →https://doi.org/10.1145/217382.217409openalex-snapshot
a I t P m
inferredcites →https://doi.org/10.1145/263105.263133openalex-snapshot
Small forwarding tables for fast routing lookups
inferredcites →https://doi.org/10.1145/263105.263136openalex-snapshot
Scalable high speed IP routing lookups
inferredcites →https://doi.org/10.1145/263105.263151openalex-snapshot
Internet routing instability
inferredcites →https://doi.org/10.1145/263109.263136openalex-snapshot
Scalable high speed IP routing lookups
inferredcites →https://doi.org/10.1145/277851.277863openalex-snapshot
Faster IP lookups using controlled prefix expansion
inferredcites →https://doi.org/10.1145/296502.296503openalex-snapshot
Fast address lookups using controlled prefix expansion
inferredcites →https://doi.org/10.1145/347059.347428openalex-snapshot
Delayed Internet routing convergence
inferredcites →https://doi.org/10.17487/rfc1883openalex-snapshot
Internet Protocol, Version 6 (IPv6) Specification
inferredcites →https://doi.org/10.17487/rfc2105openalex-snapshot
Cisco Systems' Tag Switching Architecture Overview
inferredcites →https://doi.org/10.17487/rfc8200openalex-snapshot
Internet Protocol, Version 6 (IPv6) Specification
inferredcites →https://doi.org/10.48550/arxiv.cs/9810006openalex-snapshot
The Tiny Tera: A Packet Switch Core

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.1085openalex-snapshot
Scalable packet classification using a compound algorithm
inferred← citeshttps://doi.org/10.1002/dac.709openalex-snapshot
Efficient location of free spaces in TCAM to improve router performance
inferred← citeshttps://doi.org/10.1007/11427186_50openalex-snapshot
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
inferred← citeshttps://doi.org/10.1007/11539506_142openalex-snapshot
IP Address Lookup with the Visualizable Biased Segment Tree
inferred← citeshttps://doi.org/10.1007/11751588_64openalex-snapshot
Adaptive Selection of MIPv6 and Hierarchical MIPv6 for Minimizing Signaling Cost
inferred← citeshttps://doi.org/10.1007/11758549_28openalex-snapshot
IC Design of IPv6 Routing Lookup for High Speed Networks
inferred← citeshttps://doi.org/10.1007/11919568_39openalex-snapshot
Dynamic Routing Tables Using Simple Balanced Search Trees
inferred← citeshttps://doi.org/10.1007/3-540-36087-5_24openalex-snapshot
Neural Network Based Algorithms for IP Lookup and Packet Classification
inferred← citeshttps://doi.org/10.1007/3-540-36087-5_60openalex-snapshot
Performing IP Lookup on Very High Line Speed
inferred← citeshttps://doi.org/10.1007/3-540-44849-7_28openalex-snapshot
XOR-Based Schemes for Fast Parallel IP Lookups
inferred← citeshttps://doi.org/10.1007/3-540-46093-4_13openalex-snapshot
An Application-Specific Database
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_7openalex-snapshot
IP Address LookupMade Fast and Simple
inferred← citeshttps://doi.org/10.1007/978-3-540-25978-7_62openalex-snapshot
A Scalable Parallel Lookup Framework Avoiding Longest Prefix Match
inferred← citeshttps://doi.org/10.1007/978-3-540-28608-0_19openalex-snapshot
Hancock: A Language for Analyzing Transactional Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_68openalex-snapshot
Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions
inferred← citeshttps://doi.org/10.1007/978-3-540-30197-4_47openalex-snapshot
Accelerating Computation Bounded IP Lookup Methods by Adding Simple Instructions
inferred← citeshttps://doi.org/10.1007/978-3-540-45235-5_5openalex-snapshot
Scalable IP Routing Lookup in Next Generation Network
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_25openalex-snapshot
Experimental Evaluations of Algorithms for IP Table Minimization
inferred← citeshttps://doi.org/10.1007/978-3-540-74484-9_71openalex-snapshot
On Multicast Routing Based on Route Optimization in Network Mobility
inferred← citeshttps://doi.org/10.1007/978-3-540-77024-4_25openalex-snapshot
Performance Analysis of a Protocol for Network-Based Localized Mobility Management
inferred← citeshttps://doi.org/10.1007/978-3-642-03700-9_16openalex-snapshot
A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond
inferred← citeshttps://doi.org/10.1007/978-3-642-22555-0_49openalex-snapshot
Performance of Routing Lookups
inferred← citeshttps://doi.org/10.1007/978-981-10-0135-2_18openalex-snapshot
Prefix Length-Based Disjoint Set Tries for IPv6 Lookup
inferred← citeshttps://doi.org/10.1007/s00224-004-1183-1openalex-snapshot
XOR-Based Schemes for Fast Parallel IP Lookups
inferred← citeshttps://doi.org/10.1007/s00453-011-9594-2openalex-snapshot
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
inferred← citeshttps://doi.org/10.1007/s11036-008-0053-5openalex-snapshot
Interworking Architectures for IP Multimedia Subsystems
inferred← citeshttps://doi.org/10.1007/s12652-019-01646-yopenalex-snapshot
RETRACTED ARTICLE: Real time prefix matching based IP lookup and update mechanism for efficient routing in networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2004.06.005openalex-snapshot
A fast string search algorithm for deep packet classification
inferred← citeshttps://doi.org/10.1016/j.comcom.2004.10.014openalex-snapshot
Simple and fast IP lookups using binomial spanning trees
inferred← citeshttps://doi.org/10.1016/j.comcom.2005.11.002openalex-snapshot
A fast and scalable IPv4 and 6 address lookup algorithm
inferred← citeshttps://doi.org/10.1016/j.comcom.2005.12.002openalex-snapshot
High-speed IP address lookup using balanced multi-way trees
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.08.032openalex-snapshot
Parallel tree search: An algorithmic approach for multi-field packet classification
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.09.006openalex-snapshot
Build shape-shifting tries for fast IP lookup in O(n) time
inferred← citeshttps://doi.org/10.1016/j.comcom.2010.10.005openalex-snapshot
A new and effective hierarchical overlay structure for Peer-to-Peer networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2014.04.006openalex-snapshot
IP address lookup using bit-shuffled trie
inferred← citeshttps://doi.org/10.1016/j.comcom.2016.06.004openalex-snapshot
Hardware accelerator to speed up packet processing in NDN router
inferred← citeshttps://doi.org/10.1016/j.comnet.2006.05.005openalex-snapshot
Fast binary and multiway prefix searches for packet forwarding
inferred← citeshttps://doi.org/10.1016/j.comnet.2008.11.017openalex-snapshot
Scalable packet classification with controlled cross-producting
inferred← citeshttps://doi.org/10.1016/j.comnet.2011.09.004openalex-snapshot
An efficient IP address lookup algorithm based on a small balanced tree using entry reduction
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.11.001openalex-snapshot
A high-throughput and high-capacity IPv6 routing lookup system
inferred← citeshttps://doi.org/10.1016/j.comnet.2015.07.012openalex-snapshot
Helix: IP lookup scheme based on helicoidal properties of binary trees
inferred← citeshttps://doi.org/10.1016/j.comnet.2019.106898openalex-snapshot
A power-saving pre-classifier for TCAM-based IP lookup
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2008.04.011openalex-snapshot
DMP-tree: A dynamic M-way prefix tree data structure for strings matching
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.04.001openalex-snapshot
Multilevel length-based classified index table for IP lookups and updates
inferred← citeshttps://doi.org/10.1016/j.jnca.2015.12.009openalex-snapshot
Radient: Scalable, memory efficient name lookup algorithm for named data networking
inferred← citeshttps://doi.org/10.1016/j.jnca.2016.09.007openalex-snapshot
N-FIB: Scalable, memory efficient name-based forwarding
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.03.005openalex-snapshot
Hint-based cache design for reducing miss penalty in HBS packet classification algorithm
inferred← citeshttps://doi.org/10.1016/j.micpro.2008.01.001openalex-snapshot
A fast IP routing lookup architecture for multi-gigabit switching routers based on reconfigurable systems
inferred← citeshttps://doi.org/10.1016/s0140-3664(01)00360-7openalex-snapshot
High-performance IP routing table lookup
inferred← citeshttps://doi.org/10.1016/s0140-3664(01)00419-4openalex-snapshot
Virtual private dial-up services over multi-protocol label switching networks
inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00242-6openalex-snapshot
A pipelined routing lookup scheme with fast updates
inferred← citeshttps://doi.org/10.1016/s0140-3664(03)00055-0openalex-snapshot
High-performance IP forwarding with efficient routing-table update
inferred← citeshttps://doi.org/10.1016/s0141-9331(03)00028-0openalex-snapshot
Reconfigurable memory architecture for scalable IP forwarding engines
inferred← citeshttps://doi.org/10.1049/ip-com:20041153openalex-snapshot
Efficient entry-reduction algorithm for TCAM-based IP forwarding engine
inferred← citeshttps://doi.org/10.1049/ip-com:20050652openalex-snapshot
Address lookup algorithms for IPv6
inferred← citeshttps://doi.org/10.1080/1206212x.2006.11441794openalex-snapshot
An Ip Packet Forwarding Technique Based on A New Structure of Lookup Table
inferred← citeshttps://doi.org/10.1080/1206212x.2008.11441890openalex-snapshot
Hardware Implementation of an Efficient Internet Protocol Routing Filter Design
inferred← citeshttps://doi.org/10.1093/ietcom/e88-b.1.239openalex-snapshot
A Small and Fast IP Forwarding Table Using Hashing
inferred← citeshttps://doi.org/10.1093/ietcom/e89-b.10.2794openalex-snapshot
On Multicasting Based on Nested Mobile Router Information in Network Mobility
inferred← citeshttps://doi.org/10.1093/ietcom/e91-b.11.3715openalex-snapshot
Enhanced PMIPv6 Route Optimization Handover
inferred← citeshttps://doi.org/10.1109/40.917999openalex-snapshot
The iflow address processor
inferred← citeshttps://doi.org/10.1109/4234.922769openalex-snapshot
Performance enhancement of IP forwarding by reducing routing table construction time
inferred← citeshttps://doi.org/10.1109/49.772436openalex-snapshot
On fast address-lookup algorithms
inferred← citeshttps://doi.org/10.1109/49.772440openalex-snapshot
A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers
inferred← citeshttps://doi.org/10.1109/access.2019.2923056openalex-snapshot
Mini-Base Station: A Novel Smart Virtual eNB for 5G and Beyond Mobile Networks
inferred← citeshttps://doi.org/10.1109/aiccsa.2006.205219openalex-snapshot
A Genetic-Driven Instruction Set for High Speed Network Processors
inferred← citeshttps://doi.org/10.1109/aina.2004.1283956openalex-snapshot
A small IP forwarding table using hashing
inferred← citeshttps://doi.org/10.1109/apcc.2003.1274233openalex-snapshot
A multilayer neural network for IP lookup and packet classification
inferred← citeshttps://doi.org/10.1109/apcc.2003.1274271openalex-snapshot
Global IPv6 anycast address lookup with NP
inferred← citeshttps://doi.org/10.1109/apcc.2003.1274285openalex-snapshot
IP lookup in software for large routing tables using DMP-tree data structure
inferred← citeshttps://doi.org/10.1109/apcc.2003.1274350openalex-snapshot
Efficient partition based IPv6 lookup algorithm for packet forwarding
inferred← citeshttps://doi.org/10.1109/apcc.2005.1554073openalex-snapshot
Fast IP Table Lookup Construction Using Lexicographic Prefix Ordering
inferred← citeshttps://doi.org/10.1109/caipt.2017.8320655openalex-snapshot
User effects of a distributed dynamic scheme in PMIPv6 networks
inferred← citeshttps://doi.org/10.1109/ccece.2000.849552openalex-snapshot
Traffic identification using Bayes' classifier
inferred← citeshttps://doi.org/10.1109/ccece.2001.933764openalex-snapshot
Traffic identification using artificial neural network [Internet traffic]
inferred← citeshttps://doi.org/10.1109/ccnc.2006.1593162openalex-snapshot
Parallel tree search: an algorithmic approach for multi-field packet classification
inferred← citeshttps://doi.org/10.1109/chinacom.2009.5339861openalex-snapshot
An active routing prefix caching algorithm for IP address lookup
inferred← citeshttps://doi.org/10.1109/cnsr.2006.16openalex-snapshot
An Efficient Parallel IP Lookup Technique using CREW Based Multiprocessor Organization
inferred← citeshttps://doi.org/10.1109/compsac.2008.69openalex-snapshot
Parallel Table Lookup for Next Generation Internet
inferred← citeshttps://doi.org/10.1109/comsnets.2009.4808884openalex-snapshot
Trie partitioning in distributed PC based routers
inferred← citeshttps://doi.org/10.1109/conect.2002.1039265openalex-snapshot
Reducing TCAM power consumption and increasing throughput
inferred← citeshttps://doi.org/10.1109/ddecs.2011.5783105openalex-snapshot
Effective hash-based IPv6 longest prefix match
inferred← citeshttps://doi.org/10.1109/fmec.2017.7946413openalex-snapshot
Smart Virtual eNB (SVeNB) for 5G mobile communication
inferred← citeshttps://doi.org/10.1109/gcat59970.2023.10353347openalex-snapshot
Enhancing Traffic Engineering Policy in SDN Addressing TCAM limitations using Bloom Filters
inferred← citeshttps://doi.org/10.1109/glocom.2000.892085openalex-snapshot
A trie-based algorithm for IP lookup problem
inferred← citeshttps://doi.org/10.1109/glocom.2001.965852openalex-snapshot
Multiway range trees: scalable IP lookup with fast updates
inferred← citeshttps://doi.org/10.1109/glocom.2001.965853openalex-snapshot
Searching very large routing tables in wide embedded memory
inferred← citeshttps://doi.org/10.1109/glocom.2002.1188550openalex-snapshot
Fast two-dimensional tuple-space based packet classification algorithm
inferred← citeshttps://doi.org/10.1109/glocom.2002.1189047openalex-snapshot
Fast trie-based routing lookup with tiny searchable core
inferred← citeshttps://doi.org/10.1109/glocom.2002.1189048openalex-snapshot
A fully scalable IP forwarding engine based on partitioned lookup table
inferred← citeshttps://doi.org/10.1109/glocom.2006.347openalex-snapshot
NXG06-1: An Efficient IP Address Lookup Algorithm Using a Priority Trie
inferred← citeshttps://doi.org/10.1109/glocom.2008.ecp.446openalex-snapshot
A Novel Level-Based IPv6 Routing Lookup Algorithm
inferred← citeshttps://doi.org/10.1109/glocom.2016.7841736openalex-snapshot
Disjoint Superposition for Reduction of Conjoined Prefixes in IP Lookup for Actual IPv6 Forwarding Tables
inferred← citeshttps://doi.org/10.1109/hpsr.2000.856650openalex-snapshot
Fast and scalable schemes for the IP address lookup problem
inferred← citeshttps://doi.org/10.1109/hpsr.2001.923637openalex-snapshot
Fast IP table lookup and memory reduction
inferred← citeshttps://doi.org/10.1109/hpsr.2005.1503281openalex-snapshot
Binary search in a balanced tree for IP address lookup
inferred← citeshttps://doi.org/10.1109/hpsr.2006.1709678openalex-snapshot
Divide-and-conquer: a scheme for IPv6 address longest prefix matching
inferred← citeshttps://doi.org/10.1109/hpsr.2009.5307435openalex-snapshot
Frugal IP lookup based on a parallel search
inferred← citeshttps://doi.org/10.1109/hpsr.2009.5307440openalex-snapshot
Compress the route table stored in TCAM by using memory filter
inferred← citeshttps://doi.org/10.1109/icact.2006.205970openalex-snapshot
Comparative studies of address lookup algorithms for IPv6
inferred← citeshttps://doi.org/10.1109/icatm.2001.932109openalex-snapshot
Routing interval: a new concept for IP lookups
inferred← citeshttps://doi.org/10.1109/icc.2002.997249openalex-snapshot
An IP packet forwarding technique based on partitioned lookup table
inferred← citeshttps://doi.org/10.1109/icc.2002.997445openalex-snapshot
An optimal location management scheme for minimizing signaling cost in Mobile IP
inferred← citeshttps://doi.org/10.1109/icc.2003.1204193openalex-snapshot
Fast tuple space based packet classification algorithm for two-field conflict free filters
inferred← citeshttps://doi.org/10.1109/icccas.2004.1346255openalex-snapshot
A fast IPv6 route lookup algorithm with hash compression
inferred← citeshttps://doi.org/10.1109/icccas.2006.284996openalex-snapshot
High Speed IP Routing Lookup Algorithm Based on RAM and TCAM
inferred← citeshttps://doi.org/10.1109/icccn.2001.956212openalex-snapshot
Searching very large routing tables in fast SRAM
inferred← citeshttps://doi.org/10.1109/icccn.2001.956214openalex-snapshot
Routing prefix caching in network processor design
inferred← citeshttps://doi.org/10.1109/icccn.2002.1043102openalex-snapshot
Reconfigurable memory architecture for scalable IP forwarding engines
inferred← citeshttps://doi.org/10.1109/icccn.2012.6289233openalex-snapshot
Evaluating and Optimizing IP Lookup on Many Core Processors
inferred← citeshttps://doi.org/10.1109/icccn.2017.8038369openalex-snapshot
MEET-IP: Memory and Energy Efficient TCAM-Based IP Lookup
inferred← citeshttps://doi.org/10.1109/iccke.2015.7365829openalex-snapshot
A longest prefix matching method using Rectangular-Tree
inferred← citeshttps://doi.org/10.1109/iccnmc.2001.962627openalex-snapshot
A fast and updatable IP address lookup scheme
inferred← citeshttps://doi.org/10.1109/icct.2006.341799openalex-snapshot
Decision Tree Based Algorithm for IPv6 Routing Table Lookup
inferred← citeshttps://doi.org/10.1109/icnp.2005.36openalex-snapshot
Shape Shifting Tries for Faster IP Route Lookup
inferred← citeshttps://doi.org/10.1109/icns.2008.7openalex-snapshot
Analysis of SIP-Based IMS Session Establishment Signaling for WiMax-3G Networks
inferred← citeshttps://doi.org/10.1109/icoin.2001.905449openalex-snapshot
Fast update of forwarding tables in Internet router using AS numbers
inferred← citeshttps://doi.org/10.1109/icon.2006.302640openalex-snapshot
DDPM: Dynamic Deterministic Packet Marking for IP Traceback
inferred← citeshttps://doi.org/10.1109/icpads.2001.934871openalex-snapshot
A fast table update scheme for high-performance IP forwarding
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183397openalex-snapshot
Hardware-based IP routing lookup with incremental update
inferred← citeshttps://doi.org/10.1109/icpp.2000.876152openalex-snapshot
Simultaneous multithreading-based routers
inferred← citeshttps://doi.org/10.1109/ideas.2001.938073openalex-snapshot
Prefix trees: new efficient data structures for matching strings of different lengths
inferred← citeshttps://doi.org/10.1109/infcom.1999.752163openalex-snapshot
A fast IP routing lookup scheme for gigabit switching routers
inferred← citeshttps://doi.org/10.1109/infcom.1999.752164openalex-snapshot
Optimal routing table design for IP address lookups under memory constraints
inferred← citeshttps://doi.org/10.1109/infcom.2000.832564openalex-snapshot
On the aggregatability of multicast forwarding state
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019355openalex-snapshot
A distributed dynamic regional location management scheme for Mobile IP
inferred← citeshttps://doi.org/10.1109/infcom.2003.1208659openalex-snapshot
Fast incremental updates for pipelined forwarding engines
inferred← citeshttps://doi.org/10.1109/infcom.2003.1208660openalex-snapshot
Adaptive data structures for IP lookups
inferred← citeshttps://doi.org/10.1109/infcom.2005.1498446openalex-snapshot
High-performance longest prefix matching supporting high-speed incremental updates and guaranteed compression
inferred← citeshttps://doi.org/10.1109/infcom.2007.294openalex-snapshot
Tree, Segment Table, and Route Bucket: A Multi-Stage Algorithm for IPv6 Routing Table Lookup
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302925openalex-snapshot
On the IP routing tables minimization with addresses reassignments
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.168openalex-snapshot
High-Performance Pipelined Architecture for Tree-Based IP Lookup Engine on FPGA
inferred← citeshttps://doi.org/10.1109/iscas.2006.1692964openalex-snapshot
High Speed Routing Lookup IC Design for IPv6
inferred← citeshttps://doi.org/10.1109/iscas.2013.6571891openalex-snapshot
A high throughput ASIC design for IPv6 routing lookup system
inferred← citeshttps://doi.org/10.1109/iscc.2003.1214105openalex-snapshot
Packet classification using independent sets
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358648openalex-snapshot
Dynamic IP router-tables using highest-priority matching
inferred← citeshttps://doi.org/10.1109/iscc.2007.4381472openalex-snapshot
Recursively Partitioned Static IP Router-Tables
inferred← citeshttps://doi.org/10.1109/iscit.2009.5341266openalex-snapshot
An effective longest prefix matching algorithm for speeding up query routing in skip graphs
inferred← citeshttps://doi.org/10.1109/itcc.2004.1286565openalex-snapshot
A high performance, parallel IP lookup technique using distributed memory organization
inferred← citeshttps://doi.org/10.1109/jcn.2001.6596969openalex-snapshot
An efficient IP routing lookup by using routing interval
inferred← citeshttps://doi.org/10.1109/jsac.2014.140112openalex-snapshot
Scalable Packet Classification for Datacenter Networks
inferred← citeshttps://doi.org/10.1109/lcomm.2003.814709openalex-snapshot
A priority TCAM IP-routing lookup scheme
inferred← citeshttps://doi.org/10.1109/lcomm.2005.1461694openalex-snapshot
Efficient binary search for IP address lookup
inferred← citeshttps://doi.org/10.1109/lcomm.2006.1638626openalex-snapshot
Binary search on prefix lengths for ip address lookup
inferred← citeshttps://doi.org/10.1109/mascot.2004.1348308openalex-snapshot
Fast updating scheme of forwarding tables on TCAM
inferred← citeshttps://doi.org/10.1109/mass50613.2020.00071openalex-snapshot
Scalable, Memory-efficient Pending Interest Table of Named Data Networking
inferred← citeshttps://doi.org/10.1109/mcom.2002.1046995openalex-snapshot
Novel hardware architecture for fast address lookups
inferred← citeshttps://doi.org/10.1109/melcon.2012.6196484openalex-snapshot
Mobility management in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/mnet.2003.1220691openalex-snapshot
Search engine implications for network processor efficiency
inferred← citeshttps://doi.org/10.1109/surv.2011.061411.00095openalex-snapshot
Survey and Proposal on Binary Search Algorithms for Longest Prefix Match
inferred← citeshttps://doi.org/10.1109/tbc.2006.884731openalex-snapshot
Source Filtering in IP Multicast Routing
inferred← citeshttps://doi.org/10.1109/tc.2005.107openalex-snapshot
An On-Chip IP Address Lookup Algorithm
inferred← citeshttps://doi.org/10.1109/tc.2007.1037openalex-snapshot
Dynamic Segment Trees for Ranges and Prefixes
inferred← citeshttps://doi.org/10.1109/tc.2007.70776openalex-snapshot
Efficient Prefix Updates for IP Router Using Lexicographic Ordering and Updatable Address Set
inferred← citeshttps://doi.org/10.1109/tc.2008.181openalex-snapshot
Efficient Multidimensional Packet Classification with Fast Updates
inferred← citeshttps://doi.org/10.1109/tc.2009.153openalex-snapshot
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine
inferred← citeshttps://doi.org/10.1109/tc.2010.38openalex-snapshot
Priority Tries for IP Address Lookup
inferred← citeshttps://doi.org/10.1109/tc.2011.86openalex-snapshot
A Classified Multisuffix Trie for IP Lookup and Update
inferred← citeshttps://doi.org/10.1109/tc.2012.193openalex-snapshot
On Adding Bloom Filters to Longest Prefix Matching Algorithms
inferred← citeshttps://doi.org/10.1109/tc.2016.2574347openalex-snapshot
Multi-Inherited Search Tree for Dynamic IP Router-Tables
inferred← citeshttps://doi.org/10.1109/tcomm.2009.03.070146openalex-snapshot
IP address lookup for internet routers using balanced binary search with prefix vector
inferred← citeshttps://doi.org/10.1109/tmc.2002.1081753openalex-snapshot
A novel distributed dynamic location management scheme for minimizing signaling costs in Mobile IP
inferred← citeshttps://doi.org/10.1109/tmc.2010.16openalex-snapshot
SIP-Based IMS Signaling Analysis for WiMax-3G Interworking Architectures
inferred← citeshttps://doi.org/10.1109/tnet.2003.815288openalex-snapshot
Efficient construction of multibit tries for IP lookup
inferred← citeshttps://doi.org/10.1109/tnet.2005.850216openalex-snapshot
Fast incremental updates for pipelined forwarding engines
inferred← citeshttps://doi.org/10.1109/tnet.2005.852885openalex-snapshot
Hardware-based IP routing using partitioned lookup table
inferred← citeshttps://doi.org/10.1109/tnet.2006.872576openalex-snapshot
Longest prefix matching using bloom filters
inferred← citeshttps://doi.org/10.1109/tnet.2009.2022085openalex-snapshot
SUSE: Superior Storage-Efficiency for Routing Tables Through Prefix Transformation and Aggregation
inferred← citeshttps://doi.org/10.1109/tnet.2013.2254124openalex-snapshot
Boundary Cutting for Packet Classification
inferred← citeshttps://doi.org/10.1109/tnet.2018.2815999openalex-snapshot
TCAM-Based IP Address Lookup Using Longest Suffix Split
inferred← citeshttps://doi.org/10.1109/tpds.2013.214openalex-snapshot
A Multi-Index Hybrid Trie for Lookup and Updates
inferred← citeshttps://doi.org/10.1109/tridnt.2006.1649151openalex-snapshot
Building experimental virtual routers with network processors
inferred← citeshttps://doi.org/10.1109/uemcon.2016.7777847openalex-snapshot
On minimizing signaling costs for PMIPv6-based distributed dynamic mobility management
inferred← citeshttps://doi.org/10.1109/wicom.2009.5303224openalex-snapshot
Binary Search on Prefix Covered Levels for IP Address Lookup
inferred← citeshttps://doi.org/10.1111/j.1468-0394.2010.00563.xopenalex-snapshot
CARR: a scalable solution for network packet classification
inferred← citeshttps://doi.org/10.1142/s0219265911003015openalex-snapshot
EXPERIMENTAL EVALUATIONS OF ALGORITHMS FOR IP TABLE MINIMIZATION
inferred← citeshttps://doi.org/10.1145/1095890.1095903openalex-snapshot
A novel reconfigurable hardware architecture for IP address lookup
inferred← citeshttps://doi.org/10.1145/1122971.1122998openalex-snapshot
High-performance IPv6 forwarding algorithm for multi-core and multithreaded network processor
inferred← citeshttps://doi.org/10.1145/1227161.1278376openalex-snapshot
Efficient IP table lookup via adaptive stratified trees with selective reconstructions
inferred← citeshttps://doi.org/10.1145/1369396.1369398openalex-snapshot
Formulating and implementing profiling over adaptive ranges
inferred← citeshttps://doi.org/10.1145/1544012.1544033openalex-snapshot
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
inferred← citeshttps://doi.org/10.1145/1577222.1577266openalex-snapshot
LCSCW2
inferred← citeshttps://doi.org/10.1145/2378956.2378961openalex-snapshot
DXR
inferred← citeshttps://doi.org/10.1145/2435264.2435345openalex-snapshot
Scalable high-throughput architecture for large balanced tree structures on FPGA (abstract only)
inferred← citeshttps://doi.org/10.1145/3613424.3623769openalex-snapshot
NeuroLPM - Scaling Longest Prefix Match Hardware with Neural Networks
inferred← citeshttps://doi.org/10.1145/3789240.3829131openalex-snapshot
XFir: Accelerating New-Flow Setup on Host Servers of a Large Cloud Network
inferred← citeshttps://doi.org/10.1145/863955.863979openalex-snapshot
Longest prefix matching using bloom filters
inferred← citeshttps://doi.org/10.1145/863977.863979openalex-snapshot
Longest prefix matching using bloom filters
inferred← citeshttps://doi.org/10.1145/973097.973100openalex-snapshot
Hancock
inferred← citeshttps://doi.org/10.1145/996546.996550openalex-snapshot
Fast prefix matching of bounded strings
inferred← citeshttps://doi.org/10.1145/997150.997160openalex-snapshot
Tree bitmap
inferred← citeshttps://doi.org/10.1186/1687-1499-2013-152openalex-snapshot
Mobile multicast source support in PMIPv6 networks
inferred← citeshttps://doi.org/10.12783/dtetr/apetc2017/11393openalex-snapshot
An IPv6 Address Lookup Algorithm Based on Multi-bit Trie and Prefix Hierarchy
inferred← citeshttps://doi.org/10.1364/jocn.10.00b126openalex-snapshot
Reimagining Datacenter Topologies With Integrated Silicon Photonics
inferred← citeshttps://doi.org/10.14288/1.0100992openalex-snapshot
Analysis of interworking architectures for IP multimedia subsystem
inferred← citeshttps://doi.org/10.1504/ijsn.2012.050024openalex-snapshot
Managing hybrid packet filter's specifications
inferred← citeshttps://doi.org/10.1587/transcom.e93.b.3144openalex-snapshot
Enhanced PMIPv6 Route Optimization Handover Using PFMIPv6
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.1915openalex-snapshot
Efficient Packet Classification with a Hybrid Algorithm
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.2932openalex-snapshot
IP Lookup Using the Novel Idea of Scalar Prefix Search with Fast Table Updates
inferred← citeshttps://doi.org/10.17762/ijcnis.v10i2.3209openalex-snapshot
A New Multi-threaded and Interleaving Approach to Enhance String Matching for Intrusion Detection Systems
showing the first 200 of 221 · page through all 221
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.