Abstract: Techniques are provided for generating data on the optimum number of storage-hops, the location of the storage-hops, and the bandwidth distributions of the storage-hops to construct a complete flow network for transmitting data from a sender to a receiver via a communication network. The flow network can potentially include hundreds of storage-hops, depending on the time and duration of the data flow. An algorithm is further provided for constructing an unbounded flow network from a bounded set of input parameters. Moreover, the complexity of the algorithm does not depend on the number of storage-hops, so the model is suitable for both crowd supported and data center supported transfers.

Abstract: A redundant disk array method includes allocating identically sized logical blocks of storage units together to form a stripe on each of several data storage devices, at least two of the logical blocks in the stripe being located on different data storage devices, generating a lookup table representing a mapping between a logical location of each logical block in the stripe and a physical location of the respective logical block on the corresponding data storage device, and writing data to the physical locations of each logical block in the stripe, the physical locations being obtained from the lookup table. In some cases, at least two of the data storage devices are heterogeneous, and at least two of the data storage devices have a different total number of logical blocks.

Abstract: Techniques are provided for generating data on the optimum number of storage-hops, the location of the storage-hops, and the bandwidth distributions of the storage-hops to construct a complete flow network for transmitting data from a sender to a receiver via a communication network. The flow network can potentially include hundreds of storage-hops, depending on the time and duration of the data flow. An algorithm is further provided for constructing an unbounded flow network from a bounded set of input parameters. Moreover, the complexity of the algorithm does not depend on the number of storage-hops, so the model is suitable for both crowd supported and data center supported transfers.

Abstract: A redundant disk array includes homogeneous or heterogeneous disks divided into chunks, where larger disks have more chunks. Chunks from one or more disks are grouped into bundles containing data stored across multiple disks. Frequently accessed chunks can be moved to under-utilized, faster disks and least frequently used chunks can be moved to larger, slower disks, to balance the distribution of load across all of the disks in the array.

Abstract: Systems and methods are described herein for providing one or more data transfer parameters. A network map of a network is stored, and input data regarding a desired data transfer is received. The input data includes a sender identifier associated with a sender node in the network, a receiver identifier associated with a receiver node in the network, and a performance metric. A time for initiating the desired data transfer is determined based on the network map, the sender identifier, the receiver identifier, and the performance metric, and the determined time is provided as a recommendation for initiating the data transfer.

Abstract: A redundant disk array method includes allocating identically sized logical blocks of storage units together to form a stripe on each of several data storage devices, at least two of the logical blocks in the stripe being located on different data storage devices, generating a lookup table representing a mapping between a logical location of each logical block in the stripe and a physical location of the respective logical block on the corresponding data storage device, and electronically writing data to the physical locations of each logical block in the stripe, the physical locations being obtained from the lookup table. In some cases, at least two of the data storage devices are heterogeneous, and at least two of the data storage devices have a different total number of logical blocks.

Abstract: Systems and methods are described herein for providing one or more data transfer parameters. A network map of a network is stored, and input data regarding a desired data transfer is received. The input data includes a sender identifier associated with a sender node in the network, a receiver identifier associated with a receiver node in the network, and a performance metric. A time for initiating the desired data transfer is determined based on the network map, the sender identifier, the receiver identifier, and the performance metric, and the determined time is provided as a recommendation for initiating the data transfer.