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

Dynamic-EC:an efficient dynamic erasure coding method for permissioned blockchain systems

Frontiers of Computer Science 2025年第1期19卷 15-28页

作者： Mizhipeng ZHANG Chentao WU Jie LI Minyi GUO Department of Computer Science and Engineering Shanghai Jiao Tong UniversityShanghai 200200China Yancheng Blockchain Research Institute Hengyang 421200China

Blockchain as a decentralized storage technology is widely used in many *** has extremely strict requirements for reliability because there are many potentially malicious ***,blockchain is a chain storage structure formed by interconnecting blocks1),which are stored by full replication method,where each node stores a replica of all blocks and the data consistency is maintained by the consensus *** decrease the storage overhead,previous approaches such as BFT-Store and Partition Chain store blocks via erasure ***,existing erasure coding based methods utilize static encoding schema to tolerant f malicious nodes,but in the typical cases,the number of malicious nodes is much smaller than f as described in previous *** redundant parities to tolerate excessive malicious nodes introduces unnecessary storage *** solve the above problem,we propose Dynamic-EC,which is a Dynamic erasure coding method in permissioned blockchain *** key idea of Dynamic-EC is to reduce the storage overhead by dynamically adjusting the total number of parities according to the risk level of the whole system,which is determined by the number of perceived malicious nodes,while ensuring the system *** demonstrate the effectiveness of Dynamic-EC,we conduct several experiments on an open source blockchain software *** results show that,compared to the state-of-the-art erasure coding methods,Dynamic-EC reduces the storage overhead by up to 42%,and decreases the average write latency of blocks by up to 25%,respectively.

关键词： blockchain Byzantine Fault Tolerance(BFT) erasure coding consensus reputation evaluation

来源：评论

学校读者我要写书评

暂无评论

EdgeHydra: Fault-Tolerant Edge Data Distribution Based on erasure coding

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2025年第1期36卷 29-42页

作者： He, Qiang Zhang, Guobiao Wang, Jiawei Luo, Ruikun Dai, Xiaohai Hu, Yuchong Chen, Feifei Jin, Hai Yang, Yun Huazhong Univ Sci & Technol Natl Engn Res Ctr Big Data Technol & Syst Sch Comp Sci & Technol Serv Comp Technol & Syst LabCluster & Grid Comp L Wuhan 430074 Peoples R China Swinburne Univ Technol Dept Comp Technol Melbourne Vic 3122 Australia Huazhong Univ Sci & Technol Sch Comp Sci & Technol Key Lab Informat Storage Syst Minist Educ China Wuhan 430074 Peoples R China Deakin Univ Sch Informat Technol Geelong Vic 3125 Australia

In the edge computing environment, app vendors can distribute popular data from the cloud to edge servers to provide low-latency data retrieval. A key problem is how to distribute these data from the cloud to edge servers cost-effectively. Under current schemes, a file is divided into some data blocks for parallel transmissions from the cloud to target edge servers. Edge servers can then combine received data blocks to reconstruct the file. While this method expedites the data distribution process, it presents potential drawbacks. It is sensitive to transmission delays and transmission failures caused by runtime exceptions like network fluctuations and server failures. This paper presents EdgeHydra, the first edge data distribution scheme that tackles this challenge through fault tolerance based on erasure coding. Under EdgeHydra, a file is encoded into data blocks and parity blocks for parallel transmission from the cloud to target edge servers. An edge server can reconstruct the file upon the receipt of a sufficient number of these blocks without having to wait for all the blocks in transmission. It also innovatively employs a leaderless block supplement mechanism to ensure the receipt of sufficient blocks for individual target edge servers. These improve the robustness of the data distribution process significantly. Extensive experiments show that EdgeHydra can tolerate delays and failures in individual transmission links effectively, outperforming the state-of-the-art scheme by up to 50.54% in distribution time.

关键词： Servers Delays Costs Encoding Runtime Fluctuations Fault tolerant systems Fault tolerance Steiner trees Edge computing Edge data caching erasure coding data distribution distributed transmission

来源：评论

学校读者我要写书评

暂无评论

Towards benchmarking erasure coding schemes in object storage system: A systematic review

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2025年 163卷

