Sciweavers

1080 search results - page 28 / 216
» Distributed Hash Tables
Sort
View
CN
2010
136views more  CN 2010»
15 years 2 months ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
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...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
SIGCOMM
2004
ACM
15 years 8 months ago
A layered naming architecture for the internet
Currently the Internet has only one level of name resolution, DNS, which converts user-level domain names into IP addresses. In this paper we borrow liberally from the literature ...
Hari Balakrishnan, Karthik Lakshminarayanan, Sylvi...
NSDI
2004
15 years 3 months ago
Democratizing Content Publication with Coral
CoralCDN is a peer-to-peer content distribution network that allows a user to run a web site that offers high performance and meets huge demand, all for the price of a cheap broad...
Michael J. Freedman, Eric Freudenthal, David Mazi&...
107
Voted
KIVS
2005
Springer
15 years 8 months ago
Making Chord go mobile
: The Chord protocol is a structured Peer-to-Peer (P2P) protocol based on distributed hash tables (DHT). By using hash keys to identify the nodes in the network and also the shared...
Stefan Zöls, Rüdiger Schollmeier, Wolfga...
IMC
2007
ACM
15 years 4 months ago
A global view of kad
Distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to organize peers in a DHT. However, very few DHTs have...
Moritz Steiner, Taoufik En-Najjary, Ernst W. Biers...