Can I read Scalable High-speed Prefix Matching on EtoBox?

Scalable High-speed Prefix Matching by Marcel Waldvogel; George Varghese; Jon Turner; Bernhard Plattner is a Computer Science article available to read on EtoBox.

What is Scalable High-speed Prefix Matching about?

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.

Who reads Scalable High-speed Prefix Matching?

Author

Marcel Waldvogel; George Varghese; Jon Turner; Bernhard Plattner

Publisher

ACM

Published

2001

Language

EN

Field

Computer Science (Physical Sciences)