57 search results - page 2 / 12 » PaxonDHT: Achieving Consensus in Distributed Hash Tables |
P2P
2006
IEEE
13 years 11 months ago
2006
IEEE
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
NDSS
2008
IEEE
13 years 11 months ago
2008
IEEE
We study the problem of reliably searching for resources in untrusted peer-to-peer networks, where a significant portion of the participating network nodes may act maliciously to...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
In Peer-to-Peer networks based on consistent hashing and ring topology each server is responsible for an interval chosen (pseudo-)randomly on a circle. The topology of the network...
TON
2010
12 years 12 months ago
2010
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). ...
ANCS
2009
ACM
13 years 3 months ago
2009
ACM
As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing e...