Results 1 to 10 of about 95,792 (317)
Novel distributed Hash table——BChord
A novel distributed Hash table(DHT) BChord was presented. BChord adopts bi-directional search mechanism of Chord. Though query items of finger table in BChord almost double to Chord, compared with Chord, BChord evi- dently increases speed at searching of
ZHENG Yan1 +3 more
doaj +3 more sources
On Routing in Distributed Hash Tables [PDF]
There have been many proposals for constructing routing tables for distributed hash tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allow order-preserving hash functions that lead to a skewed peer distribution in the identifier space.
Fabius Klemm +3 more
openalex +3 more sources
Stealth distributed hash table [PDF]
Distributed Hash Tables (DHTs) have been shown to be a promising form of decentralised structured peer-to-peer networking, offering substantial scalability and resilience. Unsurprisingly, there exist numerous DHT systems [11][13][16]. Primarily, DHTs serve as an object location service that can be used as a substrate for multiple large-scale ...
Andrew Brampton +4 more
openalex +4 more sources
Survey on Distributed Hash Tables
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 networks, we shortly review techniques that can be used
Filipe Araújo, Luı́s Rodrigues
openalex +3 more sources
Local Thresholding on Distributed Hash Tables [PDF]
We present a binary routing tree protocol for distributed hash table overlays. Using this protocol each peer can independently route messages to its parent and two descendants on the fly without any maintenance, global context, and synchronization. The protocol is then extended to support tree change notification with similar efficiency.
Ran Wolff
openalex +3 more sources
Dynamic Replica Management in Distributed Hash Tables
Interest in distributed storage is fueled by demand for reliability and resilience combined with decreasing hardware costs. Peer-to-peer storage networks based on distributed hash tables are an attractive solution due to their efficient use of resources and resulting performance.
Marcel Waldvogel +2 more
openalex +2 more sources
DHT- and blockchain-based smart identification for video conferencing
Video conferencing applications help people communicate via the Internet and provide a significant and consistent basis for virtual meetings. However, integrity, security, identification, and authentication problems are still universal.
Morteza Alizadeh +2 more
doaj +1 more source
Research on MPP Database Connection Execution Based on Shared Storage [PDF]
In order to solve the problem of low connection efficiency after the Hash distribution table is converted into a random distribution table,a parallel connection operation algorithm for Hash tables in Massively Parallel Processor(MPP) database is ...
SUN Qingxin,LEI Yingchun,GONG Yili
doaj +1 more source
Towards a Highly Available Model for Processing Service Requests Based on Distributed Hash Tables
This work aims to identify techniques leading to a highly available request processing service by using the natural decentralization and the dispersion power of the hash function involved in a Distributed Hash Table (DHT).
Voichiţa Iancu, Nicolae Ţăpuş
doaj +1 more source
Holochain: An Agent-Centric Distributed Hash Table Security in Smart IoT Applications
The accomplishment of blockchain has increased the focus on the various applications for simplifying the confidentiality and transaction sanctuary using the decentralized architecture via consensus mechanisms between different internet of things (IoT ...
Shivani Gaba +9 more
doaj +1 more source

