25,487 research outputs found
CORE: Augmenting Regenerating-Coding-Based Recovery for Single and Concurrent Failures in Distributed Storage Systems
Data availability is critical in distributed storage systems, especially when
node failures are prevalent in real life. A key requirement is to minimize the
amount of data transferred among nodes when recovering the lost or unavailable
data of failed nodes. This paper explores recovery solutions based on
regenerating codes, which are shown to provide fault-tolerant storage and
minimum recovery bandwidth. Existing optimal regenerating codes are designed
for single node failures. We build a system called CORE, which augments
existing optimal regenerating codes to support a general number of failures
including single and concurrent failures. We theoretically show that CORE
achieves the minimum possible recovery bandwidth for most cases. We implement
CORE and evaluate our prototype atop a Hadoop HDFS cluster testbed with up to
20 storage nodes. We demonstrate that our CORE prototype conforms to our
theoretical findings and achieves recovery bandwidth saving when compared to
the conventional recovery approach based on erasure codes.Comment: 25 page
A New Approach to Coding in Content Based MANETs
In content-based mobile ad hoc networks (CB-MANETs), random linear network
coding (NC) can be used to reliably disseminate large files under intermittent
connectivity. Conventional NC involves random unrestricted coding at
intermediate nodes. This however is vulnerable to pollution attacks. To avoid
attacks, a brute force approach is to restrict the mixing at the source.
However, source restricted NC generally reduces the robustness of the code in
the face of errors, losses and mobility induced intermittence. CB-MANETs
introduce a new option. Caching is common in CB MANETs and a fully reassembled
cached file can be viewed as a new source. Thus, NC packets can be mixed at all
sources (including the originator and the intermediate caches) yet still
providing protection from pollution. The hypothesis we wish to test in this
paper is whether in CB-MANETs with sufficient caches of a file, the performance
(in terms of robustness) of the restricted coding equals that of unrestricted
coding.
In this paper, we examine and compare unrestricted coding to full cache
coding, source only coding, and no coding. As expected, we find that full cache
coding remains competitive with unrestricted coding while maintaining full
protection against pollution attacks
Development, simulation validation, and wind tunnel testing of a digital controller system for flutter suppression
Flutter suppression (FS) is one of the active control concepts being investigated by the AFW program. The design goal for FS control laws was to increase the passive flutter dynamic pressure by 30 percent. In order to meet this goal, the FS control laws had to be capable of suppressing both symmetric and antisymmetric flutter instabilities simultaneously. In addition, the FS control laws had to be practical and low-order, robust and capable of real time execution within the 200 hz. sampling time. The purpose here is to present an overview of the development, simulation validation, and wind tunnel testing of a digital controller system for flutter suppression
- …