Sciweavers

109 search results - page 4 / 22
» A Small IP Forwarding Table Using Hashing
Sort
View
JSA
2006
113views more  JSA 2006»
13 years 7 months ago
A power-efficient TCAM architecture for network forwarding tables
Stringent memory access and search speed requirements are two of the main bottlenecks in wire speed processing. Most viable search engines are implemented in content addressable m...
Taskin Koçak, Faysal Basci
ICC
2009
IEEE
109views Communications» more  ICC 2009»
13 years 5 months ago
Loop-Free Forwarding Table Updates with Minimal Link Overflow
The forwarding paths in an IP network may change due to a link failure, network equipment maintenance, or reconfiguration of link weights. The forwarding tables in the routers need...
Lei Shi, Jing Fu, Xiaoming Fu
ESA
2008
Springer
129views Algorithms» more  ESA 2008»
13 years 9 months ago
More Robust Hashing: Cuckoo Hashing with a Stash
Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that there...
Adam Kirsch, Michael Mitzenmacher, Udi Wieder
INFOCOM
2003
IEEE
14 years 27 days ago
Fast Incremental Updates for Pipelined Forwarding Engines
— Pipelined ASIC architectures are increasingly being used in forwarding engines for high speed IP routers. We explore optimization issues in the design of memory-efficient data...
Anindya Basu, Girija J. Narlikar
ICNP
2009
IEEE
14 years 2 months ago
Scalable IP Lookups using Shape Graphs
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...