A Parallel IP-Address Forwarding Approach Based on Partitioned Lookup Table Techniques

Authors:
Yiluo Song;Emad Aboelela
Affiliations:
University of Massachusetts Dartmouth, MA;University of Massachusetts Dartmouth, MA
Venue:
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Year:
2004

Citing 0
Cited 2

A proposed IP multicast hardware-routing algorithm using partitioned lookup table

TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Hardware acceleration for media/transaction applications in network processors

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

As the traffic on the Internet has exponentially increased, it is vital that the 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. In this paper we discuss a parallel approach that combines an IP packet forwarding technique based on partitioned lookup table with linear search on prefix lengths, binary search on prefix lengths, and LC trie. Simulation results show that the proposed partition schemes speeds up the IP address lookup process.