Sciweavers

447 search results - page 50 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
WCW
2004
Springer
15 years 5 months ago
ShortCuts: Using Soft State to Improve DHT Routing
Distributed hash tables are increasingly being proposed as the core substrate for content delivery applications in the Internet, such as cooperative Web caches, Web index and sear...
Kiran Tati, Geoffrey M. Voelker
USITS
2003
15 years 1 months ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
PERCOM
2010
ACM
14 years 10 months ago
GeoKad: A P2P distributed localization protocol
—The widespread use of tracking and localization systems may be hindered by centralized server platforms whose performance can hardly scale up to the needs of very large numbers ...
Marco Picone, Michele Amoretti, Francesco Zanichel...
DEXAW
2005
IEEE
134views Database» more  DEXAW 2005»
15 years 5 months ago
Enabling High Data Availability in a DHT
Many decentralized and peer-to-peer applications require some sort of data management. Besides P2P file-sharing, there are already scenarios (e.g. BRICKS project [3]) that need m...
Predrag Knezevic, Andreas Wombacher, Thomas Risse
HOTOS
2007
IEEE
15 years 3 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer