Results 11 to 20 of about 8,789 (300)
Next-Generation Distributed Hash Tables
Proceedings 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]
International 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]
, 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
IEEE 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]
Proceedings 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
Blockchain-powered distributed data auditing scheme for cloud-edge healthcare system
Cyber 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]
Journal 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
Fast distributed video deduplication via locality-sensitive hashing with similarity ranking
EURASIP Journal on Image and Video Processing, 2019 The exponentially growing amount of video data being produced has led to tremendous challenges for video deduplication technology. Nowadays, many different deduplication approaches are being rapidly developed, but they are generally slow and their ...
Yeguang Li, Liang Hu, Ke Xia, Jie Luo
doaj +1 more source
A Ceph-based storage strategy for big gridded remote sensing data
Big Earth Data, 2021 When using distributed storage systems to store gridded remote sensing data in large, distributed clusters, most solutions utilize big table index storage strategies. However, in practice, the performance of big table index storage strategies degrades as
Xinyu Tang +6 more
doaj +1 more source
VANET Hybrid Collaborative Caching Strategy Based on PIT Similarity [PDF]
Jisuanji gongcheng, 2019 Aiming at the problem of repeated content transmission and long access delay in the Vehicular Ad Hoc Network(VANET),a hybrid collaborative caching strategy based on the similarity of Pending Interest Table(PIT) is designed.According to the PIT similarity
HUANG Jihai,DING Ying,ZHAO Bing
doaj +1 more source