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

Efficient erasure-coded data updates based on file class predictions and hybrid writes

COMPUTERS & ELECTRICAL ENGINEERING 2022年第PartB期104卷

作者： Wei, Bing Wu, Jigang Su, Xiaosong Huang, Qiang Liu, Yujun Zhang, Fuhao Guangdong Univ Technol Sch Comp Sci & Technol Guangzhou 510006 Guangdong Peoples R China Chinese Acad Surveying & Mapping Beijing 100830 Peoples R China

A small update write can lead to a partial write to an erasure coding group in erasure-coded storage systems, resulting in a time-consuming write-after-read. This paper presents a data delta and logging based writing approach, named DETOG, to achieve fast partial writes. DETOG classifies files into non-write-only and write-only using machine learning, then adopts different write schemes to perform partial writes according to file classes. For non-write-only files, DETOG uses data deltas that are the differences between latest data values and original data values, instead of parity deltas to reconstruct the failed data. For non-write-only files, DETOG performs in-place data updates and log-based parity updates, so as to balance the overhead of data updates and reads. We implement DETOG on the newly designed prototype storage system to perform performance evaluation. The results of extensive experiments on real-world traces showed that DETOG significantly improved system throughput compared with state-of-the-art methods.

关键词： erasure coding Efficient partial writes Machine learning File classifications Data delta-based hybrid writes

来源：评论

学校读者我要写书评

暂无评论

An Extension for Construction of Systematic MDS Codes With Minimum Repair Bandwidth

An Extension for Construction of Systematic MDS Codes With M...

引用

16th International Conference on Advanced Communication Technology (ICACT)

作者： Zhan, Liang Liang, Songtao Fudan Univ Shanghai Key Lab Intelligent Informat Proc Shanghai 200433 Peoples R China

ISBN: (纸本)9788996865032

Distributed storage systems based on erasure coding usually provide redundancy to increase the reliability and the storage efficiency. One main challenge in the construction of this kind of system is the repair problem: if a node storing encoded information fails, in order to maintain the same level of reliability, we need to create encoded information at a new node. Among various kinds of coding schemes presented in recent years, Wu puts forward a construction of systematic (n, k) -MDS codes for 2k <= n that achieves the minimum repair bandwidth when repairing from k + 1 nodes. In this paper, we optimize Wu's method to make the repairing coefficients have more wideranging choices.

关键词： Distributed storage erasure coding MDS code minimum repair bandwidth repair

来源：评论

学校读者我要写书评

暂无评论

Cost-optimized redundant data storage in the cloud

引用

SERVICE ORIENTED COMPUTING AND APPLICATIONS 2017年第4期11卷 411-426页

作者： Waibel, Philipp Matt, Johannes Hochreiner, Christoph Skarlat, Olena Hans, Ronny Schulte, Stefan Argentinierstr 8-184-1 A-1040 Vienna Austria Rundeturmstr 10 D-64283 Darmstadt Germany

The use of cloud-based storage systems for storing data is a popular alternative to local storage systems. Beside several benefits of cloud-based storages, there are also downsides like vendor lock-in or unavailability. Moreover, the selection of the best fitting storage solution can be a tedious and cumbersome task and the storage requirements may change over time. In this paper, we formulate a system model that uses multiple cloud-based services to realize a redundant and cost-efficient storage. Within this system model, we formulate a local and a global optimization problem that considers historical data access information and predefined quality of service requirements to select a cost-efficient storage solution. Furthermore, we present a heuristic optimization approach for the global optimization. Extensive evaluations show the benefits of our work in comparison with a baseline that follows a state-of-the-art approach. We show that our solutions save up to 30% of the cumulative cost in comparison with the baseline.

关键词： Cloud storage Redundant storage erasure coding Vendor lock-in Long-term storage Global optimization MILP

来源：评论

学校读者我要写书评

暂无评论

A Metadata Redundancy Approach for File Systems over Lossy Packet-based Network

引用

Procedia Computer Science 2018年 131卷 1196-1201页

作者： Guoliang Liu Jianjun Xu Enjoyor Co. Ltd. 2 Xiyuan 8th Road Hangzhou 310030 China Zhejiang University of Technology 18 Chaowang Road Hangzhou 310014 China

Wide Area Network (WAN) has the characteristics of high latency and packet loss. Traditionally, WAN-based file systems use TCP to transfer data and metadata. Due to the properties of TCP, if packet loss occurs during transmission, the sender has to resend the lost contents after timeout, which incurs delay, resulting low performance. In this paper, we propose a metadata redundancy approach to address the issue. We use replication as well as erasure coding to produce redundant data at the server side and send it with the original data using UDP, if the client detects metadata loss and the loss is recoverable, it can recover the metadata locally at client side, which greatly improves file system performance. We carry out performance tests in a simulated WAN environment to evaluate our method. Compared with TCP, test results show our approach achieve good performance in severe delay and persistent packet loss environment.