作者： Noor, Jannatun Upoma, Rezuana Imtiaz Sakif, Md. Sadiqul Islam Islam, A. B. M. Alim Al BRAC Univ Sch Data & Sci Comp Sustainabil & Social Good C2SG Res Grp Dhaka Bangladesh BRAC Univ Dept Comp Sci & Engn Sch Data & Sci Dhaka Bangladesh Bangladesh Univ Engn & Technol Dept CSE Next Generat Comp Res Grp Dhaka Bangladesh

erasure coding (EC) in cloud storage minimizes data replication by reconstructing data from parity fragments. This method enhances data redundancy and efficiency while reducing storage costs and improving fault tolerance. It is more advantageous than replication in Object Storage Systems. EC guarantees data integrity by ensuring lossless transmission of all coded pieces. As data volumes continue to increase rapidly, the time efficiency of the EC method becomes crucial in ensuring optimal system performance. Various variables, including the algorithm employed, data size, number of storage nodes, hardware resources, and network conditions, can influence the speed of EC operations. Although some literature covers various aspects, there is still a research gap in understanding the I/O activities, time efficiency, and fault tolerance of EC in object storage systems. Hence, our research aims to address these challenges in cloud-based object storage systems. We analyze and benchmark the data storage I/O performance of OpenStack Swift, focusing on the time efficiency of the Reed-Solomon (RS) algorithm across two datasets. Additionally, our contributions include benchmarking EC performance in both local and remote testbeds, utilizing the SimEDC simulator for comprehensive efficiency and fault tolerance assessments. Moreover, we create a comprehensive dataset (MCSD-100) for benchmarking and conduct a systematic literature review. Finally, we identify and discuss future opportunities for enhancing EC in cloud-based object storage systems.

关键词： erasure coding OpenStack swift Reed-Solomon codes Cloud storage system

来源：评论

学校读者我要写书评

暂无评论

An Optimized Method for Batch Recovery Based on erasure coding in Heterogeneous Network

引用

SENSORS 2025年第2期25卷 346-346页

作者： Song, Ying Liu, Jialin Tian, Yingai Wang, Bo Beijing Informat Sci & Technol Univ Sch Comp Sci Beijing 102206 Peoples R China Zhengzhou Univ Light Ind Software Engn Coll Zhengzhou 450002 Peoples R China

With the rapid development of IoT technology, sensors are widely used for monitoring environmental parameters. The data collected by sensors needs to be stored, and distributed storage systems provide an excellent platform to handle this vast amount of data. To enhance data reliability and reduce storage costs, erasure coding technology can be employed within distributed storage systems. However, the process of recovering lost or damaged data inevitably generates significant cross-rack traffic. In recent years, various batch recovery methods have been designed to improve data recovery speed and reduce cross-rack recovery traffic, but they have limitations in different aspects, such as less consideration for heterogeneous cross-rack bandwidth and insufficient handling of recovery link scheduling. This paper proposes the HBRepair recovery framework, aimed at improving data recovery speed by balancing the recovery load and reducing cross-rack recovery traffic. Firstly, HBRepair strategically selects helper blocks and nodes for storing recovery blocks to find the optimal batch recovery plan. Then, it selectively and rationally schedules recovery links to saturate idle bandwidth resources and avoid network congestion. Experimental results show that by optimizing the use of cross-rack bandwidth, HBRepair can reduce cross-rack recovery time by up to 26.74%, effectively addressing the shortcomings of existing methods.

关键词： bandwidth management load balancing distributed storage system heterogeneous network erasure coding batch recovery Internet of Things

来源：评论

学校读者我要写书评

暂无评论

erasure coding FOR FAULT-OBLIVIOUS LINEAR SYSTEM SOLVERS

引用

SIAM JOURNAL ON SCIENTIFIC COMPUTING 2017年第1期39卷 C48-C64页

作者： Zhu, Yao Gleich, David F. Grama, Ananth Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

