By Topic

Effective hash-based IPv6 longest prefix match

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

2 Author(s)
Tobola, J. ; Fac. of Inf. Technol., Brno Univ. of Technol., Brno, Czech Republic ; Korenek, J.

With the growing speed of computer networks, the core routers have to increase performance of longest prefix match (LPM) operation on IP address. While existing LPM algorithms are able to achieve high throughput for IPv4 addresses, the IPv6 processing speed is limited. In this paper we propose a new Hast-Tree Bitmap algorithm for fast longest prefix match for both IPv4 and IPv6 networks. The algorithm is able to achieve high throughput for a long IPv6 addresses by fast hash function which is used to jump over the sparse part of the IP prefix tree. The proposed algorithm was mapped to the highly pipelined hardware architecture, which offers well balanced resource requirements for IPv6 look-up and is able to achieve a wire-speed throughput for 100 Gbps networks.

Published in:

Design and Diagnostics of Electronic Circuits & Systems (DDECS), 2011 IEEE 14th International Symposium on

Date of Conference:

13-15 April 2011