Results 11 to 20 of about 95,792 (317)

Efficient Batch Update of Unique Identifiers in a Distributed Hash Table for Resources in a Mobile Host [PDF]

open access: green, 2010
Resources in a distributed system can be identified using identifiers based on random numbers. When using a distributed hash table to resolve such identifiers to network locations, the straightforward approach is to store the network location directly in
Yoo Chung
openalex   +4 more sources

Efficient Processing of Continuous Join Queries Using Distributed Hash Tables [PDF]

open access: green, 2008
International audienceThis paper addresses the problem of computing approximate answers to continuous join queries. We present a new method, called DHTJoin, which combines hash-based placement of tuples in a Distributed Hash Table (DHT) and dissemination
Wenceslao Palma   +3 more
openalex   +7 more sources

Next-Generation Distributed Hash Tables

open access: yesProceedings of the on CoNEXT Student Workshop 2023, 2023
Distributed Hash Tables (DHTs) serve as the backbone of numerous modern decentralized systems like the InterPlanetary File System (IPFS) and Ethereum. As these systems evolve and expand, there is a growing need to enhance and optimize their underlying network support. In response to these challenges, we embark on the development of a new class of DHTs,
Sokoto, Saidu   +4 more
openaire   +4 more sources

Comparison of Hash Table Performance with Open Addressing and Closed Addressing: An Empirical Study [PDF]

open access: yesInternational Journal of Networked and Distributed Computing (IJNDC), 2015
In this paper, we conducted empirical experiments to study the performance of hashing with a large set of data and compared the results of different collision approaches. The experiment results leaned more to closed addressing than to open addressing and
Dapeng Liu, Shaochun Xu
doaj   +1 more source

Distributed Paged Hash Tables [PDF]

open access: yes, 2003
In this paper we present the design and implementation of DPH, a storage layer for cluster environments. DPH is a Distributed Data Structure (DDS) based on the distribution of a paged hash table. It combines main memory with file system resources across the cluster in order to implement a distributed dictionary that can be used for the storage of very ...
Rufino, José   +3 more
openaire   +2 more sources

Comparative Analysis of Decentralized Identity Approaches

open access: yesIEEE Access, 2022
Decentralization is essential when trust and performance must not depend on a single organization. Distributed Ledger Technologies (DLTs) and Decentralized Hash Tables (DHTs) are examples where the DLT is useful for transactional events, and the DHT is ...
Morteza Alizadeh   +2 more
doaj   +1 more source

Weighted distributed hash tables [PDF]

open access: yesProceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, 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.
Christian Schindelhauer   +1 more
openaire   +1 more source

A Random Structure for Optimum Cache Size Distributed hash table (DHT) Peer-to-Peer design [PDF]

open access: green, 2002
We propose a new and easily-realizable distributed hash table (DHT) peer-to-peer structure, incorporating a random caching strategy that allows for {\em polylogarithmic search time} while having only a {\em constant cache} size.
Nima Sarshar, Vwani Roychowdhury
openalex   +5 more sources

Blockchain-powered distributed data auditing scheme for cloud-edge healthcare system

open access: yesCyber Security and Applications, 2023
Cloud-edge healthcare system provides storage and computing functions at the hospital servers, bringing low latency for doctors and patients. However, hospital servers cannot be trusted and have limited computing resources.
Yi Li, Meiqin Tang
doaj   +1 more source

Authentication in stealth distributed hash tables [PDF]

open access: yesJournal of Systems Architecture, 2006
Most existing DHT algorithms assume that all nodes have equal capabilities. This assumption has previously been shown to be untrue in real deployments, where the heterogeneity of nodes can actually have a detrimental effect upon performance. In this paper, we acknowledge that nodes on the same overlay may also differ in terms of their trustworthiness ...
MacQuire, Andrew   +4 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy