Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. The bandwidth required to repair the system after a node failure also plays a crucial role in the system performance. In [1] authors have shown that a tradeoff exists between storage and repair bandwidth. They also have introduced the scheme of regenerating codes whic...

In the present paper, the idea of braking energy regeneration and reusing that energy during acceleration for a refuse truck is comprehended. According to their driving cycle, the refuse trucks have a good potential for braking energy regeneration. On the other hand, hydraulic hybrid is a powertrain with high power density which is appropriate for energy regeneration. In the primary stage of th...

Minimum storage regenerating codes have minimum storage of data in each node and therefore are maximal distance separable (MDS for short) codes. Thus, the number of nodes is upper bounded by 2, where b is the bits of data stored in each node. From both theoretical and practical points of view (see the details in Section 1), it is natural to consider regenerating codes that nearly have minimum s...

Distributed storage systems support failures of individual devices by the use of replication or erasure correcting codes. While erasure correcting codes offer a better storage efficiency than replication for similar fault tolerance, they incur higher CPU consumption, higher network consumption and higher disk I/Os. To address these issues, codes specific to storage systems have been designed. T...

Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. We present a systematic computer search for optimal systematic regenerating codes. To search the space of potential codes, we reduce the potential search space in several ways. We impose an additional symmetry condition on cod...

In a distributed storage environment, where the data is placed in nodes connected through a network, it is likely that one of these nodes fails. It is known that the use of erasure coding improves the fault tolerance and minimizes the redundancy added in distributed storage environments. The use of regenerating codes not only make the most of the erasure coding improvements, but also minimizes ...

Regenerating codes are a class of recently developed codes for distributed storage, that permit data recovery from any k of n nodes, and also have the capability of repairing a failed node by connecting to any d nodes and downloading an amount of data, termed the repair bandwidth, that is on average, significantly less than the size of the data file. These codes optimally trade the storage spac...

For general exact repair regenerating codes, the optimal trade-offs between storage size and repair bandwith remain undetermined. Various outer bounds and partial results have been proposed. Using a simple chain rule argument we identify nonnegative differences between the functional repair and the exact repair outer bounds. One of the differences is then bounded from below by the repair data o...

Caching data files directly on mobile user devices combined with device-to-device (D2D) communications has recently been suggested to improve the capacity of wireless networks. We investigate the performance of regenerating codes in terms of the total energy consumption of a cellular network. We show that regenerating codes can offer large performance gains. It turns out that using redundancy a...

in the present paper, the idea of braking energy regeneration and reusing that energy during acceleration for a refuse truck is comprehended. according to their driving cycle, the refuse trucks have a good potential for braking energy regeneration. on the other hand, hydraulic hybrid is a powertrain with high power density which is appropriate for energy regeneration. in the primary stage of th...