456 search results - page 29 / 92 » On Routing in Distributed Hash Tables |
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— During recent years, Distributed Hash Tables (DHTs) have been extensively studied by the networking community through simulation and analysis, but until recently were not adopt...
SPAA
2009
ACM
14 years 10 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
SIGCOMM
2000
ACM
14 years 2 months ago
2000
ACM
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and th...
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
In a network consisting of several thousands computers, the occurrence of faults is unavoidable. Being able to test the behaviour of a distributed program in an environment where ...
DEBS
2010
ACM
13 years 4 months ago
2010
ACM
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...