By Topic

A parallel IP-address forwarding approach based on partitioned lookup table techniques

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)
Yiluo Song ; Dept. of Comput. & Inf. Sci., Univ. of Massachusetts Dartmouth, North Dartmouth, MA, USA ; E. Aboelela

As traffic on the Internet has increased exponentially, it is vital that Internet routers handle the received packets faster. When a router receives a packet, it has to make a decision where to send it next. To forward an IP packet, the routers need to lookup the destination address of the received packet in the forwarding table, implement forwarding algorithms, then forward the packet to the appropriate next hop or outgoing port. We discuss a parallel approach that combines an IP packet forwarding technique based on a partitioned lookup table with linear search on prefix lengths, binary search on prefix lengths, and LC (level-compressed) trie. Simulation results show that the proposed partition schemes speeds up the IP address lookup process.

Published in:

Local Computer Networks, 2004. 29th Annual IEEE International Conference on

Date of Conference:

16-18 Nov. 2004