456 search results - page 46 / 92 » On Routing in Distributed Hash Tables |
INFOSCALE
2006
ACM
14 years 5 months ago
2006
ACM
A fundamental paradigm in P2P is that of a large community of intermittently-connected nodes that cooperate to share files. Because nodes are intermittently connected, the P2P co...
WISE
2002
Springer
14 years 3 months ago
2002
Springer
With the flurry of research on P2P computing, many P2P technical challenges have emerged, one of which is how to efficiently locate desired resources. Advances have been made in...
CN
2010
13 years 11 months ago
2010
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
WEA
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ...
JNW
2006
13 years 11 months ago
2006
-- Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems a...