A Multi-Node Co-Allocation Parallel Downloading Algorithm

Abstract:

Article Preview

In distributed data storage, a particular dataset can reside at multiple locations in order to get high availability .Thus, the dataset can be downloaded in parallel from multiple nodes.Throughput between server and client changes dynamically, so the downloading speed can vary unpredictably. A dynamic parallel downloading algorithm based on measurement of bandwidth and bandwidth prediction is produced in this paper and server caching is adopted in order to improve downloading speed. The algorithm dynamically adjusts downloading of the last block to make parallel downloading from multiple servers end almost simultaneously. With this approach, the download time is reduced and the robustness of the downloading system is improved. Besides, the algorithm not only avoids complicated server selecting mechanism, but also improves load balance of the servers.

Info:

Periodical:

Edited by:

Qi Luo

Pages:

1590-1595

DOI:

10.4028/www.scientific.net/AMM.58-60.1590

Citation:

Q. X. Wu et al., "A Multi-Node Co-Allocation Parallel Downloading Algorithm", Applied Mechanics and Materials, Vols. 58-60, pp. 1590-1595, 2011

Online since:

June 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.