85 search results - page 10 / 17 » Small Forwarding Tables for Fast Routing Lookups |
ITIIS
2010
13 years 1 months ago
2010
Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local informa...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
It is becoming apparent that the next generation IP route lookup architecture needs to achieve speeds of 100Gbps and beyond while supporting both IPv4 and IPv6 with fast real-time ...
CCGRID
2008
IEEE
14 years 1 months ago
2008
IEEE
Peer-to-peer overlays envision a single overlay substrate that can be used (possibly simultaneously) by many applications, but current overlays either target fast, few-hop lookups...
NSDI
2004
13 years 8 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
ESORICS
2005
Springer
14 years 19 days 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 ...