165 search results - page 15 / 33 » Fast Routing Table Lookup Using CAMs |
90
Voted
IEEEARES
2006
IEEE
15 years 4 months ago
2006
IEEE
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
92
Voted
JNW
2006
14 years 10 months ago
2006
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
ICCAD
2006
IEEE
15 years 7 months ago
2006
IEEE
The wire length estimation is the bottleneck of packing based block placers. To cope with this problem, we present a fast wire length estimation method in this paper. The key idea...
74
Voted
DSOM
2003
Springer
15 years 3 months ago
2003
Springer
Building self-maintained overlay networks for message routing has recently attracted significant research interest [5–9]. All suggested solutions have a common goal: To build an...
94
Voted
ISPD
2010
ACM
15 years 5 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...