By Topic

Multi-dimensional prefix matching using line search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Waldvogel, M. ; Dept. of Comput. Sci., Washington Univ., St. Louis, MO, USA

With the increasing popularity of firewalls, virtual private networks (VPNs) and quality of service (QoS) routing, packet classification becomes increasingly important in the Internet. The high-performance solutions known so far strongly rely on certain properties of the filter database to match against, such as a small number of distinct prefixes or the absence of conflicts. We present line search as a two-dimensional generalization of the one-dimensional binary search on prefix lengths exploiting the advantage given by the different approach therein. This algorithm also works best on the filter databases that are expected to occur most often, but degrades gracefully when these assumptions no longer hold. We also show how to efficiently extend the algorithm to a complete five-dimensional Internet protocol (IP) and transport header match

Published in:

Local Computer Networks, 2000. LCN 2000. Proceedings. 25th Annual IEEE Conference on

Date of Conference: