Skip to Main Content Area
CPS-VO
Contact Support
Browse
Calendar
Announcements
Repositories
Groups
Search
Search for Content
Search for a Group
Search for People
Search for a Project
Tagcloud
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Read-only archive of site from September 29, 2023.
CPS-VO
dynamic random access memory
biblio
On Adding Bloom Filters to Longest Prefix Matching Algorithms
Submitted by BrandonB on Wed, 05/06/2015 - 10:52am
Routing
longest prefix matching
Memory management
multihashing
parallel multiple-hashing algorithm
parallel-multiple hashing algorithm
performance evaluation
PMH algorithm
prefix matching algorithms
router
level algorithm
Routing protocols
SRAM
SRAM chips
static random access memory
System-on-a-chip
TCAM technology
ternary content addressable memory technology
wire-speed packet forwarding
Generators
binary search on levels
Bloom filter
Bloom filters
data structures
DRAM
DRAM chips
dynamic random access memory
fast parallel matching
binary search
hardware architectures
Indexes
internet
Internet Protocol
Internet routers
IP address lookup
IP networks
leaf pushing