table dht
On the Stability-Scalability Tradeoff of DHT Deployment
White Paper DHT users provide free but unstable Peer-to-Peer (P2P) capacity. With stable DHT nodes being relatively scarce, a DHT can either rely on a small set of stable nodes with limited... [19 Sep 2008]
Towards Scalable and Robust Distributed Intrusion Alert Fusion With Good Load Balancing
White Paper This paper proposes to build a DIDS based on the emerging decentralized location and routing infrastructure: Distributed Hash Table (DHT). The paper embeds the intrusion symptoms into the... [11 Sep 2008]
Towards Scalable and Robust Distributed Intrusion Alert Fusion With Good Load Balancing
This paper proposes to build a DIDS based on the emerging decentralized location and routing infrastructure: Distributed Hash Table (DHT). The paper embeds the intrusion symptoms into the... [11 Sep 2008]
Adaptive Load Balancing for DHT Lookups
White Paper In the past few years, several DHT-based abstractions for peer-to-peer systems have been proposed. It is based on dynamic routing table reorganization in order to balance the routing load and on caching... [04 Aug 2008]
Pastis: A Highly-Scalable Multi-User Peer-to-Peer File System
White Paper All data are stored using the Past Distributed Hash Table (DHT), which the paper has modified in order to reduce the number of network messages it generates, thus optimizing replica retrieval. This paper... [04 Aug 2008]
On Overlay Schemes to Support Point-in-Range Queries for Scalable Grid Resource Discovery
White Paper Unfortunately, most existing Distributed Hash Table (DHT) based P2P overlays have difficulty in treating attribute range queries that are common in resource discovery lookups. In particular, the proposed... [04 Aug 2008]
Bandwidth-Efficient Management of DHT Routing Tables
White Paper Today an application developer using a Distributed Hash Table (DHT) with n nodes must choose a DHT protocol from the spectrum between O(1) lookup protocols and O(log n) protocols. O(1)... [11 Jul 2008]
Techniques for Efficient Routing and Load Balancing in Content-Addressable Networks
White Paper As a Distributed Hash Table (DHT), a Content Addressable Network (CAN) provides efficient routing and objects location in a decentralized manner while offering fault tolerance and dynamic peer operations. [10 Jul 2008]
CLASH: A Protocol for Internet-Scale Utility-Oriented Distributed Computing
White Paper Distributed Hash Table (DHT) overlay networks offer an efficient and robust technique for wire-area data storage and queries. Emerging applications such as massively multiplayer online games and... [01 Mar 2008]
Novel Architectures for P2P Applications: The Continuous-Discrete Approach
White Paper The first serves as a DHT (Distributed Hash Table) and the other is a dynamic expander network. The DHT network, which it calls Distance Halving, allows logarithmic routing and load,... [31 May 2007]
Evaluating DHT Implementations in Complex Environments by Network Emulator
White Paper This paper proposes an evaluation method of large-scale distributed hash tables by network emulator that allows evaluating not only Distributed Hash Table (DHT) algorithms but also DHT... [24 May 2007]
Ripple-Stream: Safeguarding P2P Streaming Against DoS Attacks
White Paper Compared with file-sharing and Distributed Hash Table (DHT) network, P2P video streaming is more vulnerable to Denial of Service (DoS) attacks because of its high bandwidth demand and stringent time... [23 May 2007]
Deleting Files in the Celeste Peer-to-Peer Storage System
White Paper Celeste is a robust peer-to-peer object store built on top of a Distributed Hash Table (DHT). Celeste is a working system, developed by Sun Microsystems Laboratories. During the development of Celeste,... [11 May 2007]
