Sciweavers

1080 search results - page 19 / 216
» Distributed Hash Tables
Sort
View
124
Voted
LCN
2008
IEEE
15 years 9 months ago
Range queries and load balancing in a hierarchically structured P2P system
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
Simon Rieche, Bui The Vinh, Klaus Wehrle
SPAA
2009
ACM
16 years 3 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
103
Voted
P2P
2009
IEEE
114views Communications» more  P2P 2009»
15 years 9 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
105
Voted
P2P
2009
IEEE
15 years 9 months ago
A Trusted Infrastructure for P2P-based Marketplaces
Peer-to-peer (P2P) based marketplaces have a number of advantages over traditional centralized systems (such as eBay). Peers form a distributed hash table and store sale offers fo...
Tien Tuan Anh Dinh, Tom Chothia, Mark Ryan
CNSR
2005
IEEE
100views Communications» more  CNSR 2005»
15 years 4 months ago
Malicious Behaviour in Content-Addressable Peer-to-Peer Networks
Distributed Hash Tables (DHTs) promise to manage huge sets of key-value pairs in a Peer-to-Peer manner. The Content-Addressable Network (CAN) is a prominent variant of DHT. A crit...
Thomas Reidemeister, Klemens Böhm, Paul A. S....