Regenerating Codes for Distributed Storage Networks

In a storage system where individual storage nodes are prone to failure, the redundant storage of data in a distributed manner across multiple nodes is a must to ensure reliability. Reed-Solomon codes possess the reconstruction property under which the stored data can be recovered by connecting to any k of the n nodes in the network across which data is dispersed. This property can be shown to lead to vastly improved network reliability over simple replication schemes. Also of interest in such storage systems is the minimization of the repair bandwidth, i.e., the amount of data needed to be downloaded from the network in order to repair a single failed node. Reed-Solomon codes perform poorly here as they require the entire data to be downloaded. Regenerating codes are a new class of codes which minimize the repair bandwidth while retaining the reconstruction property. This paper provides an overview of regenerating codes including a discussion on the explicit construction of optimum codes.

Representation of Thermodynamic Properties of Dilute Multi-Component Solutions--Options and Constraints

The different formalisms for the representation of thermodynamic data on dilute multicomponent solutions are critically reviewed. The thermodynamic consistency of the formalisms are examined and the interrelations between them are highlighted. The options are constraints in the use of the interaction parameter and Darken's quadratic formalisms for multicomponent solutions are discussed in the light of the available experimental data. Truncatred Maclaurin series expansion is thermodynamically inconsistent unless special relations between interaction parameters are invoked. However, the lack of strict mathematical consistency does not affect the practical use of the formalism. Expressions for excess partial properties can be integrated along defined composition paths without significant loss of accuracy. Although thermodynamically consistent, the applicability of Darken's quadratic formalism to strongly interacting systems remains to be established by experiment.

Sonochemical synthesis of Ce1-xFexO2-delta (0 <= x <= 0.45) and Ce0.65Fe0.33Pd0.02O2-delta nanocrystallites: oxygen storage material, CO oxidation and water gas shift catalyst

Nanocrystalline Ce1-xFexO2-delta (0 <= x <= 0.45) and Ce0.65Fe0.33Pd0.02O2-delta of similar to 4 nm sizes were synthesized by a sonochemical method using diethyletriamine (DETA) as a complexing agent. Compounds were characterized by powder X-ray diffraction (XRD), X-ray photo-electron spectroscopy (XPS) and transmission electron microscopy (TEM). Ce1-xFexO2-delta (0 <= x <= 0.45) and Ce0.65Fe0.33Pd0.02O2-delta crystallize in fluorite structure where Fe is in +3, Ce is in +4 and Pd is in +2 oxidation state. Due to substitution of smaller Fe3+ ion in CeO2, lattice oxygen is activated and 33% Fe substituted CeO2 i.e. Ce0.67Fe0.33O1.835 reversibly releases 0.31O] up to 600 degrees C which is higher or comparable to the oxygen storage capacity of CeO2-ZrO2 based solid solutions (Catal. Today 2002, 74, 225-234). Due to interaction of redox potentials of Pd2+/0(0.89 V) and Fe3+/2+ (0.77 V) with Ce4+/3+ (1.61 V), Pd ion accelerates the electron transfer from Fe2+ to Ce4+ in Ce0.65Fe0.33Pd0.02O1.815, making it a high oxygen storage material as well as a highly active catalyst for CO oxidation and water gas shift reaction. The activation energy for CO oxidation with Ce0.65Fe0.33Pd0.02O1.815 is found to be as low as 38 kJ mol(-1). Ce0.67Fe0.33O1.835 and Ce0.65Fe0.33Pd0.02O1.815 have also shown high activity for the water gas shift reaction. CO conversion to CO2 is 100% H-2 specific with these catalysts and conversion rate was found to be as high 27.2 mu moles g(-1) s(-1) and the activation energy was found to be 46.4 kJ mol(-1) for Ce0.65Fe0.33Pd0.02O1.815.

Critical phenomena in polymer solutions: Scaling of the free energy

The thermodynamics of monodisperse solutions of polymers in the neighborhood of the phase separation temperature is studied by means of Wilson’s recursion relation approach, starting from an effective ϕ4 Hamiltonian derived from a continuum model of a many‐chain system in poor solvents. Details of the chain statistics are contained in the coefficients of the field variables ϕ, so that the parameter space of the Hamiltonian includes the temperature, coupling constant, molecular weight, and excluded volume interaction. The recursion relations are solved under a series of simplifying assumptions, providing the scaling forms of the relevant parameters, which are then used to determine the scaling form of the free energy. The free energy, in turn, is used to calculate the other singular thermodynamic properties of the solution. These are characteristically power laws in the reduced temperature and molecular weight, with the temperature exponents being the same as those of the 3d Ising model. The molecular weight exponents are unique to polymer solutions, and the calculated values compare well with the available experimental data.

Solubility of sulfur dioxide at low partial pressures in dilute sulfuric acid solutions