Dealing with faults is an important problem as parallel and distributed systems scale to millions of processing cores. Traditional methods for dealing with faults include checkpoint-restart, active replicas, and deterministic replay. Each of these techniques has associated resource overheads and constraints. In this paper, we propose an alternate approach to dealing with faults based on input augmentation. This approach, which is an algorithmic analog of erasure-coded storage, applies a minimally modified algorithm on the augmented input to produce an augmented output. The execution of such an algorithm proceeds completely oblivious to faults in the system. In the event of one or more faults, the real solution is recovered using a rapid reconstruction method from the augmented output. We demonstrate this approach on the problem of solving sparse linear systems using a conjugate gradient solver, where we present input augmentation and output recovery techniques. Through simulations, we show that our approach can be made oblivious to a large number of faults with low computational overhead. Specifically, we demonstrate cases where a single fault can be corrected with less than 10% overhead in time, and even in extreme cases (fault rates of 20%), our approach is able to compute a solution with reasonable overhead.

关键词： erasure coding linear system solvers fault oblivious computation algorithm based fault tolerance

来源：评论

学校读者我要写书评

暂无评论

erasure coding for Cloud Storage Systems: A Survey

引用

Tsinghua Science and Technology 2013年第3期18卷 259-272页

作者： Jun Li Baochun Li the Department of Electrical and Computing Engineering University of Toronto

In the current era of cloud computing, data stored in the cloud is being generated at a tremendous speed, and thus the cloud storage system has become one of the key components in cloud computing. By storing a substantial amount of data in commodity disks inside the data center that hosts the cloud, the cloud storage system must consider one question very carefully： how do we store data reliably with a high efficiency in terms of both storage overhead and data integrity？ Though it is easy to store replicated data to tolerate a certain amount of data losses, it suffers from a very low storage efficiency. Conventional erasure coding techniques, such as Reed-Solomon codes, are able to achieve a much lower storage cost with the same level of tolerance against disk failures. However, it incurs much higher repair costs, not to mention an even higher access latency. In this sense, designing new coding techniques for cloud storage systems has gained a significant amount of attention in both academia and the industry. In this paper, we examine the existing results of coding techniques for cloud storage systems. Specifically, we present these coding techniques into two categories： regenerating codes and locally repairable codes. These two kinds of codes meet the requirements of cloud storage along two different axes： optimizing bandwidth and I/O overhead. We present an overview of recent advances in these two categories of coding techniques. Moreover, we introduce the main ideas of some specific coding techniques at a high level, and discuss their motivations and performance.

关键词： erasure coding cloud storage regenerating codes locally repairable codes

来源：评论

学校读者我要写书评

暂无评论

erasure coding-Oriented Data Update for Cloud Storage: A Survey

引用

IEEE ACCESS 2020年 8卷 227982-227998页

作者： Xiao, Yifei Zhou, Shijie Zhong, Linpeng Univ Elect Sci & Technol China Sch Informat & Software Engn Chengdu 610054 Peoples R China

erasure coding is the leading technique to achieve resilient redundancy in cloud storage systems. However, it introduces two prominent issues: data repair and data update. Compare to data repair, data update is much more common. A variety of update schemes based on erasure coding have been proposed in the literature to optimize data update, such as computation optimization, network traffic overhead reduction, IO overhead reduction, and modern hardware acceleration. However, all of these techniques were proposed individually previously. In this work, we seek to summarize them systematically and group them in a new form. First, we generalize the state-of-the-art researches and introduce existing classifications. Moreover, based on our observation, we propose two classifications: resource-based classification and tier-based classification. In resource-based classification, we group these techniques according to the resource they optimize and introduce them in detail. In tier-based classification, we propose a novel hybrid technique framework with five tiers and conduct a comprehensive comparison between these techniques. We make a conjecture that most techniques in different tiers can be used jointly. Finally, we conclude the research challenges and potential future works.

关键词： Encoding Cloud computing Cascading style sheets Optimized production technology Processor scheduling Maintenance engineering Data update cloud storage erasure coding survey

来源：评论

学校读者我要写书评

暂无评论

erasure coding for reliable adaptive retransmission in wireless broadcast/multicast systems

引用

TELECOMMUNICATION SYSTEMS 2017年第4期65卷 591-604页

