Sciweavers

16 search results - page 3 / 4
» Optimal Routing Table Design for IP Address Lookups Under Me...
Sort
View
TON
2010
138views more  TON 2010»
12 years 11 months ago
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
Fong Pong, Nian-Feng Tzeng
NETWORKING
2008
13 years 6 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
AINA
2009
IEEE
13 years 11 months ago
A Pipelined IP Forwarding Engine with Fast Update
IP address lookup is one of the most important functionalities in the router design. To meet the requirements in high speed routers consisting of linecards with 40Gbps transfer ra...
Yeim-Kuan Chang, Yen-Cheng Liu, Fang-Chen Kuo
INFOCOM
2005
IEEE
13 years 10 months ago
Practical routing-layer support for scalable multihoming
— The recent trend of rapid increase in routing table sizes at routers comprising the Internet’s core is posing a serious challenge to the current Internet’s scalability, ava...
Ramakrishna Gummadi, Ramesh Govindan
SIGCOMM
2009
ACM
13 years 11 months ago
Hash, don't cache: fast packet forwarding for enterprise edge routers
As forwarding tables and link speeds continue to grow, fast packet forwarding becomes increasingly challenging for enterprise edge routers. Simply building routers with ever large...
Minlan Yu, Jennifer Rexford