Sciweavers

447 search results - page 16 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
GI
2004
Springer
15 years 2 months ago
Comparison of Load Balancing Algorithms for Structured Peer-to-Peer Systems
Abstract: Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. Distributed Hash Tables (DHT) offer a highly scalabl...
Simon Rieche, Leo Petrak, Klaus Wehrle
ERCIMDL
2007
Springer
164views Education» more  ERCIMDL 2007»
15 years 3 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 ...
KIVS
2005
Springer
15 years 3 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
82
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
A Dynamic Load-Balanced Hashing Scheme for Networking Applications
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
N. Sertac Artan, Haowei Yuan, H. Jonathan Chao
74
Voted
INFOCOM
2007
IEEE
15 years 3 months ago
On the Stability-Scalability Tradeoff of DHT Deployment
— Distributed hash tables (DHTs) provide efficient data naming and location with simple hash-table-like primitives, upon which sophisticated distributed applications can be buil...
Chih-Chiang Wang, Khaled Harfoush