关键词： file system metadata redundancy erasure coding Wide Area Network (WAN) User Datagram Protocol (UDP)

来源：评论

学校读者我要写书评

暂无评论

TERS: a traffic efficient repair scheme for repairing multiple losses in erasure-coded distributed storage systems

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING 2018年第3期16卷 242-254页

作者： Zheng, LiMing Wang, Xu'an Tian, XiaoBo Li, XiaoDong Officers Coll PAP Dept Elect Technol Jingxiao Rd 489 Chengdu Sichuan Peoples R China Engn Univ CAPF Xian Shaanxi Peoples R China Guilin Univ Elect Technol Guangxi Key Lab Cryptog & Informat Secur Guilin Peoples R China

The high repair traffic and the long repair time of erasure coding have posed a new challenge: how to minimise the amount of data transferred among nodes and reduce the repair time when repairing the lost data. Existing schemes are mostly designed for single node failures, which incur high network traffic and result in low efficiency. In this paper, we propose a traffic efficient repair scheme TERS suitable for repairing data losses when multiple nodes fail. To evaluate the repair cost and the repair time, we provide an implementation of integrating TERS into HDFS-RAID. The numerical results confirm that TERS reduces the repair traffic by 44% on average compared with the traditional erasure codes and regenerating codes. Theoretical analysis shows that TERS effectively reduces the repair time.

关键词： distributed storage erasure coding repair traffic repair time multiple losses

来源：评论

学校读者我要写书评

暂无评论

A Systematic Review on Cloud Storage Mechanisms Concerning e-Healthcare Systems

引用

SENSORS 2020年第18期20卷 5392.-5392.页

作者： Tahir, Adnan Chen, Fei Khan, Habib Ullah Min, Zhong Ahmad, Arshad Nazir, Shah Shafiq, Muhammad Shenzhen Univ Res Inst Network & Informat Secur Shenzhen 518060 Peoples R China Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen 518060 Peoples R China Qatar Univ Coll Business & Econ Dept Accounting & Informat Syst POB 2713 Doha Qatar City Univ Sci & Informat Technol Dept Comp Sci Peshawar 25000 Pakistan Univ Swabi Dept Comp Sci Ambar 23430 Pakistan Guangzhou Univ Cyberspace Inst Technol Guangzhou 510006 Peoples R China

As the expenses of medical care administrations rise and medical services experts are becoming rare, it is up to medical services organizations and institutes to consider the implementation of medical Health Information Technology (HIT) innovation frameworks. HIT permits health associations to smooth out their considerable cycles and offer types of assistance in a more productive and financially savvy way. With the rise of Cloud Storage Computing (CSC), an enormous number of associations and undertakings have moved their healthcare data sources to distributed storage. As the information can be mentioned whenever universally, the accessibility of information becomes an urgent need. Nonetheless, outages in cloud storage essentially influence the accessibility level. Like the other basic variables of cloud storage (e.g., reliability quality, performance, security, and protection), availability also directly impacts the data in cloud storage for e-Healthcare systems. In this paper, we systematically review cloud storage mechanisms concerning the healthcare environment. Additionally, in this paper, the state-of-the-art cloud storage mechanisms are critically reviewed for e-Healthcare systems based on their characteristics. In short, this paper summarizes existing literature based on cloud storage and its impact on healthcare, and it likewise helps researchers, medical specialists, and organizations with a solid foundation for future studies in the healthcare environment.

关键词： cloud computing cloud storage availability e-Healthcare replication erasure coding deduplication

来源：评论

学校读者我要写书评

暂无评论

Decentralized Transaction Mechanism Based on Smart Contract in Distributed Data Storage

引用

INFORMATION 2018年第11期9卷 286页

作者： Gu, Yonggen Hou, Dingding Wu, Xiaohong Tao, Jie Zhang, Yanqiong Huzhou Univ Sch Informat Engn Huzhou 313000 Peoples R China Zhejiang Normal Univ Coll Math & Comp Sci Jinhua 321004 Peoples R China

