Priority Tries for IP Address Lookup

DOI10.1109/TC.2010.38MaRDI QIDQ5280750zbMATH OpenOpenAlexFDO

Authors Lim Hyesook, Changhoon Yim, Earl E. jun. Swartzlander

Publication date 27 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2010.38

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1983254
• A longest prefix first search tree for IP lookup
• Improved IP lookup technology for trie-based data structures
• scientific article; zbMATH DE number 1998344
• A cache-based internet protocol address lookup architecture
• Experimental and Efficient Algorithms
• Adaptive data structures for IP lookups

Cited in

(3)

• Branch tire packet classification algorithm based on single-linkage clustering
• Multilevel length-based classified index table for IP lookups and updates
• Improved IP lookup technology for trie-based data structures

This page was built for publication: Priority Tries for IP Address Lookup

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