Sciweavers

323 search results - page 37 / 65
» Range-capable Distributed Hash Tables
Sort
View
INFOCOM
2007
IEEE
14 years 2 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
GCC
2005
Springer
14 years 2 months ago
Exploiting the Heterogeneity in Structured Peer-to-Peer Systems
The structured peer-to-peer system, which is based on the distributed hash table, offers an administration-free and fault-tolerant application-level overlay network. However, a ra...
Tongqing Qiu, Guihai Chen
PCI
2005
Springer
14 years 2 months ago
Storing and Locating Mutable Data in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
Antony Chazapis, Nectarios Koziris
ACSW
2007
13 years 10 months ago
DGRID: A DHT-Based Resource Indexing and Discovery Scheme for Computational Grids
Traditional DHT (Distributed Hash Tables) abstraction distributes data items among peer nodes on a structured overlay network. This introduces a number of issues when nodes are un...
Verdi March, Yong Meng Teo, Xianbing Wang
MST
2006
136views more  MST 2006»
13 years 8 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl