Sciweavers

456 search results - page 10 / 92
» On Routing in Distributed Hash Tables
Sort
View
OSDI
2004
ACM
14 years 8 months ago
Chain Replication for Supporting High Throughput and Availability
Chain replication is a new approach to coordinating clusters of fail-stop storage servers. The approach is intended for supporting large-scale storage services that exhibit high t...
Robbert van Renesse, Fred B. Schneider
INFOCOM
2009
IEEE
14 years 3 months ago
Spatial Distribution in Routing Table Design for Sensor Networks
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
Rik Sarkar, Xianjin Zhu, Jie Gao
KIVS
2005
Springer
14 years 2 months ago
Measuring Large Overlay Networks - The Overnet Example
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
Kendy Kutzner, Thomas Fuhrmann
ERCIMDL
2007
Springer
164views Education» more  ERCIMDL 2007»
14 years 2 months ago
MinervaDL: An Architecture for Information Retrieval and Filtering in Distributed Digital Libraries
Abstract. We present MinervaDL, a digital library architecture that supports approximate information retrieval and filtering functionality under a single unifying framework. The a...
Christian Zimmer, Christos Tryfonopoulos, Gerhard ...