Sciweavers

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

11

INFOCOM
1999
IEEE

favoriteEmaildiscussreport

91views Communications» more INFOCOM 1999»

Optimal Routing Table Design for IP Address Lookups Under Memory Constraints

13 years 8 months ago

Optimal Routing Table Design for IP Address Lookups Under Memory Constraints

Download www.hpl.hp.com

Gene Cheung, Steven McCanne

Real-time Traffic

Communications | INFOCOM 1999 |

claim paper

Related Content

» A Fast IP Routing Lookup Scheme

» A cachebased internet protocol address lookup architecture

» A Fast IP Routing Lookup Scheme for Gigabit Switching Routers

» A longest prefix first search tree for IP lookup

» Hardwarebased IP Routing Lookup with Incremental Update

» Using forgetful routing to control BGP table size

» Shape Shifting Tries for Faster IP Route Lookup

» Scalable highthroughput SRAMbased architecture for IPlookup using FPGA

» Scalable IP Lookup for Programmable Routers

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	INFOCOM
Authors	Gene Cheung, Steven McCanne

Comments (0)