Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

38

ICC
2000
IEEE

favoriteEmaildiscussreport

124views Communications» more ICC 2000»

A Fast IP Routing Lookup Scheme

14 years 3 months ago

A Fast IP Routing Lookup Scheme

Download www.csie.nctu.edu.tw

Abstract—A major issue in router design for the next generation Internet is the fast IP address lookup mechanism. The existing scheme by Huang et al. performs the IP address lookup in hardware in which the forwarding table can be compressed to fit into reasonable-size SRAM, and a lookup can be accomplished in three memory accesses. In this letter, we claim that with a little extra memory, it is able to further reduce the lookup time to two memory accesses.

Pi-Chung Wang, Yaw-Chung Chen, Chia-Tai Chan

Real-time Traffic

Address Lookup Mechanism | Communications | ICC 2000 | IP Address Lookup | Memory Accesses |

claim paper

Related Content

» A Fast IP Routing Lookup Scheme for Gigabit Switching Routers

» High Performance IP Routing Table Lookup using CPU Caching

» A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on BTree

» Multiway range trees scalable IP lookup with fast updates

» Power Efficient IP Lookup with Supernode Caching

» Scalable IP Routing Lookup in Next Generation Network

» Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms

» FlashTrie Hashbased PrefixCompressed Trie for IP Route Lookup Beyond 100Gbps

» Small Forwarding Tables for Fast Routing Lookups

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	ICC
Authors	Pi-Chung Wang, Yaw-Chung Chen, Chia-Tai Chan

Comments (0)