By Topic

PTSPM: A Novel PTS Based Prefix Matching Scheme with Reduced Collision for IPv6 Routers

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)
Srinivasan, T. ; Dept. of Comput. Sci. & Eng., Sri Venkateswara Coll. of Eng., Sriperumbudur ; Vijayalakshmi, D.

Internet address lookup is a challenging problem because of the increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. Routing lookup involves computation of best matching prefix for which existing solutions scale poorly when router traffic increases or when employed for IPv6 address lookup. Our paper describes a novel parallel ternary search based prefix matching (PTSPM) scheme with reduced collision for IPv6 routers. This approach employs multiple hashing on reduced number of hash tables on which parallel ternary search (PTS) on levels is applied. This scheme handles large number of prefixes generated by controlled prefix expansion by reducing collision and distributing load fairly in the hash buckets thus providing faster worst case and average case lookups. The approach we describe is fast, simple, scalable, parallelizable, and flexible.

Published in:

Communication Networks and Services Research, 2007. CNSR '07. Fifth Annual Conference on

Date of Conference:

14-17 May 2007