The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
Network Coding for Distributed Storage Systems
[article]
2007
arXiv
pre-print
Preserved Fulltext
In this paper, we introduce a general technique to analyze storage architectures that combine any form of coding and replication, as well as presenting two new schemes for maintaining redundancy using ...
First, we show how to optimally generate MDS fragments directly from existing fragments in the system. ...
Therefore, MDS codes have a constant multiplicative overhead in bandwidth, but are optimal in storage for any n, k. ...
arXiv:cs/0702015v1
fatcat:x3auznuns5c6jpwyzx3fltpnge
Network Coding for Distributed Storage Systems
2010
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce a general technique to analyze storage architectures that combine any form of coding and replication, as well as presenting two new schemes for maintaining redundancy using ...
First, we show how to optimally generate MDS fragments directly from existing fragments in the system. ...
Therefore, MDS codes have a constant multiplicative overhead in bandwidth, but are optimal in storage for any n, k. ...
doi:10.1109/tit.2010.2054295
fatcat:z6kez36jkjb37kybafdwgjgo2q
Network Coding for Distributed Storage Systems
2007
IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce a general technique to analyze storage architectures that combine any form of coding and replication, as well as presenting two new schemes for maintaining redundancy using ...
First, we show how to optimally generate MDS fragments directly from existing fragments in the system. ...
Therefore, MDS codes have a constant multiplicative overhead in bandwidth, but are optimal in storage for any n, k. ...
doi:10.1109/infcom.2007.232
dblp:conf/infocom/DimakisGWR07
fatcat:ukgwrp57vvhi5mx7k7cdx6eqye
Accelerating Data Regeneration for Distributed Storage Systems with Heterogeneous Link Capacities
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Distributed storage systems provide large-scale reliable data storage services by spreading redundancy across a large group of storage nodes. ...
In such a large system, node failures take place on a regular basis. ...
In this section, we reconsider the problem of optimizing the regeneration time for tree-structured regeneration and maintaining the MDS property featured by entire distributed storage systems. ...
arXiv:1603.05163v1
fatcat:jl4y4x4mbfgepmqs32rqo4o2ae
NCCloud: A Network-Coding-Based Storage System in a Cloud-of-Clouds
2014
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We validate that FMSR codes provide significant monetary cost savings in repair over RAID-6 codes, while having comparable response time performance in normal cloud storage operations such as upload/download ...
We present a proxy-based storage system for fault-tolerant multiple-cloud storage called NCCloud, which achieves cost-effective repair for a permanent single-cloud failure. ...
The first part analyzes in detail the time taken by different NCCloud operations. It is done on a local cloud storage testbed in order to lessen the effects of network fluctuations. ...
doi:10.1109/tc.2013.167
fatcat:m3fmdoh575bwridgauu72ra3ke
A Trust System Based on Multi Level Virus Detection
2010
Journal of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
It detected virus-code by a behavior approach monitors and determined a virus activity at several protection system levels. ...
Approach: This study introduced new multilevel virus detection (MDS). Results: This system model depended on an advance behavior blocking technology. ...
It searches for way viruses getting in to the Notepad analyzer uses this indications: Cd%winDir%\system| Dettree/y*_dll Cd\deltree/y*.sys This code .BAT that mean create Batch file and create virus will ...
doi:10.3844/jcssp.2010.457.460
fatcat:wnjp7uj3lzerhkurxmliubtggy
CORE: Augmenting Regenerating-Coding-Based Recovery for Single and Concurrent Failures in Distributed Storage Systems
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Data availability is critical in distributed storage systems, especially when node failures are prevalent in real life. ...
Existing optimal regenerating codes are designed for single node failures. ...
That is, an (n, k) MDS-coded storage system can tolerate any n − k out of n concurrent failures. ...
arXiv:1302.3344v2
fatcat:wbwslcyexjemhe4eeof7iicnpa
CORE: Augmenting regenerating-coding-based recovery for single and concurrent failures in distributed storage systems
2013
2013 IEEE 29th Symposium on Mass Storage Systems and Technologies (MSST)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Data availability is critical in distributed storage systems, especially when node failures are prevalent in real life. ...
Existing optimal regenerating codes are designed for single node failures. ...
That is, an (n, k) MDS-coded storage system can tolerate any n − k out of n concurrent failures. ...
doi:10.1109/msst.2013.6558428
dblp:conf/mss/LiLL13
fatcat:efz63cpypnbbhnsurof4nb3nwm
Maximum Lifetime for Data Regeneration in Wireless Sensor Networks
[article]
2011
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2010 pre-print arXiv:1012.5834v1 fatcat:jjdxmeax45hu3ed3cijtw4arlqOther Versions
Previous works showed that the benefits in using erasure coding for robust storage over replication are made unappealing by the complication in regenerating lost data. ...
To maintain the same level of redundancy when one storage node fails, erasure coded data can be restored onto some other storage node by having this node download respective pieces from other live storage ...
Even though the storage of MDS codes are less than for replication, the complication arising from downloading from k users as well as the low utilization in downloading the entire file size just to regenerate ...
arXiv:1012.5834v5
fatcat:gglibw6kvvbjfoostrbl5wniri
Network Coding for Distributed Storage Systems
[article]
2008
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For an erasure coded system, a common practice to repair from a node failure is for a new node to download subsets of data stored at a number of surviving nodes, reconstruct a lost coded block using the ...
Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. ...
By analyzing the connectivity in the information flow graph, we obtain necessary conditions for all possible storage codes, as shown in Lemma 1. ...
arXiv:0803.0632v1
fatcat:ylm5ysrglvdahg3uhjlgten6jq
Topology-Aware Node Selection for Data Regeneration in Heterogeneous Distributed Storage Systems
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We analyze the regeneration time and propose node selection algorithms for overlay networks and real-world topologies. ...
Minimizing such a regeneration time is critical to the reliability of distributed storage systems. ...
For erasure codes based storage systems, Dimakis et al. [8] found that the amount of downloaded data can be reduced by pre-coding at each provider, which consequently reduces the regeneration time. ...
arXiv:1506.05579v1
fatcat:7mf2gcrbmvfjljy2d44vwvkk2e
What can coding theory do for storage systems?
2013
ACM SIGACT News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
What Can Coding Theory Do for Storage Systems? 1 Introduction Designing a working and performant storage system is a challenging engineering feat. ...
Optimal update-complexity MDS array codes The prospects of deploying in storage systems array codes that have both optimal redundancy (MDS) and optimal update complexity have motivated significant coding-theory ...
doi:10.1145/2447712.2447734
fatcat:vqggf6c3gzhiript23pizutsmy
Distributed computing column 49
2013
ACM SIGACT News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
What Can Coding Theory Do for Storage Systems? 1 Introduction Designing a working and performant storage system is a challenging engineering feat. ...
Optimal update-complexity MDS array codes The prospects of deploying in storage systems array codes that have both optimal redundancy (MDS) and optimal update complexity have motivated significant coding-theory ...
doi:10.1145/2447712.2447733
fatcat:fzgejp4kkrhulhbf4osyq47zba
Rack Aware Data Placement for Network Consumption in Erasure-Coded Clustered Storage Systems
2018
Information
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The amount of encoded data replication in an erasure-coded clustered storage system has a great impact on the bandwidth consumption and network latency, mostly during data reconstruction. ...
At the same time, it has better performance than the typical random distribution method in terms of network usage and data reconstruction efficiency. ...
In addition, the maximum short separate (MDS) code can obtain the optimal storage efficiency k/n, which is commonly used in most storage systems. ...
doi:10.3390/info9070150
fatcat:pwufr6ulfvfevion5vyrwpyhda
When queueing meets coding: Optimal-latency data retrieving scheme in storage clouds
2014
IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, we study the problem of reducing the delay of downloading data from cloud storage systems by leveraging multiple parallel threads, assuming that the data has been encoded and stored in the ...
For the tractability of the theoretical analysis, we assume that the chunk downloading time is i.i.d. exponentially distributed. ...
In the following, we will develop a new queueing model for analyzing such cloud systems that use FEC codes for data storage. Before we proceed, we first have the following definitions. ...
doi:10.1109/infocom.2014.6848034
dblp:conf/infocom/ChenSKHSLLS14
fatcat:hwkdagaakras7d7nakr6omtvw4
« Previous
Showing results 1 — 15 out of 896 results