By Topic

Optimization of the Routing Table Lookup Algorithm for IPv6

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
$33 $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)
Jinxian Lin ; Network Inf. Center, Fuzhou Univ., Fuzhou ; Huimin Li

With the extensive application of IPv6 protocol, the traditional IPv4 routing table lookup algorithms no longer satisfy the need of routing forward in the IPv6 network environment. So we optimize the routing table lookup algorithm to adapt for IPv6 that employs Bloom filters to realize parallel longest prefix match. The algorithm efficiently narrows the scope of the search, reduces the average time of hash probe per lookup, and thereby enhances lookup speed.

Published in:

Genetic and Evolutionary Computing, 2008. WGEC '08. Second International Conference on

Date of Conference:

25-26 Sept. 2008