Computational geometry: an introduction
Computational geometry: an introduction
Elements of information theory
Elements of information theory
Linear approximation of shortest superstrings
Journal of the ACM (JACM)
Fast parallel string prefix-matching
Theoretical Computer Science
Improved dynamic dictionary matching
Information and Computation
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Routing on longest-matching prefixes
IEEE/ACM Transactions on Networking (TON)
Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Fast address lookups using controlled prefix expansion
ACM Transactions on Computer Systems (TOCS)
On the comparison complexity of the string prefix-matching problem
Journal of Algorithms
IP lookups using multiway and multicolumn search
IEEE/ACM Transactions on Networking (TON)
Packet filtering in high speed networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
On network-aware clustering of Web clients
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Internet packet filter management and rectangle geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Scalable high-speed prefix matching
ACM Transactions on Computer Systems (TOCS)
Heaviest Increasing/Common Subsequence Problems
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
IP Address Lookup Made Fast and Simple
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
Compact histograms for hierarchical identifiers
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
A 2-Level TCAM Architecture for Ranges
IEEE Transactions on Computers
Experimental evaluations of algorithms for IP table minimization
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Distilling router data analysis for faster and simpler dynamic IP lookup algorithms
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Efficient gray-code-based range encoding schemes for packet classification in TCAM
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Longest Prefix Matching (LPM) is the problem of finding which string from a given set is the longest prefix of another, given string. LPM is a core problem in many applications, including IP routing, network data clustering, and telephone network management. These applications typically require very fast matching of bounded strings, i.e., strings that are short and based on small alphabets. We note a simple correspondence between bounded strings and natural numbers that maps prefixes to nested intervals so that computing the longest prefix matching a string is equivalent to finding the shortest interval containing its corresponding integer value. We then present retries, a fast and compact data structure for LPM on general alphabets. Performance results show that retries often outperform previously published data structures for IP look-up. By extending LPM to general alphabets, retries admit new applications that could not exploit prior LPM solutions designed for IP look-ups.