Virtual Block Group: A Scalable Blockchain Model with Partial Node Storage and Distributed Hash Table

Abstract The inability to scale is one of the most concerning problems looming in blockchain systems, where every node has to store all contents of the ledger database locally, leading to centralization and higher operation costs. In this paper, we propose a model named virtual block group (VBG), which aims at addressing the node storage scalability problem. Adopting the VBG model, each node only needs to store part of block data and saves the VBG storage index to distributed hash table by taking block data as a resource, thus improving the query efficiency of block data. With the incentive mechanism of block data storage, and the storage verification and audit mechanism of block data, the security and reliability of block data storage can be ensured. The analysis and calculation show that this model saves hard drive storage space of the node to a greater extent with a shorter time of requesting block data, in the premise of ensuring secure and reliable block data. Compared to other technologies such as sharding, our model does not change the consensus mechanism or the network topology and retains the reliability and security of the original blockchain system.

Download Full-text

Rapid Relevance Feedback Strategy Based on Distributed CBIR System

International Journal on Semantic Web and Information Systems ◽

10.4018/ijswis.2018040101 ◽

2018 ◽

Vol 14 (2) ◽

pp. 1-26

Author(s):

Jianxin Liao ◽

baoran li ◽

Jingyu Wang ◽

Qi Qi ◽

Tonghong Li

Keyword(s):

Image Retrieval ◽

Data Storage ◽

Hash Table ◽

Recall Rate ◽

Distributed Hash Table ◽

Online Data ◽

Retrieval Systems ◽

Efficiency Performance ◽

Image Retrieval System ◽

Set Up

This article describes the capability of online data storage which has been enhanced by the emergence of cloud datacenter development. Distributed Hash Table (DHT) based image retrieval system using locality sensitive hash (LSH) has provided an efficient way to set up distributed Content Based Image Retrieval (CBIR) frameworks. However, with the fixed LSH function adopted, LSH and other codebook-based distributed retrieval systems are facing the problem of flexibility, and also are difficult to satisfy the user's demand. In this article, LRFMIR is proposed to introduce semantic search into DHT based CBIR system. LRFMIR is established on a DHT based network, where a flexible result truncating strategy is employed to fuse provided results by using multiple features measurements. Experiments show that LRFMIR provides a higher accuracy and recall rate than single feature employed retrieval systems, and possesses good load balancing and query efficiency performance.

Download Full-text

Improving the Efficiency of Deduplication Process by Dedicated Hash Table for each Digital Data Type in Cloud Storage System

Webology ◽

10.14704/web/v18si01/web18060 ◽

2021 ◽

Vol 18 (Special Issue 01) ◽

pp. 288-301

Author(s):

G. Sujatha ◽

Dr. Jeberson Retna Raj

Keyword(s):

Data Storage ◽

Cloud Storage ◽

Storage System ◽

Hash Table ◽

Cloud Services ◽

Data Type ◽

Digital Data ◽

Storage Space ◽

Data Deduplication ◽

Worst Case

Data storage is one of the significant cloud services available to the cloud users. Since the magnitude of information outsourced grows extremely high, there is a need of implementing data deduplication technique in the cloud storage space for efficient utilization. The cloud storage space supports all kind of digital data like text, audio, video and image. In the hash-based deduplication system, cryptographic hash value should be calculated for all data irrespective of its type and stored in the memory for future reference. Using these hash value only, duplicate copies can be identified. The problem in this existing scenario is size of the hash table. To find a duplicate copy, all the hash values should be checked in the worst case irrespective of its data type. At the same time, all kind of digital data does not suit with same structure of hash table. In this study we proposed an approach to have multiple hash tables for different digital data. By having dedicated hash table for each digital data type will improve the searching time of duplicate data.

Download Full-text

Encrypted De-duplication over Distributed Cloud Server

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i3.12.16124 ◽

2018 ◽

Vol 7 (3.12) ◽

pp. 437

Author(s):

R Aditya Balaji ◽

R Pragadeeeshwaran ◽

G K. Sandhia

Keyword(s):

Data Storage ◽

Cloud Service ◽

Storage Space ◽

Data Deduplication ◽

Cloud Server ◽

Security And Reliability ◽

New Challenges ◽

Distributed Cloud ◽

Reduced Data

The most common cloud service is Data Storage. In order to reduce the storage space, deduplication is used. Data deduplication is a process of removing redundant copies of same data. If a file which is already present in the cloud, is uploaded by the same user or different user, then it will not be uploaded again. Therefore storage required is decreased but reliability is also reduced. Data are encrypted and stored in cloud to protect the privacy of users and this introduces new challenges. The proposed system uses M3 algorithm for encryption and Chunking technique for deduplication. The results of the evaluation show that the security and reliability are increased in the proposed scheme.

Download Full-text

Collaborative Web service composition based on distributed Hash table

Journal of Computer Applications ◽

10.3724/sp.j.1087.2013.01197 ◽

2013 ◽

Vol 33 (5) ◽

pp. 1197-1202

Author(s):

Xi CHEN ◽

Huashen ZENG ◽

Tao WU

Keyword(s):

Web Service ◽

Service Composition ◽

Hash Table ◽

Web Service Composition ◽

Distributed Hash Table

Download Full-text

Studies on the Various Issues Relating to Data Storage space and safety in Cloud Computing

International Journal of Advanced Research in Computer and Information Security ◽

10.21742/ijacis.2018.2.1.02 ◽

2018 ◽

Vol 2 (1) ◽

Keyword(s):

Cloud Computing ◽

Data Storage ◽

Storage Space

Download Full-text

Incrementally improving lookup latency in distributed hash table systems

Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '03 ◽

10.1145/781027.781042 ◽

2003 ◽

Cited By ~ 37

Author(s):

Hui Zhang ◽

Ashish Goel ◽

Ramesh Govindan

Keyword(s):

Hash Table ◽

Distributed Hash Table

Download Full-text

Agent-Based Coordinated Control of Power Electronic Converters in a Microgrid

Electronics ◽

10.3390/electronics10091031 ◽

2021 ◽

Vol 10 (9) ◽

pp. 1031

Author(s):

Maryam Nasri ◽

Herbert L. Ginn ◽

Mehrdad Moallem

Keyword(s):

Hash Table ◽

Power Sharing ◽

Distributed Hash Table ◽

Power Electronic ◽

Power Electronic Converters ◽

Agent Based ◽

Development Framework ◽

Study Results ◽

Set Up ◽

Microgrid Control

This paper presents the implementation of an agent-based architecture suitable for the coordination of power electronic converters in stand-alone microgrids. To this end, a publish-subscribe agent architecture was utilized as a distributed microgrid control platform. Over a distributed hash table (DHT) searching overlay, the publish-subscribe architecture was identified based on a numerical analysis as a scalable agent-based technology for the distributed real-time coordination of power converters in microgrids. The developed framework was set up to deploy power-sharing distributed optimization algorithms while keeping a deterministic time period of a few tens of milliseconds for a system with tens of converters and when multiple events might happen concurrently. Several agents participate in supervisory control to regulate optimum power-sharing for the converters. To test the design, a notional shipboard system, including several converters, was used as a case study. Results of implementing the agent-based publish-subscribe control system using the Java Agent Development Framework (JADE) are presented.

Download Full-text