Sciweavers

20 search results - page 1 / 4
» Dynamic Tree Bitmap for IP Lookup and Update
Sort
View
ICN
2007
Springer
13 years 11 months ago
Dynamic Tree Bitmap for IP Lookup and Update
We propose a data structure–dynamic tree bitmap–for the representation of dynamic IP router tables that must support very high lookup and update rates. In fact, the dynamic tr...
Sartaj Sahni, Haibin Lu
CCR
2004
153views more  CCR 2004»
13 years 4 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
IFIP
2009
Springer
13 years 11 months ago
A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond
New Internet services and technologies call for higher packet switching capacities in the core network. Thus, a performance bottleneck arises at the backbone routers, as forwarding...
Domenic Teuchert, Simon Hauger
INFOCOM
2010
IEEE
13 years 2 months ago
FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps
It is becoming apparent that the next generation IP route lookup architecture needs to achieve speeds of 100Gbps and beyond while supporting both IPv4 and IPv6 with fast real-time ...
Masanori Bando, H. Jonathan Chao
GLOBECOM
2007
IEEE
13 years 11 months ago
Power Efficient IP Lookup with Supernode Caching
— In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based...
Lu Peng, Wencheng Lu, Lide Duan