Sciweavers

51 search results - page 6 / 11
» High-performance IP routing table lookup
Sort
View
AINA
2004
IEEE
14 years 1 months ago
A Small IP Forwarding Table Using Hashing
As the demand for high bandwidth on the Internet increases, it is required to build next generation routers with the capability of forwarding multiple millions of packets per secon...
Yeim-Kuan Chang, Wen-Hsin Cheng
FCCM
2009
IEEE
123views VLSI» more  FCCM 2009»
14 years 1 months ago
Scalable High Throughput and Power Efficient IP-Lookup on FPGA
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. Due to the available on-chip memory and the number of I/O pins of Field Programmab...
Hoang Le, Viktor K. Prasanna
CCR
2004
153views more  CCR 2004»
13 years 9 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
ICCCN
2007
IEEE
14 years 4 months ago
Reduce IP Address Fragmentation through Allocation
— The scalability of Internet addressing and routing has been a serious issue and becomes a more urgent problem today because of driving factors like IPv6. A radical impacting el...
Mei Wang, Larry Dunn, Wei Mao, Tao Chen
MICRO
2003
IEEE
128views Hardware» more  MICRO 2003»
14 years 3 months ago
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
Stefanos Kaxiras, Georgios Keramidas