作者： Zribi, Amin Pyndiah, Ramesh Mahendra Saoudi, Samir Lagrange, Xavier Tunis Elmanar Univ ENIT SysCom Lab BP 37 Tunis 1002 Tunisia Higher Inst Commun Technol IsetCom Elgazala TechnopkRaoued Rd Ariana 2083 Tunisia CNRS Inst Mines Telecom Telecom Bretagne Lab STICC Dept SCUMR 6285 Technopole Brest IroiseCS 83818 F-29238 Brest France IRISA Telecom Bretagne Inst Mines Telecom 2 Rue ChataigneraieCS 17 607 F-35576 Cesson Sevigne France

In this paper, we present new adaptive automatic repeat request (ARQ) schemes for wireless broadcast/multicast combining erasure coding (EC) and packet retransmission. Traditional approaches rely on retransmitting the lost packets in a point-to-point or point-to-multipoint mode. The main idea behind the presented protocols is to retransmit adaptive combinations of the lost packets using EC, which can help several receivers to recover the lost information with fewer retransmission attempts. We propose two versions of EC-based ARQ protocols, and investigate theoretically the corresponding transmission bandwidths in different contexts. We show through simulation results the efficiency of the proposed protocols with respect to conventional ARQ strategies and new published ARQ works for broadcast/multicast. Finally, a new sliding window NACK feedback policy is presented for the case of a high number of receivers to avoid the feedback implosion problem.

关键词： Broadcast Error correction codes erasure coding Feedback communications ARQ Multicast Wireless communications

来源：评论

学校读者我要写书评

暂无评论

erasure coding for Small Objects in In-Memory KV Storage 17

Erasure Coding for Small Objects in In-Memory KV Storage

引用

10th ACM International Systems and Storage Conference (Systor)

作者： Yiu, Matt M. T. Chan, Helen H. W. Lee, Patrick P. C. Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Peoples R China

ISBN: (纸本)9781450350358

We present MemEC, an erasure-coding-based in-memory key-value (KV) store that achieves high availability and fast recovery while keeping low data redundancy across storage servers. MemEC is specifically designed for workloads dominated by small objects. By encoding objects in entirety, MemEC is shown to incur 60% less storage redundancy for small objects than existing replication- and erasure-coding-based approaches. It also supports graceful transitions between decentralized requests in normal mode (i.e., no failures) and coordinated requests in degraded mode (i.e., with failures). We evaluate our MemEC prototype via testbed experiments under read-heavy and update-heavy YCSB workloads. We show that MemEC achieves high throughput and low latency in both normal and degraded modes, and supports fast transitions between the two modes.

关键词： erasure coding In-memory storage

来源：评论

学校读者我要写书评

暂无评论

erasure coding Based Efficient Communication for Internet of Things 14

Erasure Coding Based Efficient Communication for Internet of...

引用

14th Annual IEEE International Systems Conference (SysCon)

作者： Liang, Chunchao Liu, Chang Li, Ying Liang, Zhengchuan Eastern New Mexico Univ Dept Math Sci Portales NM 88130 USA Colby Coll Dept Comp Sci Waterville ME 04901 USA Nanjing Univ Dept Comp Sci Nanjing Peoples R China

ISBN: (纸本)9781728153650

Internet of Things (IoTs) becomes an important research area in recent years. In IoTs, the energy is a precious resource. A lot of energy is spent on wireless communication, the information exchange between nodes. For the dynamically changing nature of wireless links, the communication between nodes is complicated and unreliable. An efficient communication protocol is desired to effectively improve the IoTs' performance and extend its life. In this paper, considering the limited energy resource and the nature of ad hoc networks, we review the previous protocols and propose a new protocol that exploits erasure coding for energy efficiency. The proposed protocol is stateless and works in a distributed manner. The original sender encodes the message into multiple packets with erasure coding and broadcasts out these packets. The receivers that do not receive all the packets will rebroadcast the received packets after back-off unless overhearing enough rebroadcasts from neighbors. The back-off is proportionate to the percentage of packets received. Mathematical analysis and simulations verify the viability of our protocol, and shows its better efficiency.

关键词： Internet of Things IoTs wireless ad hoc network erasure coding log normal model energy efficient

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：