165 search results - page 18 / 33 » Fast Routing Table Lookup Using CAMs |
ESORICS
2005
Springer
15 years 7 months ago
2005
Springer
Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes. Designers of such systems want them used in ...
103
click to vote
CG
2005
Springer
15 years 1 months ago
2005
Springer
We propose an efficient framework for dynamic cloud rendering. Base on the proposed simplified lighting model, the Shadow Relation Table (SRT) and Metaball Lighting Texture Databa...
IPPS
2006
IEEE
15 years 7 months ago
2006
IEEE
Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in o...
239
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
102
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— The recent trend of rapid increase in routing table sizes at routers comprising the Internet’s core is posing a serious challenge to the current Internet’s scalability, ava...