network coding for access in erasure coded storage system
M.Vidhyapriya,N.Priyanka,A.Thiyagarajan
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:4 Issue:3 Year: 01 April,2016 Pages:707-714
Abstract
No single encoding scheme or fault model is optimal for all data. A versatile storage system allows them to be matched to access patterns, reliability requirements, and cost goals on a per-data item basis. Ursa Minor is a cluster-based storage system that allows data-specific selection of, and on-line changes to, encoding schemes and fault models. When using the specialized distributions, aggregate cluster throughput nearly doubled. Programs written in this functional style are automatically parallelized and executed on a large cluster of commodity machines. This allows programmers without any experience with parallel and distributed systems to easily utilize the resources of a large distributed system While the latency metric has been the focus of many research studies, the bandwidth metric has received comparatively little attention. Peer-to-peer systems are positioned to take advantage of gains in network bandwidth, storage capacity, and computational resources to provide longterm durable storage infrastructures.
Kewords
Erasure coded storage system, degraded reads, IO parallelism, HDFS
Reference
[1] Yunfeng Zhu, Jian Lin, Patrick P. C. Lee, and Yinlong Xu, “Boosting Degraded Reads in Heterogeneous Erasure-Coded Storage Systems”. [2] Osama khan, Randle burns,James plank, William pierce, “Rethinking erasurecodes for cloud file system” , 2005. [3] Kevin M.greenan, ethan L.Miller, Jay J.Wylie, “Reliability of flat Xor based erasure codes on heterogenous devices”, 2008. [4] Alexandros G.Diemakis, Yunnan Wu, Martin O.Wain Wright, “Network coding for distributed storage system”, 2008.
