Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
10,247
Improving the Throughput of Distributed Hash Tables . . .
"... Advanced applications for Distributed Hash Tables ..."
Survey on distributed hash tables
, 2006
"... In this paper we review distributed hash tables (DHTs) that work as overlay networks on top of the IP network. We compare these DHTs under a number of key aspects that concern performance, scalability and self-configurability. Additionally, since these networks are not suitable for wireless ad hoc n ..."
Abstract
- Add to MetaCart
In this paper we review distributed hash tables (DHTs) that work as overlay networks on top of the IP network. We compare these DHTs under a number of key aspects that concern performance, scalability and self-configurability. Additionally, since these networks are not suitable for wireless ad hoc
Weighted distributed hash tables
- In Proceedings of the 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA
, 2005
"... We present two methods for weighted consistent hashing also known as weighted distributed hash tables. The first method, called Linear Method, combines the standard consistent hasing introduced by Karger et al. [9] with a linear weighted distance measure. By using node copies and different partition ..."
Abstract
-
Cited by 17 (3 self)
- Add to MetaCart
We present two methods for weighted consistent hashing also known as weighted distributed hash tables. The first method, called Linear Method, combines the standard consistent hasing introduced by Karger et al. [9] with a linear weighted distance measure. By using node copies and different
A Distributed Hash Table
, 2005
"... DHash is a new system that harnesses the storage and network resources of computers distributed across the Internet by providing a wide-area storage service, DHash. DHash frees applications from re-implementing mechanisms common to any system that stores data on a collection of machines: it maintain ..."
Abstract
-
Cited by 26 (2 self)
- Add to MetaCart
: it maintains a mapping of objects to servers, replicates data for durability, and balances load across participating servers. Applications access data stored in DHash through a familiar hash-table interface: put stores data in the system under a key; get retrieves the data. DHash has proven useful to a number
Range-capable Distributed Hash Tables
- in Third International Workshop on Geographic Information Retrieval - GIR’06, Seattle
, 2006
"... In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retrieving geographic data from a structured P2P network overlay. We have developed RDHTs as backend for the DART search engi ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retrieving geographic data from a structured P2P network overlay. We have developed RDHTs as backend for the DART search
Congestion Control for Distributed Hash Tables
- In The 5th IEEE International Symposium on Network Computing and Applications (IEEE NCA06
, 2006
"... Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to process concurrently a potentially very large number of requests. In this paper, we look at congestion control for DHTs. Our ..."
Abstract
-
Cited by 11 (7 self)
- Add to MetaCart
Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to process concurrently a potentially very large number of requests. In this paper, we look at congestion control for DHTs
OHT: Hierarchical Distributed Hash Tables
"... This paper presents OHT, a hierarchical distributed hash table, which improves the performance of practical ZHT. When n-to-n connection is needed, every single node has to keep a large number of socket connections. This might be quite expensive when n is extremely large. By performing a hierarchical ..."
Abstract
- Add to MetaCart
This paper presents OHT, a hierarchical distributed hash table, which improves the performance of practical ZHT. When n-to-n connection is needed, every single node has to keep a large number of socket connections. This might be quite expensive when n is extremely large. By performing a
Keywords:: RELOAD, Distributed Hash Table
"... Mémoire présenté en vue de l’obtention du grade de master en informatique Facing the rise of Peer-to-Peer (P2P) networks and applications in the last years, many have seen a need for standardization. Indeed, a lot of proprietary protocols currently coexist, each one using its own specifications, mes ..."
Abstract
- Add to MetaCart
, messages, algorithms, etc. To sort things out, the Internet En-gineering Task Force has created the Peer-to-Peer Session Initiation Protocol (P2PSIP) working group in 2007, in order to develop an open, standard, generic P2P protocol and provide a generic way to manage a Distributed Hash Table (DHT
POSITION-BASED DISTRIBUTED HASH TABLES
, 2005
"... In this thesis we want to create scalable, fault-tolerant and self-configuring dictionaries that can be deployed in a wide range of networks, including highly dynamic networks with frequent membership changes, like peer-to-peer overlay networks or wireless ad hoc networks. In recent years, distribut ..."
Abstract
- Add to MetaCart
, distributed hash tables (DHTs) have emerged as a solution to implement large-scale dictionaries. However, given the existing bandwidth limitations, updating routing information in DHTs remains a challenge. Position-based routing schemes arise as an attractive solution to this problem, due to inexpensive
Results 1 - 10
of
10,247
