By Topic

Range Trees with variable length comparisons

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

3 Author(s)
Sourdis, I. ; Comput. Eng., Tech. Univ. Delft, Delft, Netherlands ; de Smet, R. ; Gaydadjiev, G.N.

In this paper we introduce a new data structure for address lookup, a new tree structure which improves on the existing range trees allowing shorter comparisons than the address width. The proposed scheme shares among multiple concurrent comparisons common address prefixes and suffixes and also omits address parts not required for computing a next node branch. In so doing, for a given memory bandwidth, we achieve a larger number of concurrent comparisons than the original range tree. This results in less memory accesses and lower latency per lookup. Performance scales better as the address width and the number of address ranges increase. We describe the rules employed to construct the proposed structure and offer two heuristics which generate the ldquoconfigurationrdquo of the decision tree given a set of address ranges. The proposed range tree with variable-length comparisons (RT-VLC) has up to 50% less tree-levels than the original range tree and its memory requirements are 50% to 2times that of a linear search approach.

Published in:

High Performance Switching and Routing, 2009. HPSR 2009. International Conference on

Date of Conference:

22-24 June 2009