Sciweavers

456 search results - page 38 / 92
» On Routing in Distributed Hash Tables
Sort
View
SIGCOMM
2004
ACM
14 years 4 months ago
A scalable distributed information management system
We present a Scalable Distributed Information Management System (SDIMS) that aggregates information about large-scale networked systems and that can serve as a basic building bloc...
Praveen Yalagandula, Michael Dahlin
SPAA
2006
ACM
14 years 4 months ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
INFOCOM
2005
IEEE
14 years 4 months ago
A distributed adaptive cache update algorithm for the dynamic source routing protocol
On-demand routing protocols use route caches to make routing decisions. Due to frequent topology changes, cached routes easily become stale. To address the cache staleness issue i...
Xin Yu, Zvi M. Kedem
P2P
2005
IEEE
189views Communications» more  P2P 2005»
14 years 4 months ago
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...
Curt Cramer, Thomas Fuhrmann
IPTPS
2003
Springer
14 years 4 months ago
Sloppy Hashing and Self-Organizing Clusters
We are building Coral, a peer-to-peer content distribution system. Coral creates self-organizing clusters of nodes that fetch information from each other to avoid communicating wi...
Michael J. Freedman, David Mazières