Sciweavers

109 search results - page 5 / 22
» A Small IP Forwarding Table Using Hashing
Sort
View
CCR
2004
153views more  CCR 2004»
13 years 7 months ago
Tree bitmap: hardware/software IP lookups with incremental updates
IP address lookup is challenging for high performance routers because it requires a longest matching prefix at speeds of up to 10 Gbps (OC-192). Existing solutions have poor updat...
Will Eatherton, George Varghese, Zubin Dittia
AINA
2009
IEEE
14 years 2 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
TON
2010
138views more  TON 2010»
13 years 2 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
INFOCOM
2010
IEEE
13 years 6 months ago
On the Aggregatability of Router Forwarding Tables
—The rapid growth of global routing tables has raised concerns among many Internet Service Providers. The most immediate concern regarding routing scalability is the size of the ...
Xin Zhao, Yaoqing Liu, Lan Wang, Beichuan Zhang
ICPADS
2002
IEEE
14 years 17 days ago
Hardware-based IP Routing Lookup with Incremental Update
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching ...
Pi-Chung Wang, Chia-Tai Chan, Shuo-Cheng Hu, Yu-Ch...