检索结果-内蒙古大学图书馆

Chinese Automation Congress (CAC)

作者： Wu Junhui Wu Tuolei Wu Yusheng Chen Jie Lin Kaiyan Si Huiping Tongji Univ Inst Modern Agr Sci & Engn Shanghai Peoples R China Xiamen Tobacco Ind Co Ltd Equipment Management Dept Xiamen Fujian Peoples R China

ISBN: (数字)9781728176871

ISBN: (纸本)9781728176871

The problem of supply chain management erodes trust of consumer and cause huge economic loss. It's essential to track and authenticate every step of supply chain to solve the problem of trust. The traditional centralized storage system has the problem of tamperability so that it can't ensure that data is reliable when consumers query them. Using blocl:chain technology to store data can solve part of trust problems of tracing system. It ensures that stored data is unalterable, that is, the original data cannot be wiped out. This paper designs a traceability system using blockchain technology. According to the characteristics of supply chain, the distributed hash table is used to improve the storage structure, reduce the load of network and nodes, and improve the storage utilization.

关键词： supply chain tracing system blockchain distributed hash table

来源：评论

学校读者我要写书评

暂无评论

HyCube: A distributed hash table based on a variable metric

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2017年第4期10卷 954-982页

作者： Olszak, Artur Warsaw Univ Technol Inst Comp Sci Warsaw Poland

distributed hash tables (DHT) proved to be scalable decentralized systems providing efficient resource location. This paper concentrates on efficiency and resilience to node failures of DHT systems and presents a novel model of a distributed hash table based on a hierarchical hypercube geometry, called HyCube. The DHT geometry, the choice of the metric defining logical distances between nodes, and the routing algorithm have fundamental influence on routing efficiency and resilience. The use of the one-dimensional model (placing the nodes logically on a ring) allows the nodes to maintain sets of references called sequential neighbors - certain numbers of neighbors that are the closest existing nodes in both directions on the ring. Such a model yields a very high level of resilience to node failures. The new approach, presented in the paper, employs a variable multi-dimensional metric adopting the Steinhaus transform. Routing, lookup and search algorithms are discussed, as well as routing table nodes selection and self-organization techniques. It is shown that the new approach allows reaching a higher level of resilience to node failures, as well as a shorter average routing path length than with the use of the sequential neighbors sets.

关键词： distributed hash table Routing algorithm Lookup algorithm Search algorithm Failure resilience

来源：评论

学校读者我要写书评

暂无评论

LOAD REBALANCING FOR HADOOP distributed FILE SYSTEM USING distributed hash table

LOAD REBALANCING FOR HADOOP DISTRIBUTED FILE SYSTEM USING DI...

引用

International Conference on Intelligent Sustainable Systems (ICISS)

作者： Nithya, M. Maheshwari, N. Uma Psna Coll Engn & Technol Dept Comp Sci & Engn Dindigul India

ISBN: (纸本)9781538619599

All the machines are required to be under a common administrator and be able to communicate securely. To communicate securely, Advanced Encryption Standard (AES) algorithm is used to enable protection of data at each clusters. It performs encryption and decryption before read and write respectively. Encryption and Decryption in key is used for securing Hadoop distributed File System. The existing system depends on a single name node to manage almost all operations of every data block in the file system. As a result it can be a bottleneck resource and a single point of failure. To overcome this failure, Load Rebalancing Algorithm is used for Hadoop distributed File System using distributed hash table. The Proposed load rebalancing algorithm will be compared against a centralized approach in a production system and a competing distributed solution is presented in the literature. The storage nodes are structured as a network based on distributed hash table discovering a file chunk can simply refer to rapid key lookup in DHTs, given that a unique handle (or identifier) is assigned to each file chunk.

关键词： Hadoop distributed File System distributed hash table Load Rebalancing Algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed hash table for Shared Memory 11th

A Distributed Hash Table for Shared Memory

引用

11th International Conference on Parallel Processing and Applied Mathematics (PPAM)

作者： Oortwijn, Wytse van Dijk, Tom van de Pol, Jaco Univ Twente Dept EEMCS Formal Methods & Tools POB 217 NL-7500 AE Enschede Netherlands

ISBN: (纸本)9783319321523;9783319321516

distributed algorithms for graph searching require a high-performance CPU-efficient hash table that supports find-or-put. This operation either inserts data or indicates that it has already been added before. This paper focuses on the design and evaluation of such a hash table, targeting supercomputers. The latency of find-or-put is minimized by using one-sided RDMA operations. These operations are overlapped as much as possible to reduce waiting times for roundtrips. In contrast to existing work, we use linear probing and argue that this requires less roundtrips. The hash table is implemented in UPC. A peak-throughput of 114.9 million op/s is reached on an Infiniband cluster. With a load-factor of 0.9, find-or-put can be performed in 4.5 mu s on average. The hash table performance remains very high, even under high loads.

