Adaptive data structures for IP lookups

DOI10.1145/1064546.1064548MaRDI QIDQ5463451zbMATH OpenOpenAlexFDO

Authors Ioannis Ioannidis, Ananth Grama, Mikhail J. Atallah

Publication date 4 August 2005

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1064546.1064548

zbMATH Keywords

IP lookupslevel compression

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1998344
• Efficient IP table lookup via adaptive stratified trees with selective reconstructions
• Algorithms – ESA 2004
• Level compressed DAGs for lookup tables
• Multiway range trees: scalable IP lookup with fast updates

Cited in

(6)

• Level compressed DAGs for lookup tables
• New Data Structures for IP Lookup and Conflict Detection
• scientific article; zbMATH DE number 1950680 (Why is no real title available?)
• scientific article; zbMATH DE number 1998344 (Why is no real title available?)
• scientific article; zbMATH DE number 2030084 (Why is no real title available?)
• Priority Tries for IP Address Lookup

This page was built for publication: Adaptive data structures for IP lookups

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