Cart (Loading....) | Create Account
Close category search window
 

IP lookup in software for large routing tables using DMP-tree data structure

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)
Yazdani, N. ; Dept. of ECE, Tehran Univ., Iran ; Mohammadi, H.

Making IP lookup fast and scalable is crucial in the Internet routers due to the fast increase in line speeds and routing table sizes. In this paper, we use DMP-Tree (dynamic M-way prefix tree) data structure to perform IP lookup in software. Experimental results show that our method is fast enough to support multi gigabit per second lines and it scales very well to routing tables with millions of entries. The proposed solution scales well to IPv6 with a reasonable overhead.

Published in:

Communications, 2003. APCC 2003. The 9th Asia-Pacific Conference on  (Volume:3 )

Date of Conference:

21-24 Sept. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.