关键词： distributed hash table High-performance computing Partitioned global address space Remote direct memory access

来源：评论

学校读者我要写书评

暂无评论

Towards Secure distributed hash table 11th

Towards Secure Distributed Hash Table

引用

11th EAI International Conference on Collaborative Computing - Networking, Applications and Worksharing

作者： Wang, Zhe Minsky, Naftaly H. Rutgers State Univ Piscataway NJ 08854 USA

ISBN: (纸本)9783319289106;9783319289090

A distributed hash table ( DHT) provides decentralized lookup service for distributed applications. All current implementations of DHT are achieved by the individual components being run by the participants of the application in question. Namely, the correctness of the DHT relies on that all the participants follow the same protocol. Unfortunately, this aspect of the current approach makes DHT seriously vulnerable to attacks. Such security and fault tolerance concerns about DHT prompted several attempts to improve the vulnerability of DHT. However, all the proposed solutions also rely on the code to be executed correctly. We present in this paper a novel way for implementing DHT, giving rise to an architecture we call GDHT, for Governed distributed hash table. GDHT implements the required protocol with a powerful means for establishing policies governing the behaviors of the participants of DHT. By carrying out the protocol by an equally distributed middleware, the correctness of the execution of routing algorithm is guaranteed. Moreover, the execution of the security module and improvements on routing algorithm can also be ensured.

关键词： distributed hash table Fault tolerance Collaboration Security Governed Chord Sybil attack Routing attack

来源：评论

学校读者我要写书评

暂无评论

Scalable signaling protocol for Web real-time communication based on a distributed hash table

引用

COMPUTER COMMUNICATIONS 2015年第Oct.1期70卷 28-39页

作者： Paik, Jung Ha Lee, Dong Hoon Korea Univ Dept Informat Secur Seoul South Korea

Web real-time communication (WebRTC) provides browser-to-browser communications without installing any plug-in. In WebRTC, peers have to prepare their communication session through a signaling protocol which coordinates peers and exchanges Session Description Protocol (SDP) message between two peers. The problem is that the most well known signaling method cannot provide the scalability because the method relies on only single server. To overcome the problem, this paper presents a scalable WebRTC signaling protocol. The main idea is that each peer forms a peer-to-peer topology by structuring relevant WebRTC connections with each other and then sends signals across those connections. The central server needs to handle only a few connection establishments for newly joining peers. The rest of the signaling process can be performed by peers. We define and justify such a protocol including a bootstrap method, a stabilization scheme, and peer lookup. The procedures are designed to be suitable for WebRTC connections and to be resilient against the churn condition. Furthermore, we implement the proposed protocol in pure JavaScript to show that it is realizable. The performance of the implementation is practical, with signaling latency averaging 0.5 s when the number of peers is 1000. Each peer still correctly locates the other peers even when the network is very congested. (C) 2015 Elsevier B.V. All rights reserved.

关键词： WebRTC distributed hash table Signaling protocol Peer-to-peer

来源：评论

学校读者我要写书评

暂无评论

distributed hash table based routing algorithm for wireless sensor networks 5

Distributed hash table based routing algorithm for wireless ...

引用

5th International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)

作者： Chen Yan Suzhou Inst Trade&Commerce Dept Informat Suzhou 215009 Peoples R China

ISBN: (纸本)9781479942626

As the routing protocol can greatly influence the energy consumption of the sensor nodes in research field of wireless sensor networks. In this paper, we present a novel distributed hash table based routing algorithm for wireless sensor networks. distributed hash table is a kind of distributed memory approach, of which the single node can be expanded to the whole Internet. Particularly, each node is controlled by a part of the whole resource space, and the related index information can be saved on it. In the proposed routing algorithm, each node in wireless sensor networks can be allocated an ID using hash functions. Afterwards, each node maintains a routing table, and then the selective information can be transmitted through the routing table. Next, we present a modified finger table named speedup finger table, and then used it in the wireless sensor networks routing algorithm. Finally, we design a series of experiments to verify the effectiveness of the proposed algorithm. Experimental results demonstrate that compared with the existing related works, the proposed routing algorithm is effective and can obviously reduce the energy consumption.

关键词： Wireless sensor networks distributed hash table Routing algorithm Finger table Route table

来源：评论

学校读者我要写书评

暂无评论

Frisbee: An Efficient Data Sharing Framework for UAV Swarms

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2024年第6期11卷 5380-5393页

作者： Chen, Peipei Luo, Lailong Guo, Deke Zhang, Qianzhen Luo, Xueshan Ren, Bangbang Shen, Yulong Hangzhou Dianzi Univ Sch Commun Engn Hangzhou 310018 Peoples R China Natl Univ Def Technol Sci & Technol Informat Syst Engn Lab Changsha 410073 Peoples R China Natl Univ Def Technol Coll Comp Changsha 410073 Peoples R China Xidian Univ Sch Comp Sci & Technol Xidian 710071 Peoples R China

