Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Interconnections: bridges and routers
Interconnections: bridges and routers
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Two- and three-dimensional point location in rectangular subdivisions
Journal of Algorithms
Trading packet headers for packet processing
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
Scalable high speed IP routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
IEEE/ACM Transactions on Networking (TON)
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)
Packet classification using tuple space search
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification on multiple fields
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Faster Searching in Tries and Quadtrees - An Analysis of Level Compression
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
IP Address Lookup Made Fast and Simple
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Multi-dimensional prefix matching using line search
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
IP switching and gigabit routers
IEEE Communications Magazine
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
Indra: A peer-to-peer approach to network intrusion detection and prevention
WETICE '03 Proceedings of the Twelfth International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
Fast prefix matching of bounded strings
Journal of Experimental Algorithmics (JEA)
Scalable, memory efficient, high-speed IP lookup algorithms
IEEE/ACM Transactions on Networking (TON)
Routing Table Partitioning for Speedy Packet Lookups in Scalable Routers
IEEE Transactions on Parallel and Distributed Systems
End-host controlled multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
A lookup algorithm based on multiple tables for high-speed routers
Journal of High Speed Networks
O(logW) multidimensional packet classification
IEEE/ACM Transactions on Networking (TON)
IP Routing table compaction and sampling schemes to enhance TCAM cache performance
Journal of Systems Architecture: the EUROMICRO Journal
Optimized memory based accelerator for scalable pattern matching
Microprocessors & Microsystems
End-host controlled multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Scalable architecture for 135 GBPS IPv6 lookup on FPGA (abstract only)
Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays
You can get there from here: routing in the internet
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
DXR: towards a billion routing lookups per second in software
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.01 |
Finding the longest matching prefix from a database of keywords is an old problem with a number of applications, ranging from dictionary searches to advanced memory management to computational geometry. But perhaps today's most frequent best matching prefix lookups occur in the Internet, when forwarding packets from router to router. Internet traffic volume and link speeds are rapidly increasing; at the same time, a growing user population is increasing the size of routing tables against which packets must be matched. Both factors make router prefix matching extremely performance critical.In this paper, we introduce a taxonomy for prefix matching technologies, which we use as a basis for describing, categorizing, and comparing existing approaches. We then present in detail a fast scheme using binary search over hash tables, which is especially suited for matching long addresses, such as the 128 bit addresses proposed for use in the next generation Internet Protocol, IPv6. We also present optimizations that exploit the structure of existing databases to further improve access time and reduce storage space.