Sciweavers

165 search results - page 16 / 33
» Fast Routing Table Lookup Using CAMs
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
Jinyang Li, Jeremy Stribling, Robert Morris, M. Fr...
74
Voted
ICNP
2003
IEEE
15 years 3 months ago
Packet Classification Using Extended TCAMs
CAMs are the most popular practical method for implementing packet classification in high performance routers. Their principal drawbacks are high power consumption and inefficient...
Ed Spitznagel, David E. Taylor, Jonathan S. Turner
77
Voted
3DIM
2005
IEEE
15 years 3 months ago
Fast Simultaneous Alignment of Multiple Range Images Using Index Images
This paper describes a fast, simultaneous alignment method for a large number of range images. Generally the most time-consuming task in aligning range images is searching corresp...
Takeshi Oishi, Atsushi Nakazawa, Ryo Kurazume, Kat...
ICCD
2004
IEEE
76views Hardware» more  ICCD 2004»
15 years 7 months ago
Technique to Eliminate Sorting in IP Packet Forwarding Devices
This paper will present a solution to eliminate the requirements of sorting by prefix length in IP forwarding devices using Ternary Content Addressable Memories (TCAMs). This will...
Raymond W. Baldwin, Enrico Ng
ICNP
2009
IEEE
15 years 4 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...