Distributed data storage has received more attention due to its advantages in reliability, availability and scalability, and it brings both opportunities and challenges for distributed data storage transaction. The traditional transaction system of storage resources, which generally runs in a centralized mode, results in high cost, vendor lock-in and single point failure risk. To overcome the above shortcomings, considering the storage policy with erasure coding, in this paper we propose a decentralized transaction method for cloud storage based on a smart contract, which takes into account the resource cost for distributed data storage. First, to guarantee the availability and decrease the storing cost, a reverse Vickrey-Clarke-Groves (VCG) based auction mechanism is proposed for storage resource selection and transaction. Then we deploy and implement the proposed mechanism by designing a corresponding smart contract. Especially, we address the problem of how to implement a VCG-like mechanism in a blockchain environment. Based on the private chain of Ethereum, we make the simulation for the proposed storage transaction method. The results of simulation show that the proposed transaction model can realize competitive trading of storage resources and ensure the safe and economic operation of resource trading.

关键词： cloud storage VCG (Vickrey-Clarke-Groves) mechanism smart contract security erasure coding

来源：评论

学校读者我要写书评

暂无评论

BEC:A Reliable and Efficient Mechanism for Cloud Storage Service

BEC:A Reliable and Efficient Mechanism for Cloud Storage Ser...

引用

2013 15th IEEE International Conference on Communication Technology

作者： Rui Zhang Chuang Lin Kun Meng Lin Zhu Tsinghua University

ISBN: (纸本)9781479900763

In a cloud storage system,the hardware equipments storing the contents are located in many places and the capabilities of them are *** realities draw a big challenge to providing constant and efficient service to the storage system's *** this paper,intrigued from the features of erasure coding,we design a content storage and delivery mechanism which can tolerate cloud servers' failures,so that ensure the reliability of the cloud storage system while distributing contents *** this mechanism,the users can still retrieve an adequate number of coded packets to recover the original packets after a fixed number of servers ***,through experiments we compare our mechanism to the erasure coding method and the replication redundancy strategy,and validate that our technology takes advantages in fault tolerance and repair efficiency.

关键词： Cloud storage service Reliability erasure coding

来源：评论

学校读者我要写书评

暂无评论

Repair-Optimal Data Placement for Locally Repairable Codes with Optimal Minimum Hamming Distance 22

Repair-Optimal Data Placement for Locally Repairable Codes w...

引用

Proceedings of the 51st International Conference on Parallel Processing

作者： Shuang Ma Si Wu Cheng Li Yinlong Xu University of Science and Technology of China China

ISBN: (纸本)9781450397339

Modern clustered storage systems increasingly adopt erasure coding to realize reliable data storage at low storage redundancy. Locally Repairable Codes (LRC) are a family of practical erasure codes with high repair efficiency. Among various LRC constructions, Optimal-LRC is a recently proposed LRC approach that achieves the optimal Minimum Hamming Distance with low theoretical repair costs. In this paper, we consider the repair performance of Optimal-LRC in clustered storage systems. We show that the conventional flat data placement and random data placement incur substantial cross-cluster repair traffic, which impairs the repair performance. To this end, we design an optimal data placement scheme that provably minimizes the cross-cluster repair traffic, by carefully placing each group of blocks in Optimal-LRC into a minimum number of clusters subject to single-cluster fault tolerance. We implement our optimal data placement scheme on a key-value store prototype atop Memcached, and show via LAN testbed experiments that the optimal data placement significantly improves the repair performance compared to the conventional data placements.

关键词： Data repair Locally Repairable Codes erasure coding Clustered storage

来源：评论

学校读者我要写书评

暂无评论

FAB: building distributed enterprise disk arrays from commodity components

FAB: building distributed enterprise disk arrays from commod...

引用

Proceedings of the 11th international conference on Architectural support for programming languages and operating systems

作者： Yasushi Saito Svend Frølund Alistair Veitch Arif Merchant Susan Spence Hewlett-Packard Laboratories

ISBN: (纸本)9781581138047

This paper describes the design, implementation, and evaluation of a Federated Array of Bricks (FAB), a distributed disk array that provides the reliability of traditional enterprise arrays with lower cost and better scalability. FAB is built from a collection of bricks, small storage appliances containing commodity disks, CPU, NVRAM, and network interface cards. FAB deploys a new majority-voting-based algorithm to replicate or erasure-code logical blocks across bricks and a reconfiguration algorithm to move data in the background when bricks are added or decommissioned. We argue that voting is practical and necessary for reliable, high-throughput storage systems such as FAB. We have implemented a FAB prototype on a 22-node Linux cluster. This prototype sustains 85MB/second of throughput for a database workload, and 270MB/second for a bulk-read workload. In addition, it can outperform traditional master-slave replication through performance decoupling and can handle brick failures and recoveries smoothly without disturbing client requests.

关键词： disk array erasure coding replication voting consensus storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：