Sciweavers

165 search results - page 3 / 33
» Fast Routing Table Lookup Using CAMs
Sort
View
INFOCOM
2002
IEEE
14 years 2 months ago
Scalable IP Lookup for Programmable Routers
Abstract— Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services...
David E. Taylor, John W. Lockwood, Todd S. Sproull...
INFOCOM
2000
IEEE
14 years 2 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
TC
2010
13 years 8 months ago
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...
Yeim-Kuan Chang, Yung-Chieh Lin, Cheng-Chien Su
INFOCOM
1999
IEEE
14 years 2 months ago
A Fast IP Routing Lookup Scheme for Gigabit Switching Routers
One of the key design issues for the new generation IP routers is the route lookup mechanism. For each incoming IP packet, the IP routing requires to perform a longest prefix match...
Nen-Fu Huang, Shi-Ming Zhao, Jen-Yi Pan, Chi-An Su
ICC
2000
IEEE
124views Communications» more  ICC 2000»
14 years 2 months ago
A Fast IP Routing Lookup Scheme
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 look...
Pi-Chung Wang, Yaw-Chung Chen, Chia-Tai Chan