Back to Results
First PageMeta Content
Arrays / Hashing / Data / Associative arrays / Bloom filter / Hash table / Trie / Lookup table / Hash function / Search algorithms / Computing / Computer programming


Longest Prefix Matching Using Bloom Filters Sarang Dharmapurikar Praveen Krishnamurthy David E. Taylor [removed] [removed] [removed] Washington University in Saint Louis 1 Brookings Drive
Add to Reading List

Document Date: 2003-07-24 11:26:24


Open Document

File Size: 205,67 KB

Share Result on Facebook

City

Louis / /

Country

Germany / /

Currency

USD / /

/

Facility

Washington University / /

IndustryTerm

semiconductor technology / Internet Registries / Internet Service Providers / web caching / traffic conditions using commodity memory technology / efficient algorithm / search proceeds / binary search / search using multiple bits / Internet routers / memory bank / dedicated memory bank / Internet Protocol / control processor / search architecture / logic device / hardware technology / binary search path / Internet Protocol Version / memory device / offchip / search engine / memory devices / worst case search / rst algorithm / control processors / Internet community / using a custom logic device / /

OperatingSystem

BSD / /

Organization

ASIC / X. Thus / Internet Assigned Numbers Authority / Washington University / /

Person

Burton H. Bloom / Praveen Krishnamurthy David / /

Position

architect / Routers General / Hash Table Manager / /

ProgrammingLanguage

ANSI C / /

ProvinceOrState

Missouri / IPv6 / /

Technology

256 port router / IPv6 / efficient algorithm / RAM / rst algorithm / ASIC / Separate control processors / Internet routers / ANSI C / SRAM technologies / semiconductor technology / IP / TCAM technology / separate control processor / traffic conditions using commodity memory technology / ASIC technology / caching / search engine / IPv4 / Random Access / hardware technology / simulation / SRAM / LPM algorithms / Integrated Circuits / /

SocialTag