Nowadays, owing to the communication, computation, storage, networking, and sensing abilities, the swarm of unmanned aerial vehicles (UAV) is highly anticipated to be helpful for emergency, disaster, and military situations. Additionally, in such situations, each UAV generates local sensing data with its cameras and sensors. Data sharing in UAV swarm is an urgent need for both users and administrators. For users, they may want to access data stored on any specific UAV on demand. For administrators, they need to construct global information and situational awareness to enable many cooperative applications. This paper makes the first step to tackling this open problem with an efficient data-sharing framework called Frisbee. It first groups all UAVs as a series of cells, each of which has a head-UAV. Inside any cell, all UAVs can communicate with each other directly. Thus, for the intra-cell sharing, Frisbee designs the Dynamic Cuckoo Summary for the head-UAV to accurately index all data inside the cell. For inter-cell sharing, Frisbee designs an effective method to map both the data indices and the head-UAV into a 2-dimensional virtual plane. Based on such virtual plane, a head-UAV communication graph is formed according to the communication range of each head for both data localization and transmission. The comprehensive experiments show that Frisbee achieves 14.7% higher insert throughput, 39.1% lower response delay, and 41.4% less implementation overhead, respectively, compared to the most involved solutions of the ground network.

关键词： Autonomous aerial vehicles distributed databases Filters Sensors Throughput Peer-to-peer computing Indexing Disasters Bandwidth Servers Data location data sharing distributed hash table UAV communication

来源：评论

学校读者我要写书评

暂无评论

AgileDART: An Agile and Scalable Edge Stream Processing Engine

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2025年第5期24卷 4510-4528页

作者： Ching, Cheng-Wei Chen, Xin Kim, Chaeeun Wang, Tongze Chen, Dong Da Silva, Dilma Hu, Liting Univ Calif Santa Cruz Dept Comp Sci & Engn Santa Cruz CA 95064 USA Georgia Inst Technol Dept Comp Sci & Engn Atlanta GA 30332 USA Colorado Sch Mines Golden CO 80401 USA Texas A&M Univ College Stn TX 77843 USA

Edge applications generate a large influx of sensor data on massive scales, and these massive data streams must be processed shortly to derive actionable intelligence. However, traditional data processing systems are not well-suited for these edge applications as they often do not scale well with a large number of concurrent stream queries, do not support low-latency processing under limited edge computing resources, and do not adapt to the level of heterogeneity and dynamicity commonly present in edge computing environments. As such, we present AgileDart, an agile and scalable edge stream processing engine that enables fast stream processing of many concurrently running low-latency edge applications' queries at scale in dynamic, heterogeneous edge environments. The novelty of our work lies in a dynamic dataflow abstraction that leverages distributed hash table-based peer-to-peer overlay networks to autonomously place, chain, and scale stream operators to reduce query latencies, adapt to workload variations, and recover from failures and a bandit-based path planning model that re-plans the data shuffling paths to adapt to unreliable and heterogeneous edge networks. We show that AgileDart outperforms Storm and EdgeWise on query latency and significantly improves scalability and adaptability when processing many real-world edge stream applications' queries.

关键词： Peer-to-peer computing Cloud computing Engines Vehicle dynamics Time factors Computer science Automobiles Topology distributed databases Actuators Edge stream processing distributed hash table edge networks bandit algorithm

来源：评论

学校读者我要写书评

暂无评论

Minerva: Decentralized Collaborative Query Processing Over InterPlanetary File System

引用

IEEE TRANSACTIONS ON BIG DATA 2025年第2期11卷 669-683页

作者： Yao, Zhiyi Ding, Bowen Bai, Qianlan Xu, Yuedong Fudan Univ Sch Informat Sci & Technol Shanghai 200437 Peoples R China Fudan Univ Sch Comp Sci Shanghai 200437 Peoples R China

Data silos create barriers to accessing and utilizing data dispersed over networks. Directly sharing data easily suffers from the long downloading time, the single point failure and the untraceable data usage. In this paper, we present Minerva, a peer- to-peer cross-cluster data query system based on the InterPlanetary File System (IPFS). Minerva makes use of the distributed hash table (DHT) lookup to pinpoint the locations that store content chunks. We theoretically model the DHT query delay and introduce a fat Merkle tree structure as well as the DHT caching to reduce it. We design the query plan for read and write operations on top of Apache Drill that enables the collaborative query with decentralized workers. We conduct comprehensive experiments on Minerva, and the results show that Minerva achieves up to 2.08x query performance acceleration compared to the original IPFS data query, and can complete data analysis queries on the Internet-like environments within an average latency of 0.615 second. With a collaborative query, Minerva could perform up to 1.39x performance acceleration than the centralized query with raw data shipment.

关键词： distributed databases InterPlanetary File System Memory Soft sensors Big Data Structured Query Language Engines IPFS decentralized query distributed hash table Merkle tree

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：