|
Volumn 3, Issue , 1999, Pages 1429-1436
|
A fast IP routing lookup scheme for gigabit switching routers
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ADDRESS LOOKUP;
DESIGN ISSUES;
FORWARDING TABLES;
IP PACKETS;
IP ROUTERS;
IP ROUTING;
IP ROUTING LOOKUP;
LONGEST-PREFIX MATCHING;
LOOKUPS;
LOW COSTS;
MEMORY ACCESS;
NEXT-HOP;
ROUTE LOOKUP;
ROUTING ENTRY;
ROUTING LOOKUP;
ROUTING TABLE;
WORST CASE;
COMPUTER HARDWARE;
STATIC RANDOM ACCESS STORAGE;
COMPUTER ARCHITECTURE;
CONGESTION CONTROL (COMMUNICATION);
DATA COMMUNICATION SYSTEMS;
NETWORK PROTOCOLS;
PACKET SWITCHING;
PIPELINE PROCESSING SYSTEMS;
RANDOM ACCESS STORAGE;
RESPONSE TIME (COMPUTER SYSTEMS);
ROUTERS;
STORAGE ALLOCATION (COMPUTER);
TABLE LOOKUP;
TELECOMMUNICATION TRAFFIC;
ROUTERS;
INTERNET;
GIGABIT SWITCHING ROUTERS;
INTERNET PROTOCOL (IP) ROUTING LOOKUP METHOD;
|
EID: 0032650380
PISSN: 0743166X
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/INFCOM.1999.752163 Document Type: Conference Paper |
Times cited : (65)
|
References (13)
|