Sciweavers

343 search results - page 14 / 69
» Weighted distributed hash tables
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 10 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
ASIACRYPT
2009
Springer
14 years 3 months ago
Linearization Framework for Collision Attacks: Application to CubeHash and MD6
In this paper, an improved differential cryptanalysis framework for finding collisions in hash functions is provided. Its principle is based on linearization of compression functi...
Eric Brier, Shahram Khazaei, Willi Meier, Thomas P...
IPTPS
2004
Springer
14 years 1 months ago
UsenetDHT: A Low Overhead Usenet Server
UsenetDHT is a system that reduces the storage and bandwidth resources required to run a Usenet server by spreading the burden of data storage across participants. UsenetDHT distr...
Emil Sit, Frank Dabek, James Robertson
SEMWEB
2004
Springer
14 years 1 months ago
Constructing and Querying Peer-to-Peer Warehouses of XML Resources
We present KADOP, a distributed infrastructure for warehousing XML resources in a peer-to-peer framework. KADOP allows users to build a shared, distributed repository of resources...
Serge Abiteboul, Ioana Manolescu, Nicoleta Preda
TON
2010
138views more  TON 2010»
13 years 3 months ago
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
Fong Pong, Nian-Feng Tzeng