检索结果-南通市图书馆

Robust and Trustworthy Data Sharing Framework Leveraging On-Chain and Off-Chain Collaboration

Computers, Materials & Continua 2024年第2期78卷 2159-2179页

作者： Jinyang Yu Xiao Zhang Jinjiang Wang Yuchen Zhang Yulong Shi Linxuan Su Leijie Zeng School of Computer Science Northwestern Polytechnical UniversityXi’an710072China MIIT Key Laboratory of Big Data storage and Management Northwestern Polytechnical UniversityXi’an710072China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Northwestern Polytechnical UniversityXi’an710072China

The proliferation of Internet of Things(IoT)systems has resulted in the generation of substantial data,presenting new challenges in reliable storage and trustworthy *** distributed storage systems are hindered by centralized management and lack traceability,while blockchain systems are limited by low capacity and high *** address these challenges,the present study investigates the reliable storage and trustworthy sharing of IoT data,and presents a novel system architecture that integrates on-chain and off-chain data manage *** architecture,integrating blockchain and distributed storage technologies,provides high-capacity,high-performance,traceable,and verifiable data storage and *** on-chain system,built on Hyperledger Fabric,manages metadata,verification data,and permission information of the raw *** off-chain system,implemented using IPFS Cluster,ensures the reliable storage and efficient access to massive files.A collaborative storage server is designed to integrate on-chain and off-chain operation interfaces,facilitating comprehensive data *** provide a unified access interface for user-friendly system *** testing validates the system’s reliability and stable *** proposed approach significantly enhances storage capacity compared to standalone blockchain *** reliability tests consistently yield positive *** average upload and download throughputs of roughly 20 and 30 MB/s,respectively,the system’s throughput surpasses the blockchain system by a factor of 4 to 18.

关键词： On-chain and off-chain collaboration blockchain distributed storage system hyperledger fabric IPFS cluster

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

SA-RSR:a read-optimal data recovery strategy for XOR-coded distributed storage systems

引用

Frontiers of Information Technology & Electronic Engineering 2022年第6期23卷 858-875页

作者： Xingjun ZHANG Ningjing LIANG Yunfei LIU Changjiang ZHANG Yang LI School of Computer Science and Technology Xi’an Jiaotong UniversityXi'an 710049China Beijing Electronic Engineering General Research Institute Beijing 100854China

To ensure the reliability and availability of data,redundancy strategies are always required for distributed storage *** coding,one of the representative redundancy strategies,has the advantage of low storage overhead,which facilitates its employment in distributed storage *** the various erasure coding schemes,XOR-based erasure codes are becoming popular due to their high computing *** a single-node failure occurs in such coding schemes,a process called data recovery takes place to retrieve the failed node’s lost data from surviving ***,data transmission during the data recovery process usually requires a considerable amount of *** research has focused mainly on reducing the amount of data needed for data recovery to reduce the time required for data transmission,but it has encountered problems such as significant complexity and local *** this paper,we propose a random search recovery algorithm,named SA-RSR,to speed up single-node failure recovery of XOR-based erasure ***-RSR uses a simulated annealing technique to search for an optimal recovery solution that reads and transmits a minimum amount of *** addition,this search process can be done in polynomial *** evaluate SA-RSR with a variety of XOR-based erasure codes in simulations and in a real storage system,*** results in Ceph show that SA-RSR reduces the amount of data required for recovery by up to 30.0%and improves the performance of data recovery by up to 20.36%compared to the conventional recovery method.

关键词： distributed storage system Data reliability and availability XOR-based erasure codes Single-node failure Data recovery

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An Application-Oriented Cache Allocation and Prefetching Method for Long-Running Applications in distributed storage systems

引用

Chinese Journal of Electronics 2019年第4期28卷 773-780页

作者： GUO Chang LI Ying LIU Hongzhi WU Zhonghai School of Electronics Engineering and Computer Science Peking University National Engineering Research Center For Software Engineering Peking University School of Software and Microelectronics Peking University

Characteristics of long-running applications in cloud and big data environment are various and significantly influence the performance of cache *** gap between existing cache systems and the increasing performance requirements motivates us to propose the Application-oriented cache allocation and prefetching method(ACAP) to improve data access performance. An application-oriented cache allocation approach is designed based on hit count growth rates for a higher overall hit rate. Two application-oriented sequential prefetching approaches are proposed to improve the hit rate and prefetching accuracy by learning average read sizes of long-running applications. Based on correlation of data accesses, a parallelized correlated-directed prefetching approach is proposed to further increase the hit *** approaches are intergrated to obtain the maximized hit rate and prefetching accuracy. Experimental results on12 public real system traces show that ACAP achieves14.03%(up to 33.82%) higher prefetching accuracy and2.01%(up to 7.54%) higher hit rate compared with the best combination of baselines.

关键词： Cache prefetching Cache allocation distributed storage system Resource management

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

storage and repair bandwidth tradeoff for heterogeneous cluster distributed storage systems

引用

Science China(Information Sciences) 2020年第2期63卷 131-145页

作者： Jingzhao WANG Yuan LUO Kenneth W.SHUM Department of Computer Science and Engineering Shanghai Jiao Tong University Institute of Network Coding The Chinese University of Hong Kong

