A fast method for IP lookups based on Bloom filters

DOI10.3969/J.ISSN.1006-7043.201306057MaRDI QIDQ5260188zbMATH OpenFDO

Authors Ming Yu, Zhenan Wang, Dongju Wang

Publication date 29 June 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.1006-7043.201306057

zbMATH Keywords

Bloom filterinternetIP networklongest prefix matchingIP routing lookupsparallel queryprefix aggregationroute table

Mathematics Subject Classification ID

Data structures (68P05) Internet topics (68M11)

Recommendations

• scientific article; zbMATH DE number 1998344
• Algorithms – ESA 2004
• Efficient IP table lookup via adaptive stratified trees with selective reconstructions
• Fast binary and multiway prefix searches for packet forwarding
• XOR-based schemes for fast parallel IP lookups

Cited in

(1)

• Research on method of restraining the growth to the BGP routing table

This page was built for publication: A fast method for IP lookups based on Bloom filters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5260188)