Results 51 to 60 of about 8,512 (160)
International Journal of Digital Earth, 2020 Earth observations and model simulations are generating big multidimensional array-based raster data. However, it is difficult to efficiently query these big raster data due to the inconsistency among the geospatial raster data model, distributed ...
Fei Hu +7 more
doaj +1 more source
Evaluating model and simulation analyzing for P2P Churn
Tongxin xuebao, 2007 Most P2P algorithms based on distributed Hash table（DHT） faced Churn,which was caused by the continuous process of node joining and failure.A Churn evaluating model was proposed and its formulized description,which could give some important instructions ...
YANG Dong, DONG Ping, ZHANG Hong-ke
doaj +2 more sources
A Distributed Learned Hash Table
2025 IEEE 33rd International Conference on Network Protocols (ICNP)Distributed Hash Tables (DHTs) are pivotal in numerous high-impact key-value applications built on distributed networked systems, offering a decentralized architecture that avoids single points of failure and improves data availability. Despite their widespread utility, DHTs face substantial challenges in handling range queries, which are crucial for ...
Wang, Shengze +4 more
openaire +2 more sources
Enhanced techniques to measure the execution time of distributed and cloud computing systems [PDF]
ITM Web of ConferencesICT giants include cloud computing and distributed systems. Researchers have ignored the idea of merging distributed systems and cloud computing to examine millisecond execution times and megabyte capacity.
Jghef Yousif Sufyan +5 more
doaj +1 more source
PyCAN: Open-source Python software of N-dimensional Content-Addressable Network
SoftwareXWe propose PyCAN, the first open-source Python implementation of N-dimensional Content-Addressable Network (CAN) with full feature sets to maintain peer-to-peer structure. Existing CAN implementations supports limited functions of Distributed Hash Table (
Yuchan Lee, Sookwang Lee, Jaehwan Lee
doaj +1 more source
Smart Chaining: Templing and Temple Search
IEEE AccessHash tables continue to be at the forefront of applications that require fast data lookup, but their usefulness in practice depends on effective collision resolution. Classical approaches like chaining (linked lists) and open addressing (linear/quadratic/
Rajeev Ranjan Kumar Tripathi +4 more
doaj +1 more source
A Scalable Architecture for Secured Access to Distributed Services
EAI Endorsed Transactions on Scalable Information Systems, 2017 Web services which are an implementation of Services Oriented Architecture (SOA), are emergent technologies and promising the development, the deployment and the integration of Internet applications. They are initially based on three main layers that are
Telesphore Tiendrebeogo
doaj +1 more source
Security-Enhanced Decentralized Content Sharing in Publish/Subscribe System
IEEE AccessWe consider a content dissemination model, where the contents disseminated from a content source on a regular or event-driven basis are shared among the group members, without directly contacting the content source.
Wang-Seok Park +2 more
doaj +1 more source
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 networks, we shortly review techniques that can be used
Araújo, Filipe, Rodrigues, Luís
openaire +1 more source
Remote SensingLunar-rover path planning is a key topic in lunar exploration research, with safety and computational efficiency critical for achieving long-distance planning.
Ruyan Zhou +6 more
doaj +1 more source