The storage and repair bandwidth tradeoff is an important issue in distributed storage systems(DSSs) where large scale data are stored in multiple nodes with erasure coding to ensure reliability. There are lots of studies on the DSS model with multiple clusters where the repair bandwidths from intra-cluster and cross-cluster nodes are differentiated to improve repair efficiency based on the realistic network topological structures. At the same time, separate nodes are also prevalent due to the variety of practical networks, but the work on the cluster DSS model with multiple separate nodes is insufficient, which is a main motivation of this paper. We formulate the tradeoff bound between storage repair bandwidth for a heterogeneous DSS model consisting of clusters and separate nodes by analyzing the min-cuts of heterogeneous information flow graphs corresponding to the orders of failed nodes. Additionally, the tradeoff bounds are investigated in multiple aspects when the repair bandwidth constraints and the amount of separate nodes vary, ***, a class of regenerating codes are illustrated to achieve the tradeoff in the heterogeneous cases.

关键词： distributed storage system cluster separate node repair bandwidth information flow graph

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

storage and repair bandwidth tradeoff for distributed storage systems with clusters and separate nodes

引用

Science China(Information Sciences) 2018年第10期61卷 63-79页

作者： Jingzhao WANG Tinghan WANG Yuan LUO Department of Computer Science and Engineering Shanghai Jiao Tong University

The optimal tradeoff between node storage and repair bandwidth is an important issue for distributed storage systems(DSSs). For realistic DSSs with clusters, while repairing a failed node, downloading more data from intra-cluster nodes than from cross-cluster nodes is effective. Therefore, differentiating the repair bandwidth from intra-cluster and cross-cluster is useful. For cluster DSSs, the tradeoff is considered with special repair assumptions where all alive nodes are used for repairing a failed node. In this paper, we investigate the optimal tradeoff for the cluster DSSs under more general storage/repair parameters. Furthermore, we propose a regenerating code construction strategy that achieves the points in the optimal tradeoff curve for the cluster DSSs with specific parameters as a numerical example. Moreover, we consider the influence of separate nodes for the tradeoff for the DSSs with clusters and separated nodes.

关键词： distributed storage system cluster separate node repair bandwidth communication cost

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

DDUC:an erasure-coded system with decoupled data updating and coding

引用

Frontiers of Information Technology & Electronic Engineering 2023年第5期24卷 716-730页

作者： Yaofeng TU Rong XIAO Yinjun HAN Zhenghua CHEN Hao JIN Xuecheng QI Xinyuan SUN State Key Laboratory of Mobile Network and Mobile Multimedia Technology Shenzhen 518000China ZTE Corporation Nanjing 210000China

In distributed storage systems,replication and erasure code(EC)are common methods for data *** with replication,EC has better storage efficiency,but suffers higher overhead in ***,consistency and reliability problems caused by concurrent updates bring new challenges to applications of *** works focus on optimizing the EC solution,including algorithm optimization,novel data update method,and so on,but lack the solutions for consistency and reliability *** this paper,we introduce a storage system that decouples data updating and EC encoding,namely,decoupled data updating and coding(DDUC),and propose a data placement policy that combines replication and parity *** the(N,M)EC system,the data are placed as N groups of M+1 replicas,and redundant data blocks of the same stripe are placed in the parity nodes,so that the parity nodes can autonomously perform local EC *** on the above policy,a two-phase data update method is implemented in which data are updated in replica mode in phase 1,and the EC encoding is done independently by parity nodes in phase *** solves the problem of data reliability degradation caused by concurrent updates while ensuring high concurrency *** also uses persistent memory(PMem)hardware features of the byte addressing and eight-byte atomic write to implement a lightweight logging mechanism that improves performance while ensuring data *** results show that the concurrent access performance of the proposed storage system is 1.70–3.73 times that of the state-of-the-art storage system Ceph,and the latency is only 3.4%–5.9%that of Ceph.

关键词： Concurrent update High reliability Erasure code Consistency distributed storage system

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Ceph-based storage strategy for big gridded remote sensing data

引用

Big Earth Data 2022年第3期6卷 323-339页

作者： Xinyu Tang Xiaochuang Yao Diyou Liu Long Zhao Li Li Dehai Zhu Guoqing Li College of Land Science and Technology China Agricultural UniversityBeijingChina Key Laboratory of Remote Sensing for Agri-Hazards Ministry of Agriculture and Rural AffairsBeijingChina Aerospace Information Research Institute Chinese Academy of SciencesBeijingChina School of Electronic Electrical and Communication EngineeringUniversity of Chinese Academy of SciencesBeijingChina

When using distributed storage systems to store gridded remote sensing data in large,distributed clusters,most solutions utilize big table index storage ***,in practice,the performance of big table index storage strategies degrades as scenarios become more complex,and the reasons for this phenomenon are analyzed in this *** improve the read and write performance of distributed gridded data storage,this paper proposes a storage strategy based on Ceph *** strategy encapsulates remote sensing images in the form of objects through a metadata management strategy to achieve the spatiotemporal retrieval of gridded data,finding the cluster location of gridded data through hash-like *** method can effectively achieve spatial operation support in the clustered database and at the same time enable fast random read and write of the gridded *** write and spatial query experiments proved the feasibility,effectiveness,and stability of this *** experiments prove that the method has higher stability than,and that the average query time is 38%lower than that for,the large table index storage strategy,which greatly improves the storage and query efficiency of gridded images.

关键词： Gridded images distributed storage system metadata management Ceph remote sensing

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Construction of Minimum Bandwidth Regenerating Codes with Combinatorial Design

引用

Wuhan University Journal of Natural Sciences 2016年第3期21卷 229-234页

作者： CAI Feng GUO Wangmei State Key Laboratory of Integrated Services Networks Xidian University

We study the construction of minimum bandwidth regenerating code with combinatorial design. At first, a method of constructing minimum storage regenerating （MBR） codes is presented, which can tolerate only one-node failure. Then, we give examples to explain the code. Finally, we discuss the case of repairing multiple nodes, and analyze the performance with an example.

关键词： distributed storage system minimum bandwidth regenerating codes combinatorial design network coding

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：