Equilibrium of dissolution of sulfur dioxide at ppm levels in aqueous solutions of dilute sulfuric acid is analyzed, and a general expression is derived relating the total concentration of sulfur dioxide in the liquid phase to the partial pressure of SO2 in the gas and to the concentration of sulfuric acid in the solution. The equation is simplified for zero and high concentrations of the acid. Experiments at high concentrations of sulfuric acid have enabled the direct determination of Henry’s constant and its dependency on temperature. Heat of dissolution is -31.47 kJ/mol. Experiments in the absence of sulfuric acid and the related simplified expression have led to the determination of the equilibrium constant of the hydrolysis of aqueous sulfur dioxide and its temperature dependency.The heat of hydrolysis is 15.69 kJ/mol. The model equation with these parameters predicts the experimental data of the present work as well as the reported data very well.

Surface tension of some binary organic solutions of alkylbenzenes and 1-alkanols

The surface tensions of binary mixtures of 1-alkanols (Cl-Cd with benzene, toluene, or xylene were measured. The results were correlated with the activity coefficients calculated through the group contribution method such as UNIFAC, with the maximum deviation from the experimental results less that 5%. The coefficients of the correlation are correlated with the chain length.

Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.

A Flexible Class of Regenerating Codes for Distributed Storage

In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.

Power Management and Data Rate Maximization in Wireless Energy Harvesting Sensors

This paper considers the problem of power management and throughput maximization for energy neutral operation when using Energy Harvesting Sensors (EHS) to send data over wireless links. It is assumed that the EHS are designed to transmit data at a constant rate (using a fixed modulation and coding scheme) but are power-controlled. A framework under which the system designer can optimize the performance of EHS when the channel is Rayleigh fading is developed. For example, the highest average data rate that can be supported over a Rayleigh fading channel given the energy harvesting capability, the battery power storage efficiency and the maximum allowed transmit energy per slot is derived. Furthermore, the optimum transmission scheme that guarantees a particular data throughput is derived. The usefulness of the framework developed is illustrated through simulation results for specific examples.

Localized data gathering paradigms for small and marginal farm lands in Semi-Arid region – Issues and Concerns

In this work we explore the application of wireless sensor technologies for the benefit of small and marginal farmers in semi-arid regions. The focus in this paper is to discuss the merits and demerits of data gathering & relay paradigms that collect localized data over a wide area. The data gathered includes soil moisture, temperature, pressure, rain data and humidity. The challenge to technology intervention comes mainly due to two reasons: (a) Farmers in general are interested in crop yield specific to their piece of land. This is because soil texture can vary rapidly over small regions. (b) Due to a high run-off, the soil moisture retention can vary from region to region depending on the topology of the farm. Both these reasons alter the needs drastically. Additionally, small and marginal farms can be sandwiched between rich farm lands. The village has very little access to grid power. Power cuts can extend up to 12 hours in a day and upto 3 or 4 days during some months in the year. In this paper, we discuss 3 technology paradigms for data relaying. These include Wi-Fi (Wireless Fidelity), GPRS (General Packet Radio Service) and DTN (Delay and Disruption Tolerant Network) technologies. We detail the merits and demerits of each of these solutions and provide our final recommendations. The project site is a village called Chennakesavapura in the state of Karnataka, India.

Profile-Based Load Scheduling in Wireless Energy Harvesting Sensors for Data Rate Maximization

In this paper, power management algorithms for energy harvesting sensors (EHS) that operate purely based on energy harvested from the environment are proposed. To maintain energy neutrality, EHS nodes schedule their utilization of the harvested power so as to save/draw energy into/from an inefficient battery during peak/low energy harvesting periods, respectively. Under this constraint, one of the key system design goals is to transmit as much data as possible given the energy harvesting profile. For implementational simplicity, it is assumed that the EHS transmits at a constant data rate with power control, when the channel is sufficiently good. By converting the data rate maximization problem into a convex optimization problem, the optimal load scheduling (power management) algorithm that maximizes the average data rate subject to energy neutrality is derived. Also, the energy storage requirements on the battery for implementing the proposed algorithm are calculated. Further, robust schemes that account for the insufficiency of battery storage capacity, or errors in the prediction of the harvested power are proposed. The superior performance of the proposed algorithms over conventional scheduling schemes are demonstrated through computations using numerical data from solar energy harvesting databases.

Explicit codes uniformly reducing repair bandwidth in distributed storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit codes minimizing repair bandwidth for distributed storage

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.

Interference Alignment as a Tool in Network Coding as Applied to Distributed Storage

In this paper, we outline an approach to the task of designing network codes in a non-multicast setting. Our approach makes use of the concept of interference alignment. As an example, we consider the distributed storage problem where the data is stored across the network in n nodes and where a data collector can recover the data by connecting to any k of the n nodes and where furthermore, upon failure of a node, a new node can replicate the data stored in the failed node while minimizing the repair bandwidth.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.