346 search results - page 29 / 70 » Routing networks for distributed hash tables |
GCC
2004
Springer
14 years 28 days ago
2004
Springer
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two p...
SIGCOMM
2004
ACM
14 years 29 days ago
2004
ACM
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...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
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...
ICDCS
2003
IEEE
14 years 25 days ago
2003
IEEE
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
IJNSEC
2008
13 years 7 months ago
2008
Current anonymous systems either use a small, fixed core set of mixes or randomly choose a sequence of peer nodes to form anonymous paths/tunnels. The resulting paths are fragile ...